Seminars and Colloquia by Series

Definable combinatorics in hyperfinite graphs

Series
Combinatorics Seminar
Time
Friday, March 18, 2022 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Matthew BowenMcGill University

We discuss a few new results concerning the descriptive combinatorics of bounded degree hyperfinite Borel graphs. In particular, we show that the Baire measurable edge chromatic number of $G$ is at most $\lceil\frac{3}{2}\Delta(G)\rceil+6$ when G is a multigraph, and for bipartite graphs we improve this bound to $\Delta(G)+1$ and show that degree regular one-ended bipartite graphs have Borel perfect matchings generically. Similar results hold in the measure setting assuming some hyperfiniteness conditions. This talk is based on joint work with Kun and Sabok, Weilacher, and upcoming work with Poulin and Zomback.

On mix-norms and the rate of decay of correlations

Series
CDSNS Colloquium
Time
Friday, March 18, 2022 - 13:00 for 1 hour (actually 50 minutes)
Location
Online via Zoom
Speaker
Bryan OakleyUniversity of Wisconsin-Madison

Please Note: Zoom link: https://us06web.zoom.us/j/83392531099?pwd=UHh2MDFMcGErbzFtMHBZTmNZQXM0dz09

Two quantitative notions of mixing are the decay of correlations and the decay of a mix-norm --- a negative Sobolev norm --- and the intensity of mixing can be measured by the rates of decay of these quantities. From duality, correlations are uniformly dominated by a mix-norm; but can they decay asymptotically faster than the mix-norm? We answer this question by constructing an observable with correlation that comes arbitrarily close to achieving the decay rate of the mix-norm. Therefore the mix-norm is the sharpest rate of decay of correlations in both the uniform sense and the asymptotic sense. Moreover, there exists an observable with correlation that decays at the same rate as the mix-norm if and only if the rate of decay of the mix-norm is achieved by its projection onto low-frequency Fourier modes. In this case, the function being mixed is called q-recurrent; otherwise it is q-transient. We use this classification to study several examples and raise questions for future investigations. 

Hilbert's Tenth Problem and Generalizations

Series
Algebra Student Seminar
Time
Friday, March 18, 2022 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 006 and Teams
Speaker
Ian LewisGeorgia Tech
Hilbert's Tenth Problem asks whether there exists an algorithm to determine whether an arbitrary polynomial with integer coefficients has a solution or not. This problem was resolved by Matiyasevich building of the work in of Robinson, Davis, and Putnam in the 70s. We will give an overview of how this problem was resolved and the current status of various generalizations.
 

Around Bismut-type formulas for symmetric alpha-stable probability measures

Series
Stochastics Seminar
Time
Thursday, March 17, 2022 - 15:30 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Benjamin ArrasUniversité de Lille
In this talk, I will speak about recent results regarding Bismut-type formulas for non-degenerate symmetric alpha-stable probability measures. In particular, I will present its applications to continuity properties of certain singular operators as well as to certain functional inequalities. These recent results are based on joint works with Christian Houdré.

Symmetric generating functions and permanents of totally nonnegative matrices

Series
Algebra Seminar
Time
Thursday, March 17, 2022 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Mark SkanderaLehigh University

For each element $z$ of the symmetric group algebra we define a symmetric generating function

$Y(z) = \sum_\lambda \epsilon^\lambda(z) m_\lambda$, where $\epsilon^\lambda$ is the induced sign

character indexed by $\lambda$. Expanding $Y(z)$ in other symmetric function bases, we obtain

other trace evaluations as coefficients. We show that we show that all symmetric functions in

$\span_Z \{m_\lambda \}$ are $Y(z)$ for some $z$ in $Q[S_n]$. Using this fact and chromatic symmetric functions, we give new interpretations of permanents of totally nonnegative matrices.

For the full paper, see https://arxiv.org/abs/2010.00458v2.

Calibrations and energy-minimizing maps of rank-1 symmetric spaces

Series
Analysis Seminar
Time
Wednesday, March 16, 2022 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Joeseph HoisungtonUniversity of Georgia

We will prove lower bounds for energy functionals of mappings of the real, complex and quaternionic projective spaces with their canonical Riemannian metrics.  For real and complex projective spaces, these results are sharp, and we will characterize the family of energy-minimizing mappings which occur in these results.  For complex projective spaces, these results extend to all Kahler metrics.  We will discuss the connections between these results and several theorems and questions in systolic geometry.

Mathematical and Statistical Challenges on Large Discrete Structures

Series
Job Candidate Talk
Time
Wednesday, March 16, 2022 - 11:00 for 1 hour (actually 50 minutes)
Location
https://bluejeans.com/348214744/2450
Speaker
Miklos RaczPrinceton University

From networks to genomics, large amounts of data are abundant and play critical roles in helping us understand complex systems. In many such settings, these data take the form of large discrete structures with important combinatorial properties. The interplay between structure and randomness in these systems presents unique mathematical and statistical challenges. In this talk I will highlight these through two vignettes: (1) inference problems on networks, and (2) DNA data storage.

First, I will discuss statistical inference problems on edge-correlated stochastic block models. We determine the information-theoretic threshold for exact recovery of the latent vertex correspondence between two correlated block models, a task known as graph matching. As an application, we show how one can exactly recover the latent communities using multiple correlated graphs in parameter regimes where it is information-theoretically impossible to do so using just a single graph. Furthermore, we obtain the precise threshold for exact community recovery using multiple correlated graphs, which captures the interplay between the community recovery and graph matching tasks. 

Next, I will give an overview of DNA data storage. Storing data in synthetic DNA is an exciting emerging technology which has the potential to revolutionize data storage. Realizing this goal requires innovation across a multidisciplinary pipeline. I will explain this pipeline, focusing on our work on statistical error correction algorithms and optimizing DNA synthesis, highlighting the intimate interplay between statistical foundations and practice.

Modeling and topological data analysis of zebrafish-skin patterns

Series
Mathematical Biology Seminar
Time
Wednesday, March 16, 2022 - 10:00 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Alexandria VolkeningPurdue University

Please Note: Meeting Link: https://bluejeans.com/426529046/8775

Wild-type zebrafish are named for their dark and light stripes, but mutant zebrafish feature variable skin patterns, including spots and labyrinth curves. All of these patterns form as the fish grow due to the interactions of tens of thousands of pigment cells in the skin. This leads to the question: how do cell interactions change to create mutant patterns? The longterm biological motivation for my work is to shed light on this question — I strive to help link genes, cell behavior, and visible animal characteristics. Toward this goal, I build agent-based models to describe cell behavior in growing fish body and fin-shaped domains. However, my models are stochastic and have many parameters, and comparing simulated patterns, alternative models, and fish images is often a qualitative process. This, in turn, drives my mathematical goal: I am interested in developing methods for quantifying variable cell-based patterns and linking computational and analytically tractable models. In this talk, I will overview our agent-based models for body and fin pattern formation, share how topological data analysis can be used to quantify cell-based patterns and models, and discuss ongoing work on relating agent-based and continuum models for zebrafish patterns.

A transversal of polytope facets

Series
Graph Theory Seminar
Time
Tuesday, March 15, 2022 - 15:45 for 1 hour (actually 50 minutes)
Location
Skiles 005
Speaker
Joseph BriggsAuburn University

Suppose you have a subset $S$ of the vertices of a polytope which contains at least one vertex from every face. How large must $S$ be? We believe, in the worst case, about half of the number of vertices of the polytope. But we don’t really know why. We have found some situational evidence, but also some situational counter-evidence. This is based on joint work with Michael Dobbins and Seunghun Lee.

Computing the nearest structured rank deficient matrix

Series
Algebra Seminar
Time
Tuesday, March 15, 2022 - 12:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Diego CifuentesGeorgia Tech

Given an affine space of matrices L and a matrix Θ ∈ L, consider the problem of computing the closest rank deficient matrix to Θ on L with respect to the Frobenius norm. This is a nonconvex problem with several applications in control theory, computer algebra, and computer vision. We introduce a novel semidefinite programming (SDP) relaxation, and prove that it always gives the global minimizer of the nonconvex problem in the low noise regime, i.e., when Θ is close to be rank deficient. Our SDP is the first convex relaxation for this problem with provable guarantees. We evaluate the performance of our SDP relaxation in examples from system identification, approximate GCD, triangulation, and camera resectioning. Our relaxation reliably obtains the global minimizer under non-adversarial noise, and its noise tolerance is significantly better than state of the art methods.

Pages