Seminars and Colloquia by Series

Closed Geodesics on Surfaces without Conjugate Points

Series
CDSNS Colloquium
Time
Friday, February 12, 2021 - 13:00 for 1 hour (actually 50 minutes)
Location
Zoom (see add'l notes for link)
Speaker
Khadim WarIMPA

Please Note: Zoom link: https://zoom.us/j/96065531265?pwd=aW5qZW8vUUt3bGRlN29FS0FFVnc1QT09

We obtain Margulis-type asymptotic estimates for the number of free homotopy classes of closed geodesics on certain manifolds without conjugate points. Our results cover all compact surfaces of genus at least 2 without conjugate points. This is based on a join work with Vaughn Climenhaga and Gerhard Knieper.

Comparison between SOS and PSD via an algebraic quantity

Series
Student Algebraic Geometry Seminar
Time
Friday, February 12, 2021 - 09:00 for 1 hour (actually 50 minutes)
Location
Online
Speaker
Jaewoo JungGeorgia Tech

Please Note: URL: https://teams.microsoft.com/l/meetup-join/19%3a3a9d7f9d1fca4f5b991b4029b09c69a1%40thread.tacv2/1612989014268?context=%7b%22Tid%22%3a%22482198bb-ae7b-4b25-8b7a-6d7f32faa083%22%2c%22Oid%22%3a%2206706002-23ff-4989-8721-b078835bae91%22%7d

Even though it is not easy to determine global non-negativity of a polynomial, if the polynomial can be written as a sum of squares(SOS), we certainly see that it must be non-negative(PSD). Representability of polynomials in terms of sums of squares is a good certification for global non-negativity in the sense that any non-negative polynomials is just a sum of squares in some cases. However, there are some non-negative polynomials which cannot be written as sum of squares in general. So, one can ask about when the set of sums of squares is same as the set of non-negative polynomials or describing gap between set of sums of squares and non-negative polynomials if they are different.

In this talk, we will introduce an algebraic invariant (of variety) which can tell us when the two sets are same (or not). Moreover, we will discuss about cases that we can exactly describe structural gaps between the two sets.

 

URL: Microsoft Teams

Applications of Ergodic Theory to Combinatorics and Number Theory

Series
School of Mathematics Colloquium
Time
Thursday, February 11, 2021 - 11:00 for 1 hour (actually 50 minutes)
Location
Online via Zoom
Speaker
Florian RichterNorthwestern University

Please Note: Zoom link: https://us02web.zoom.us/j/87011170680?pwd=ektPOWtkN1U0TW5ETFcrVDNTL1V1QT09

This talk will focus on the multifaceted and mutually perpetuating relationship between ergodic theory, combinatorics and number theory. We will begin by discussing Furstenberg’s ergodic approach to Szemerédi’s Theorem and how it has inspired a recent solution to a long-standing sumset conjecture of Erdős. Thereafter, we will explore a new dynamical framework for treating questions in multiplicative number theory. This leads to a variant of the ergodic theorem that contains the Prime Number Theorem as a special case, and reveals an intriguing new connection between the notion of entropy in dynamical systems and the distribution of the number of prime factors of integers.

Defining canonically best factorization theorems for the generating functions of special convolution type sums

Series
Algebra Seminar
Time
Wednesday, February 10, 2021 - 15:30 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Maxie Schmidt

We are motivated by invertible matrix based constructions for expressing the coefficients of ordinary generating functions of special convolution type sums. The sum types we consider typically arise in classical number theoretic applications such as in expressing the Dirichlet convolutions $f \ast 1$ for any arithmetic function $f$. The starting point for this perspective is to consider the so-termed Lambert series generating function (LGF) factorization theorems that have been published over the past few years in work by Merca, Mousavi and Schmidt (collectively). In the LGF case, we are able to connect functions and constructions like divisor sums from multiplicative number theory to standard functions in the more additive theory of partitions. A natural question is to ask how we can replicate this type of unique "best possible", or most expressive expansion relating the generating functions of more general classes of convolution sums? In the talk, we start by summarizing the published results and work on this topic, and then move on to exploring how to define the notion of a "canonically best" factorization theorem to characterize this type of sum in more generality.

BlueJeans link: https://bluejeans.com/936847924

The two-weight inequality for Calderon-Zygmund operators with applications and results on two weight commutators of maximal functions on spaces of homogeneous type.

Series
Analysis Seminar
Time
Wednesday, February 10, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
https://us02web.zoom.us/j/71579248210?pwd=d2VPck1CbjltZStURWRWUUgwTFVLZz09
Speaker
Manasa VempatiWashington University in St Louis

For (X,d,w) be a space of homogeneous type in the sense of Coifman and Weiss, suppose that u and v are two locally finite positive Borel measures on (X,d,w).  Subject to the pair of weights satisfying a side condition, we characterize the boundedness of a Calderon--Zygmund operator T from L^{2}(u) to L^{2}(v) in terms of the A_{2} condition and two testing conditions. The proof uses stopping cubes and corona decompositions originating in work of Nazarov, Treil and Volberg, along with the pivotal side condition.

We also give the two weight quantitative estimates for the commutator of maximal functions and the maximal commutators with respect to the symbol in weighted BMO space on spaces of homogeneous type. These commutators turn out to be controlled by the sparse operators in the setting of space of homogeneous type. The lower bound of the maximal commutator is also obtained.

Zoom link:

https://us02web.zoom.us/j/71579248210?pwd=d2VPck1CbjltZStURWRWUUgwTFVLZz09

Progress towards Nash-Williams' conjecture on triangle decompositions

Series
Graph Theory Seminar
Time
Tuesday, February 9, 2021 - 12:30 for 1 hour (actually 50 minutes)
Location
https://us04web.zoom.us/j/77238664391. For password, please email Anton Bernshteyn (bahtoh ~at~ gatech.edu)
Speaker
Michelle DelcourtRyerson University

Please Note: Note the unusual time!

Partitioning the edges of a graph into edge disjoint triangles forms a triangle decomposition of the graph. A famous conjecture by Nash-Williams from 1970 asserts that any sufficiently large, triangle divisible graph on $n$ vertices with minimum degree at least $0.75 n$ admits a triangle decomposition. In the light of recent results, the fractional version of this problem is of central importance. A fractional triangle decomposition is an assignment of non-negative weights to each triangle in a graph such that the sum of the weights along each edge is precisely one.

We show that for any graph on n vertices with minimum degree at least $0.827327 n$ admits a fractional triangle decomposition. Combined with results of Barber, Kühn, Lo, and Osthus, this implies that for every sufficiently large triangle divisible graph on $n$ vertices with minimum degree at least $0.82733 n$ admits a triangle decomposition. This is a significant improvement over the previous asymptotic result of Dross showing the existence of fractional triangle decompositions of sufficiently large graphs with minimum degree more than $0.9 n$. This is joint work with Luke Postle.

Braids, quasimorphisms, and slice-Bennequin inequalities.

Series
Geometry Topology Seminar
Time
Monday, February 8, 2021 - 14:00 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Peter FellerETH Zurich

The writhe of a braid (=#pos crossing - #neg crossings) and the fractional Dehn twist coefficient of a braid (a rational number that measures "how much the braid twists") are the two most prominent examples of what is known as a quasimorphism (a map that fails to be a group homomorphism by at most a bounded amount) from Artin's braid group on n-strands to the reals.
We consider characterizing properties for such quasimorphisms and talk about relations to the study of knot concordance. For the latter, we consider inequalities for quasimorphism modelled after the so-called slice-Bennequin inequality:
writhe(B) ≤ 2g_4(K) - 1 + n for all n-stranded braids B with closure a knot K.
Based on work in progress.

Quantitative modeling of protein RNA interactions

Series
Mathematical Biology Seminar
Time
Friday, February 5, 2021 - 15:00 for 1 hour (actually 50 minutes)
Location
ONLINE
Speaker
Ralf BundschuhThe Ohio State University

The prediction of RNA secondary structures from sequence is a well developed task in computational RNA Biology. However, in a cellular environment RNA molecules are not isolated but rather interact with a multitude of proteins. RNA secondary structure affects those interactions with proteins and vice versa proteins binding the RNA affect its secondary structure.  We have extended the dynamic programming approaches traditionally used to quantify the ensemble of RNA secondary structures in solution to incorporate protein-RNA interactions and thus quantify these effects of protein-RNA interactions and RNA secondary structure on each other. Using this approach we demonstrate that taking into account RNA secondary structure improves predictions of protein affinities from RNA sequence, that RNA secondary structures mediate cooperativity between different proteins binding the same RNA molecule, and that sequence variations (such as Single Nucleotide Polymorphisms) can affect protein affinity at a distance mediated by RNA secondary structures.

https://gatech.bluejeans.com/348270750

Forward attractors and limit sets of nonautonomous difference equations

Series
CDSNS Colloquium
Time
Friday, February 5, 2021 - 13:00 for 1 hour (actually 50 minutes)
Location
Zoom (see add'l notes for link)
Speaker
Peter Kloeden Universität Tübingen

Please Note: Zoom link: https://zoom.us/j/97732215148?pwd=Z0FBNXNFSy9mRUx3UVk4alE4MlRHdz09

The  theory of nonautonomous dynamical systems has undergone  major development during the past 23 years since I talked  about attractors  of nonautonomous difference equations at ICDEA Poznan in 1998. 

Two types of  attractors  consisting of invariant families of  sets   have been defined for  nonautonomous difference equations, one using  pullback convergence with information about the system   in the past and the other using forward convergence with information about the system in the future. In both cases, the component sets are constructed using a pullback argument within a positively invariant  family of sets. The forward attractor so constructed also uses information about the past, which is very restrictive and  not essential for determining future behaviour.  

The forward  asymptotic  behaviour can also be described through the  omega-limit set  of the  system.This set  is closely  related to what Vishik  called the uniform attractor although it need not be invariant. It  is  shown to be asymptotically positively invariant  and also, provided  a future uniformity condition holds, also asymptotically positively invariant.  Hence this omega-limit set provides useful information about  the behaviour in current  time during the approach to the future limit. 

Pages