# Math Calendar

 Categories: Choose a category... View all categories _______________________ Biomath Seminar Colloquium Computational Analysis Seminar Departmental Student Awards Faculty Meeting Graph Theory and Combinatorics Seminar Informal von Neumann Algebras Seminar Noncommutative Geometry and Operator Algebras Seminar Partial Differential Equations Seminar Subfactor Seminar Symplectic and Differential Geometry Seminar Topology and Group Theory Seminar Undergraduate Seminar Universal Algebra and Logic Seminar Vandy Math Club RSS

###### » Seminar Pages

September 26, 2013 4:10 pm (Thursday)

## A Survey of Algebraic Geometry and Model Theory for Free and Hyperbolic Groups

Olga Kharlampovich, Hunter College, CUNY
Location: Stevenson 5211

I will survey results of Kharlampovich--Miasnikov and Sela on first-order theories of free and hyperbolic groups. I will show that in the presence of negative curvature'' in groups, there exists a robust algebraic geometry and the principal Tarski-type problems are decidable. In particular, there is an algorithm for the elimination of quantifiers (to boolean combinations of AE-formulas). I will also give a description of definable sets in free and hyperbolic groups (joint result with Miasnikov). This solves Malcev's problem from 1965. Tea at 3:30 pm in SC 1425.

September 25, 2013 3:10 pm (Wednesday)

## Progress on Hard Thresholding Pursuit

Jean-Luc Bouchot, Drexel University
Location: Stevenson 1307

The Hard Thresholding Pursuit algorithm for sparse recovery is revisited using a new theoretical analysis. The main result states that all sparse vectors can be exactly recovered from incomplete linear measurements in a number of iterations at most proportional to the sparsity level as soon as the measurement matrix obeys a restricted isometry condition. The recovery is also robust to measurement error The same conclusions are derived for a variation of Hard Thresholding Pursuit, called Graded Hard Thresholding Pursuit, which is a natural companion to Orthogonal Matching Pursuit and runs without a prior estimation of the sparsity level. In two extreme cases of the vector shape, it is also shown that, with high probability on the draw of random measurements, a fixed sparse vector is robustly recovered in a number of iterations precisely equal to the sparsity level. These theoretical findings are experimentally validated, too.

September 23, 2013 3:00 pm (Monday)

## Applications of Wenzl's Formula

Zhengwei Liu, Vanderbilt University
Location: Stevenson 1404

We will talk about Wenzl's formula and its general form. We will see its applications to other subfactor concepts, like Jellyfish, spoke subfactors, the embedding theorem, normalizers.

September 20, 2013 4:10 pm (Friday)

## $W^*$-Superrigidity for Arbitrary Actions of Central Quotients of Braid Groups

Ionut Chifan, University of Iowa
Location: Stevenson 1432

For any $n > 4$ let $\tilde B_n = B_n/Z(B_n)$ be the quotient of the braid group $B_n$ through its center. We prove that any free ergodic probability measure preserving (pmp) action $\tilde B_n \ca (X, \mu)$ is virtually $W^*$-superrigid: whenever $L^\infty (X,\mu)\rtimes \tilde B_n =L^\infty (Y,\nu)\rtimes \Lambda$, for an arbitrary free ergodic pmp action $\Lambda \ca (Y, \nu)$ it follows that the actions $\tilde B_n \ca X,\Lambda \ca Y$ are virtually conjugate. Moreover, we prove that the same holds if $\tilde B_n$ is replaced with any finite index subgroup of the direct product $\tilde B_{n_1} \times \cdots \times \tilde B_{n_k}$, for some $n_1, \ldots , n_k > 4$. The proof uses a dichotomy theorem of Popa-Vaes for normalizers inside crossed products by free groups in combination with a $OE$-superrigidity theorem of Kida for actions of mapping class groups. This is based on joint work with A. Ioana and Y. Kida.

September 20, 2013 3:10 pm (Friday)

## Optimal Regularity in the Thin Obstacle Problem with Lipschitz Variable Coefficients

Mariana Smit Vega Garcia, Purdue University
Location: Stevenson 1307

We will describe the lower-dimensional obstacle problem for a uniformly elliptic, divergence form operator $L = div(A(x)\nabla)$ with Lipschitz continuous coefficients and discuss the optimal regularity of the solution. Our main result states that, similarly to what happens when $L = \Delta$, the variational solution has the optimal interior regularity. We achieve this by proving some new monotonicity formulas for an appropriate generalization of Almgren's frequency functional. This is joint work with Nicola Garofalo.

September 18, 2013 4:10 pm (Wednesday)

## Relatively Hyperbolic Groups with the Falsification by Fellow Traveler Property

Yago Antolin Pichel, Vanderbilt University
Location: Stevenson 1310

The falsification by fellow traveler property is a property of the Cayley graph of a group. It was introduced by Neumann and Shapiro, it has several implications. For example, it implies the regularity of the language of geodesics, the rationality of the growth series or having a quadratic Dehn function. I will explain how to find a generating set with the falsification by fellow traveler property for groups relatively hyperbolic to groups with a generating set with this property. This is a joint work with Laura Ciobanu.

September 18, 2013 3:10 pm (Wednesday)

## Compressed Sensing with Equiangular Tight Frames

Matt Fickus, Air Force Institute of Technology
Location: Stevenson 1307

Compressed sensing (CS) is changing the way we think about measuring high-dimensional signals and images. In particular, CS promises to revolutionize hyperspectral imaging. Indeed, emerging camera prototypes are exploiting random masks in order to greatly reduce the exposure times needed to form hyperspectral images. Here, the randomness of the masks is due to the crucial role that random matrices play in CS. In short, in terms of CS's restricted isometry property (RIP), random matrices far outshine all known deterministic matrix constructions. To be clear, for most deterministic constructions, it is unknown whether this performance shortfall (known as the "square-root bottleneck") is simply a consequence of poor proof techniques or, more seriously, a flaw in the matrix design itself. In the remainder of this talk, we focus on this particular question in the special case of matrices formed from equiangular tight frames (ETFs). ETFs are overcomplete collections of unit vectors with minimal coherence, namely optimal packings of a given number of lines in a Euclidean space of a given dimension. We discuss the degree to which the recently-introduced Steiner and Kirkman ETFs satisfy the RIP. We further discuss how a popular family of ETFs, namely harmonic ETFs arising from McFarland difference sets, are particular examples of Kirkman ETFs. Overall, we find that many families of ETFs are shockingly bad when it comes to RIP, being provably incapable of exceeding the square-root bottleneck. Such ETFs are nevertheless useful in variety of other real-world applications, including waveform design for wireless communication and algebraic coding theory.

September 17, 2013 4:10 pm (Tuesday)

## The Definable Principal Subcongruences Problem is Undecidable

Matthew Moore, Vanderbilt University
Location: Stevenson 1310

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is undecidable. Using this, we present another proof that A. Tarski's finite basis problem is undecidable.

September 13, 2013 4:10 pm (Friday)

## Existence, Regularity and Convergence Results for the Compressible Euler Equations

Marcelo Disconzi, Vanderbilt University
Location: Stevenson 1307

We study the problem of inviscid slightly compressible fluids in a bounded domain. We find a unique solution to the initial-boundary value problem and show that it is close to the analogous solution for an incompressible fluid. Furthermore we find that solutions to the compressible motion problem in Lagrangian coordinates depend differentiably on their initial data, an unexpected result for non-linear equations. This is joint work with David G. Ebin.
September 12, 2013 4:10 pm (Thursday)

## Non-Asymptotic Approach in Random Matrix Theory

Mark Rudelson, University of Michigan
Location: Stevenson 5211

Random matrix theory studies the asymptotics of the spectral distributions of families of random matrices, as the sizes of the matrices tend to infinity. Derivation of such asymptotics frequently requires analyzing the spectral properties of random matrices of a large fixed size, especially of their singular values. We will discuss several recent results in this area concerning matrices with independent entries, as well as random unitary and orthogonal perturbations of a fixed matrix. We will also show an application of the non-asymptotic random matrix theory to estimating the permanent of a deterministic matrix. Tea at 3:30 pm in SC 1425.