Mathematics Commons^™

Mean Square Estimate For Primitive Lattice Points In Convex Planar Domains, Ryan D. Coatney

Theses and Dissertations

The Gauss circle problem in classical number theory concerns the estimation of N(x) = { (m1;m2) in ZxZ : m1^2 + m2^2 <= x }, the number of integer lattice points inside a circle of radius sqrt(x). Gauss showed that P(x) = N(x)- pi * x satisfi es P(x) = O(sqrt(x)). Later Hardy and Landau independently proved that P(x) = Omega_(x1=4(log x)1=4). It is conjectured that inf{e in R : P(x) = O(x^e )}= 1/4. I. K atai showed that the integral from 0 to X of |P(x)|^2 dx = X^(3/2) + O(X(logX)^2). Similar results to those of the circle have been obtained for regions D in R^2 which contain the origin and whose boundary dD satis fies suff cient smoothness conditions. Denote by P_D(x) the similar error term to P(x) only for the domain D. W. G. Nowak showed that, under appropriate conditions on dD, P_D(x) = Omega_(x1=4(log x)1=4) and that the integral from 0 to X of |P_D(x)|^2 dx = O(X^(3/2)). A result similar to Nowak's mean square estimate is given in the case where only "primitive" lattice points, {(m1;m2) in Z^2 : gcd(m1;m2) = 1 }, are counted in a region D, on assumption of the Riemann Hypothesis.

Modal Logic And Its Applications, Explained Using Puzzles And Examples, Marek Perkowski

Systems Science Friday Noon Seminar Series

The talk introduces Modal Logic as an extension of classical propositional and First Order Logics. We discuss motivations of Lewis to create modal logic system, axioms and rules of proof. Several examples illustrate deriving theorems from axioms. "Muddy Children" puzzle is used to explain the principles of dealing with uncertainty problems where a temporal lack of response is used as additional information. Other examples include "Narrow Bridge" problem/game which relates to the problem of necessary evil in the world, robot planning and law and robot morality problems, especially related to military robots and use of force by police. Kripke semantics …

A Primer On Chaos And Fractals, Bruce Kessler

Mathematics Faculty Publications

This is a prelude to a performance of the play "Arcadia" exclusively for the science and math majors of Lipscomb University. One of the main characters of the story is a mathematical genius, and has realized the power and limitations of iterations in generating mathematical models and structures, although she is living in the early 1800's. This talk gives an introduction to the ideas of chaos theory, fractals, and randomness.

The Schroedinger Equation With Potential In Rough Motion, Marius Beceanu, Avy Soffer

Mathematics and Statistics Faculty Scholarship

This paper proves endpoint Strichartz estimates for the linear Schroedinger equation in R 3 , with a time-dependent potential that keeps a constant profile and is subject to a rough motion, which need not be differentiable and may be large in norm. The potential is also subjected to a time-dependent rescaling, with a non-differentiable dilation parameter. We use the Strichartz estimates to prove the non-dispersion of bound states, when the path is small in norm, as well as boundedness of energy. We also include a sample nonlinear application of the linear results.

Nonsolvable Polynomials With Field Discriminant 5A, David P. Roberts

Mathematics Publications

We present the first explicitly known polynomials in Z[x] with nonsolvable Galois group and field discriminant of the form ±p^A for p ≤ 7 a prime. Our main polynomial has degree 25, Galois group of the form PSL₂(5)⁵.10, and field discriminant 5⁶⁹. A closely related polynomial has degree 120, Galois group of the form SL₂(5)⁵.20, and field discriminant 5³¹¹. We completely describe 5-adic behavior, finding in particular that the root discriminant of both splitting fields is 125 · 5^-1/12500 ≈ 124.984 and the class number of …

On Zeros And Local Infima Of Brownian Motion, Michel Weber

Communications on Stochastic Analysis

No abstract provided.

Packing Dimension Results For Anisotropic Gaussian Random Fields, Anne Estrade, Dongsheng Wu, Yimin Xiao

Communications on Stochastic Analysis

No abstract provided.

Permanental Processes, Hana Kogan, Michael B Marcus, Jay Rosen

Communications on Stochastic Analysis

No abstract provided.

Efficient Estimation Of Spectral Functionals For Gaussian Stationary Models, Mamikon S Ginovyan

Communications on Stochastic Analysis

No abstract provided.

On Fractional Ornstein-Uhlenbeck Processes, Terhi Kaarakka, Paavo Salminen

Communications on Stochastic Analysis

No abstract provided.

Itô'S Formula For A Sub-Fractional Brownian Motion, Litan Yan, Guangjun Shen, Kun He

Communications on Stochastic Analysis

No abstract provided.

Self-Similarity Parameter Estimation And Reproduction Property For Non-Gaussian Hermite Processes, Alexandra Chronopoulou, Ciprian A Tudor, Frederi G Viens

Communications on Stochastic Analysis

No abstract provided.

The Long-Range Dependence Of Linear Log-Fractional Stable Motion, Joshua B Levy, Murad S Taqqu

Communications on Stochastic Analysis

No abstract provided.

Year-Round Calendars At The High School Level, Matthew Nohner

Mathematics Graduate Theses

The purpose of this paper is to explore the effects of a year round calendar on math scores at the high school level. Students forget facts, especially math facts, over long extended breaks. Year round calendars aim to address this dilemma by minimizing long breaks from learning. The results of year round calendars have been mixed. Some schools have reported both academic and monetary gains after switching from a traditional calendar, while other schools have seen modest gains in student learning. All studies cited in this paper report that at-risk and low socioeconomic students benefit academically from a year round …

A Review Of Some Methods To Estimate The Tail Of The Distribution Of The Maximum Of A Gaussian Field, Mario Wschebor

Communications on Stochastic Analysis

No abstract provided.

A Model Of Continuous Time Polymer On The Lattice, David Márquez-Carreras, Carles Rovira, Samy Tindel

Communications on Stochastic Analysis

No abstract provided.

On Local Times Of Anisotropic Gaussian Random Fields, Dongsheng Wu, Yimin Xiao

Communications on Stochastic Analysis

No abstract provided.

Undamped Harmonic Oscillator Driven By Additive Gaussian White Noise: A Statistical Analysis, N Lin, S V Lototsky

Communications on Stochastic Analysis

No abstract provided.

Preface

Communications on Stochastic Analysis

No abstract provided.

Complete Characterizations Of Local Weak Sharp Minima With Applications To Semi-Infinite Optimization And Complementarity, Boris S. Mordukhovich, Naihua Xiu, Jinchuan Zhou

Mathematics Research Reports

In this paper we identify a favorable class of nonsmooth functions for which local weak sharp minima can be completely characterized in terms of normal cones and subdifferentials, or tangent cones and subderivatives, or their mixture in finite-dimensional spaces. The results obtained not only significantly extend previous ones in the literature, but also allow us to provide new types of criteria for local weak sharpness. Applications of the developed theory are given to semi-infinite programming and to semi-infinite complementarity problems.

Signal And Noise In Complex-Valued Sense Mr Image Reconstruction, Daniel B. Rowe, Iain P. Bruce

Mathematics, Statistics and Computer Science Faculty Research and Publications

In fMRI, brain images are not measured instantaneously and a volume of images can take two seconds to acquire at a low 64x64 resolution. Significant effort has been put forth on many fronts to decrease image acquisition time including parallel imaging. In parallel imaging, sub-sampled spatial frequency points are measured in parallel and combined to form a single image. Measurement time is decreased at the expense of increased image reconstruction difficulty and time. One significant parallel imaging technique known as SENSE utilizes a complex-valued regression coefficient estimation process with transposes replaced by conjugate transposes. However, in SENSE the noise structure …

Semidistributive Inverse Semigroups, Ii, Kyeong Hee Cheong, Peter R. Jones

Mathematics, Statistics and Computer Science Faculty Research and Publications

The description by Johnston-Thom and the second author of the inverse semigroups S for which the lattice LJ(S) of full inverse subsemigroups of S is join semidistributive is used to describe those for which (a) the lattice L(S) of all inverse subsemigroups or (b) the lattice lo(S) of convex inverse subsemigroups have that property. In contrast with the methods used by the authors to investigate lower semimodularity, the methods are based on decompositions via G_S, the union of the subgroups of the semigroup (which is necessarily cryptic).

Characterizing The Arc, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

We offer a mathematical logic framework for talking about when a given topological space is characterizable relative to a “class of its peers.” The framework involves a relational alphabet for which there is a natural way of assigning relational structures to spaces in the peer class; and a putative characterization of the given space consists of a set of first-order sentences over that alphabet, all true for the space. The attempted characterization is a success if any peer space satisfying all the sentences is inevitably homeomorphic to the given space.

For example, it has long been known that the arc …

Global Well-Posedness And Asymptotic Behavior Of A Class Of Initial-Boundary-Value Problems Of The Kdv Equation On A Finite Domain, Ivonne Rivas, Muhammad Usman, Bingyu Zhang

Mathematics Faculty Publications

In this paper, we study a class of initial boundary value problem (IBVP) of the Korteweg- de Vries equation posed on a ?nite interval with nonhomogeneous boundary conditions. The IBVP is known to be locally well-posed, but its global L2 a priori estimate is not available and therefore it is not clear whether its solutions exist globally or blow up in finite time. It is shown in this paper that the solutions exist globally as long as their initial value and the associated boundary data are small, and moreover, those solutions decay exponentially if their boundary data decay exponentially.

Routes Of Learning: Highways, Pathways, And Byways In The History Of Mathematics (Book Review), Calvin Jongsma

Faculty Work Comprehensive List

Reviewed Title: Routes of Learning: Highways, Pathways, and Byways in the History of Mathematics by Ivor Grattan-Guinness. Baltimore, MD: The Johns Hopkins University Press, 2009. xii + 372 pages, with index. ISBN: 9780801892486.

Projective-Planar Graphs With No K3,4-Minor, John Maharry, Dan Slilaty

Mathematics and Statistics Faculty Publications

An exact structure is described to classify the projective‐planar graphs that do not contain a K3, 4‐minor.

Common Hypercyclic Vectors For The Conjugate Class Of A Hypercyclic Operator, Kit C. Chan, Rebecca Sanders

Mathematics, Statistics and Computer Science Faculty Research and Publications

Given a separable, infinite dimensional Hilbert space, it was recently shown by the authors that there is a path of chaotic operators, which is dense in the operator algebra with the strong operator topology, and along which every operator has the exact same dense G_δ set of hypercyclic vectors. In the present work, we show that the conjugate set of any hypercyclic operator on a separable, infinite dimensional Banach space always contains a path of operators which is dense with the strong operator topology, and yet the set of common hypercyclic vectors for the entire path is a dense …

The Geometric And Dynamic Essence Of Phyllotaxis, Pau Atela

Mathematics Sciences: Faculty Publications

We present a dynamic geometric model of phyllotaxis based on two postulates, primordia formation and meristem expansion. We find that Fibonacci, Lucas, bijugate and multijugate are all variations of the same unifying phenomenon and that the difference lies on small changes in the position of initial primordia. We explore the set of all initial positions and color-code its points depending on the phyllotactic type of the pattern that arises.

Sharp Asymptotics Of The Lp Approximation Error For Interpolation On Block Partitions, Yuliya Babenko, Tatyana Leskevich, Jean-Marie Mirebeau

Faculty Articles

Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing optimal approximating spline for each function proved to be very hard. In fact, no polynomial time algorithm of adaptive spline approximation can be designed and no exact formula for the optimal error of approximation can be given. Therefore, the next natural question would be to study the asymptotic behavior of the error and construct asymptotically optimal sequences of partitions. In this paper we provide sharp asymptotic …

Two Triangles With The Same Orthocenter And A Vectorial Proof Of Stevanovic's Theorem, Florentin Smarandache, Ion Patrascu

Branch Mathematics and Statistics Faculty and Staff Publications

In this article we'll emphasize on two triangles...