Analysis

Series
Time
for
Location
Speaker
Organizer
Koldobsky showed that for an arbitrary measure on R^n, the measure of the largest section of a symmetric convex body can be estimated from below by 1/sqrt{n}, in with the appropriate scaling. He conjectured that a much better result must hold, however it was recemtly shown by Koldobsky and Klartag that 1/sqrt{n} is best possible, up to a logarithmic error. In this talk we will discuss how to remove the said logarithmic error and obtain the sharp estimate from below for Koldobsky's slicing problem.
Series
Time
for
Location
Speaker
Organizer
I will discuss some free probability inequalities on the circle which can be seen in two different ways, one is via random matrix approximation, and another one by itself. I will show what I believe to be the key of these new forms, namely the fact that the circle acts on itself. For instance the Poincare inequality has a certain form which reflects this aspect. I will also briefly show how a transportation inequality can be discussed and how the standard Wasserstein distance can be modified to introduce this interesting phenomena.
Series
Time
for
Location
Speaker
Organizer
Spherical averages, in the continuous and discrete setting, are a canonical example of averages over lower dimensional varieties. We demonstrate here a new approach to proving the sparse bounds for these opertators. This approach is a modification of an old technique of Bourgain.
Series
Time
for
Location
Speaker
Organizer

I shall tell about some background and known results in regards to the celebrated and fascinating Log-Brunn-Minkowski inequality, setting the stage for Xingyu to discuss connections with elliptiic operators a week later.

Series
Time
for
Location
Speaker
Organizer

It has been known that when an equiangular tight frame (ETF) of size |Φ|=N exists, Φ ⊂ Fd (real or complex), for p > 2 the p-frame potential ∑i ≠ j | < φj, φk > |p achieves its minimum value on an ETF over all N sized collections of vectors. We are interested in minimizing a related quantity: 1/ N2 ∑i, j=1 | < φj, φk > |p . In particular we ask when there exists a configuration of vectors for which this quantity is minimized over all sized subsets of the real or complex sphere of a fixed dimension.

Series
Time
for
Location
Speaker
Organizer
Abstract: I will state a version of Voiculescu's noncommutative Weyl-von Neumann theorem for operators on l^p that I obtained. This allows certain classical results concerning unitary equivalence of operators on l^2 to be generalized to operators on l^p if we relax unitary equivalence to similarity. For example, the unilateral shift on l^p, 1

Series
Time
for
Location
Speaker
Organizer
We discuss the probability that a continuous stationary Gaussian process on whose spectral measure vanishes in a neighborhood of the origin stays non-negative on an interval of long interval. Joint work with Naomi Feldheim, Ohad Feldheim, Fedor Nazarov, and Shahaf Nitzan
Series
Time
for
Location
Speaker
Organizer
The first part, consists on a result in the area of commutators. The classic result by Coifman, Rochber and Weiss, stablishes a relation between a BMO function, and the commutator of such a function with the Hilbert transform. The result obtained for this thesis, is in the two parameters setting (with obvious generalizations to more than two parameters) in the case where the BMO function is matrix valued. The second part of the thesis corresponds to domination of operators by using a special class called sparse operators.
Series
Time
for
Location
Speaker
Organizer
We consider totally irregular measures $\mu$ in $\mathbb{R}^{n+1}$, that is, $$\limsup_{r\to0}\frac{\mu(B(x,r))}{(2r)^n} >0 \;\; \& \;\; \liminf_{r\to0}\frac{\mu(B(x,r))}{(2r)^n}=0$$for $\mu$ almost every $x$.
Series
Time
for
Location
Speaker
Organizer
We study Balian-Low type theorems for finite signals in $\mathbb{R}^d$, $d\geq 2$.Our results are generalizations of S. Nitzan and J.-F. Olsen's recent work and show that a quantity closelyrelated to the Balian-Low Theorem has the same asymptotic growth rate, $O(\log{N})$ for each dimension $d$. Joint work with Michael Northington.

Pages

Subscribe to RSS - Analysis