Georgia Institute of Technology College of Sciences

The Gabor system of a function is the set of all of its integer translations and modulations. The Balian-Low Theorem states that the Gabor system of a function which is well localized in both time and frequency cannot form an Riesz basis for $L^2(\mathbb{R})$. An important tool in the proof is a characterization of the Riesz basis property in terms of the boundedness of the Zak transform of the function. In this talk, we will discuss results showing that weaker basis-type properties also correspond to boundedness

In this talk, I will discuss some polynomials that are best approximants (in some sense!) to reciprocals of functions in some analytic function spaces of the unit disk. I will examine the extremal problem of finding a zero of minimal modulus, and will show how that extremal problem is related to the spectrum of a certain Jacobi matrix and real orthogonal polynomials on the real line.

Magyar, Stein, and Wainger proved a discrete variant in Zd of the continuous spherical maximal theorem in Rd for all d ≥ 5. Their argument proceeded via the celebrated “circle method” of Hardy, Littlewood, and Ramanujan and relied on estimates for continuous spherical maximal averages via a general transference principle. In this talk, we introduce a range of sparse bounds for discrete spherical maximal averages and discuss some ideas needed to obtain satisfactory control on the major

A sparse bound is a novel method to bound a bilinear form. Such a bound gives effortless weighted inequalities, which are also easy to quantify. The range of forms which admit a sparse bound is broad. This short survey of the subject will include the case of spherical averages, which has a remarkably easy proof.

The classical Balian-Low theorem states that if both a function and it's Fourier transform decay too fast then the Gabor system generated by this function (i.e. the system obtained from this function by taking integer translations and integer modulations) cannot be an orthonormal basis or a Riesz basis.Though it provides for an excellent `thumbs--rule' in time-frequency analysis, the Balian--Low theorem is not adaptable to many applications. This is due to the fact that in realistic situations information about a signal is given by a

Abstract: Shift-invariant (SI) spaces play a prominent role in the study of wavelets, Gabor systems, and other group frames. Working in the setting of LCA groups, we use a variant of the Zak transform to classify SI spaces, and to simultaneously describe families of vectors whose shifts form frames for the SI spaces they generate.

In this thesis, we introduce multilinear dyadic paraproducts and Haar multipliers, and discuss boundedness properties of these operators and their commutators with locally integrable functions in various settings. We also present pointwise domination of these operators by multilinear sparse operators, which we use to prove multilinear Bloom’s inequality for the commutators of multilinear Haar multipliers. Along the way, we provide several characterizations of dyadic BMO functions.

In this seminar I will discuss current work, joint with AndrewVince and Alex Grant. The goal is to tie together several related areas, namelytiling theory, IFS theory, and NCG, in terms most familiar to fractal geometers.Our focus is on the underlying code space structure. Ideas and a conjecture willbe illustrated using the Golden b tilings of Robert Ammann

A well-known elementary linear algebra fact says that any linear independent set of vectors in a finite-dimensional vector space cannot have more elements than any spanning set. One way to obtain an analog of this result in the infinite dimensional setting is by replacing the comparison of cardinalities with a more suitable concept - which is the concept of densities. Basically one needs to compare the cardinalities locally everywhere and then take the appropriate limits. We provide a rigorous

Finding and understanding patterns in data sets is of significant importance in many applications. One example of a simple pattern is the distance between data points, which can be thought of as a 2-point configuration. Two classic questions, the Erdos distinct distance problem, which asks about the least number of distinct distances determined by N points in the plane, and its continuous analog, the Falconer distance problem, explore that simple pattern. Questions similar to the Erdos distinct distance problem and