- You are here:
- GT Home
- Home
- News & Events

Series: Analysis Seminar

When equiangular tight frames (ETF's), a type of structured optimal packing of lines, exist and are of size $|\Phi|=N$, $\Phi\subset\mathbb{F}^d$ (where $\mathbb{F}=\mathbb{R}$, $\mathbb{C}$, or $\mathbb{H}$), for $p > 2$ the so-called $p$-frame energy $E_p(\Phi)=\sum\limits_{i\neq j} |\langle \varphi_{i}, \varphi_{j} \rangle|^p$ achieves its minimum value on an ETF over all sized $N$ collections of unit vectors. These energies have potential functions which are not positive definite when $p$ is not even. For these cases the apparent complexity of the problem of describing minimizers of these energies presents itself. While there are several open questions about the structure of these sets for fixed $N$ and fixed $p$, we focus on another question:

What structural properties are expressed by minimizing probability measures for the quantity $I_{p}(\mu)=\int\limits_{\mathbb{S}_{\mathbb{F}}^{d-1}}\int\limits_{\mathbb{S}_{\mathbb{F}}^{d-1}} |\langle x, y \rangle|^p d\mu(x) d\mu(y)$?

We collect a number of surprising observations. Whenever a tight spherical or projective $t$-design exists for the sphere $\mathbb{S}_{\mathbb{F}}^d$, equally distributing mass over it gives a minimizer of the quantity $I_{p}$ for a range of $p$ between consecutive even integers associated with the strength $t$. We show existence of discrete minimizers for several related potential functions, along with conditions which guarantee emptiness of the interior of the support of minimizers for these energies.

This talk is based on joint work with D. Bilyk, A. Glazyrin, R. Matzke, and O. Vlasiuk.

Series: Analysis Seminar

In this talk we will discuss some some extremal problems for polynomials. Applications to the problems in discrete dynamical systems as well as in the geometric complex analysis will be suggested.

Series: Analysis Seminar

Many problems of spherical discrete and metric geometry may be reformulated as energy minimization problems and require techniques that stem from harmonic analysis, potential theory, optimization etc. We shall discuss several such problems as well of applications of these ideas to combinatorial geometry, discrepancy theory, signal processing etc.

Series: Analysis Seminar

The Bishop-Phelps-Bolloba ́s property for numerical radius says that if we have a point in the Banach space and an operator that almost attains its numerical radius at this point, then there exist another point close to the original point and another operator close to the original operator, such that the new operator attains its numerical radius at this new point. We will show that the set of bounded linear operators from a Banach space X to X has a Bishop-Phelps-Bolloba ́s property for numerical radius whenever X is l1 or c0. We will also discuss some constructive versions of the Bishop-Phelps- Bolloba ́s theorem for l1(C), which are an essential tool for the proof of this result.

Series: Analysis Seminar

If $f$ is a function supported on a truncated paraboloid, what can we say about $Ef$, the Fourier transform of f? Stein conjectured in the 1960s that for any $p>3$, $\|Ef\|_{L^p(R^3)} \lesssim \|f\|_{L^{\infty}}$.

We make a small progress toward this conjecture and show that it holds for $p> 3+3/13\approx 3.23$. In the proof, we combine polynomial partitioning techniques introduced by Guth and the two ends argument introduced by Wolff and Tao.

Series: Analysis Seminar

Linear Schur multipliers, which act on matrices by entrywisemultiplications, as well as their generalizations have been studiedfor over a century and successfully applied in perturbation theory. Inthis talk, we will discuss extensions of Schur multipliers tomultilinear infinite dimensional transformations and then look intoapplications of the latter to approximation of operator functions.

Series: Analysis Seminar

It is well known that a Euclidean set of fixed Euclidean volume with least Euclidean surface area is a ball. For applications to theoretical computer science and social choice, an analogue of this statement for the Gaussian density is most relevant. In such a setting, a Euclidean set with fixed Gaussian volume and least Gaussian surface area is a half space, i.e. the set of points lying on one side of a hyperplane. This statement is called the Gaussian Isoperimetric Inequality. In the Gaussian Isoperimetric Inequality, if we restrict to sets that are symmetric (A= -A), then the half space is eliminated from consideration. It was conjectured by Barthe in 2001 that round cylinders (or their complements) have smallest Gaussian surface area among symmetric sets of fixed Gaussian volume. We discuss our result that says this conjecture is true if an integral of the curvature of the boundary of the set is not close to 1. https://arxiv.org/abs/1705.06643 http://arxiv.org/abs/1901.03934

Series: Analysis Seminar

In this talk I present some variational problems of Aharanov-Bohm type, i.e., they include a magnetic flux that is entirely concentrated at a point. This is maybe the simplest example of a variational problems for systems, the wave function being necessarily complex. The functional is rotationally invariant and the issue to be discussed is whether the optimizer have this symmetry or whether it is broken.

Series: Analysis Seminar

We prove sparse bounds for the spherical maximal operator of Magyar,Stein and Wainger. The bounds are conjecturally sharp, and contain an endpoint esti-mate. The new method of proof is inspired by ones by Bourgain and Ionescu, is veryefficient, and has not been used in the proof of sparse bounds before. The Hardy-Littlewood Circle method is used to decompose the multiplier into major and minor arccomponents. The efficiency arises as one only needs a single estimate on each elementof the decomposition.

Series: Analysis Seminar

We are going to discuss some recent results pertaining to the Falconer distance conjecture, including the joint paper with Guth, Ou and Wang establishing the $\frac{5}{4}$ threshold in the plane. We are also going to discuss the extent to which the sharpness of our method and similar results is tied to the distribution of lattice points on convex curves and surfaces.