Events This Week

 

Week of February   21 - February   17

_________________________________________________

 

Friday,  February 21

Algebra and Combinatorics

Topic: Ear decompositions of graphs: an unexpected tool in Combinatorial Commutative Algebra

Ngo Viet Trung - Institute of Mathematics, Vietnam Academy of Science and Technology Host: (Tai Ha)

Abstract: Ear decomposition is a classical notion in Graph Theory. It has been shown in [1, 2] that this notion can be used to solve difficult problems on homological properties of edge ideals in Combinatorial Commutative Algebra. This talk presents the main combinatorial ideas behind these results.
[1] H.M. Lam and N.V. Trung, Associated primes of powers of edge ideals and ear decompositions of graphs, Trans. AMS 372 (2019)
[2] H.M. Lam, N.V. Trung, and T.N. Trung, A general formula for the index of depth stability of edge ideals, Trans. AMS, to appear.

Location: Gibson Hall 310

Time: 3:00 pm

______________________

 

Week of February   14 - February   10

_________________________________________________

Clifford Lectures: February 11 - 14

_________________________________________________

 

Tuesday, February    11

Graduate Student Colloquium

Topic: Partial Betti splittings for binomial edge ideals

Aniketh Sivakumar - Tulane University

Abstract: The Free resolution of a module is an object which contains important information about the structure of the module. These resolutions are used to define several invariants associated to a module, including their Betti numbers. In this talk, we will introduce the notion of a partial Betti splitting of a homogeneous ideal, generalizing the notion of a Betti splitting first given by Francisco, Hà, and Van Tuyl. We will also define an ideal associated to a graph known as its binomial edge ideal and describe an explicit partial Betti splitting for this class of ideals.

Location:  BO 242   
Time: 3:30pm 

 

________________

 

 

Monday,  February 10

Algebra and Combinatorics

Topic: Versions of the circle method

Edna Jones - Tulane University

Abstract: The circle method is a useful tool in analytic number theory and combinatorics. The term "circle method" can refer to one of a variety of techniques for using the analytic properties of the generating function of a sequence to obtain an asymptotic formula for the sequence. We will discuss different versions of the circle method and some results that can be obtained by using the circle method.
 

Location: Gibson Hall, room 310

Time: 3:00 pm

 

________________

 

Monday,  February 10

Integrability and Beyond !!!

Topic: Random Matrices: Fredholm determinant representations for (a) spectral gaps, (b) largest eigenvalues, and (c) number statistics.

Ken McLaughlin - Tulane University

Abstract: We will continue exploring the connection between random matrices and Hermite polynomials, and start the proof of the relation between eigenvalue probabilities and Fredholm determinants. Time permitting, we will return to the numerical experiments, to carefully develop intuition.
 

Location:  Gibson Hall 310   
Time: 3:30pm 

 

______________________

Monday,  February 10

Algebra and Combinatorics

Topic: From Interpolation problems to matroids

Paolo Mantero - University of Arkansas - Host: (Alessandra Costantini)

Abstract: Interpolation problems are long-standing problems at the intersection of Algebraic Geometry, Commutative Algebra, Linear Algebra and Numerical Analysis, aiming at understanding the set of all polynomial equations passing through a given finite set X of points with given multiplicities.

In this talk we discuss the problem for matroidal configurations, i.e. sets of points arising from the strong combinatorial structure of a matroid. Starting from the special case of uniform matroids, we will discover how an interplay of commutative algebra and combinatorics allows us to solve the interpolation problem for any matroidal configuration. It is the widest class of points for which the interpolation problem is solved. Along the way, we will touch on several open problems and conjectures.

The talk is based on joint projects with Vinh Nguyen (U. Arkansas).
 

Location: Dinwiddie Hall, room 103 (note unusual location and day)

Time: 3:00 pm

______________________

 

 

 

 

Week of February   7 - February   3

 

________________

 

Friday, February  7

Applied and Computational Math

Topic: Admissible behavior of Krylov subspace iterative methods for non-symmetric systems

Kirk Soodhalter - Trinity College Dublin (Lisa Fauci)

Abstract: In this talk, we introduce the audience Krylov subspace iterative methods, the work-horse matrix-free methods for solving linear systems and eigenvalue problems in the case that matrix is large and sparse or otherwise not available to be solved by accessing all entries of the matrix. These methods are built on the core assumption that we only have access to a procedure that multiplies the matrix times vectors at relatively low computational cost. After discussing some basic convergence theory related to polynomial interpolation, we demonstrate the complicated nature of estimating rate of convergence for such methods based on quantities such as eigenvalues when the matrix is non-normal. In particular, we discuss and contextualize a constructively proven theorem that in pathological cases, the eigenvalues need not be at all descriptive with regard to convergence behavior [Greenbaum, Pták, Strakoš 1996]. We build the language needed to describe the mechanics of how to construct such cases. We then discuss our currently running project on developing more robust theory of convergence for these methods applied to non-symmetric Toeplitz systems, the type of which arise in a variety of problems from the computational sciences. Toeplitz matrices are constant along each diagonal; thus the linear system is governed by a matrix with fewer degrees of freedom than in general. We demonstrate that tools developed in the aformentioned constructive proof can be repurposed to develop refine previous convergence theory for Toeplitz systems. This is ongoing work; thus we finish by discussing what remains to be proven and how we intend to extend this theory to generalizations of Toeplitz matrices encompassing a larger class of matrix structures often arising in the computational sciences.
 

Location:  Gibson Hall 325
Time: 3:00pm 

 

__________________

 

 

__________________

 

Tuesday, February    4

Graduate Student Colloquium

Topic: Symbolic powers via extension

Haoxi Hu - Tulane University Host: (Moslem Uddin)

Abstract: Symbolic Powers of ideals are well-studied objects, in this talk, We investigates under which conditions the symbolic powers of the extension of an ideal is the same as the extension of the symbolic powers. Our result generalizes the known scenarios. As an application, we prove formulas for the resurgence of sum of two homogeneous ideals in finitely generated k-algebra domains, where k is algebraically closed. Initially, these were known for ideals in polynomial rings.

 

Location:  Norman Mayer Building - MA-101 (G)   
Time: 3:30pm 

 

________________

 

Monday, February  3

Integrability and Beyond !!!

Topic: Random Matrices: Fredholm determinant representations for (a) spectral gaps, (b) largest eigenvalues, and (c) number statistics.

Ken McLaughlin - Tulane University

Abstract: We will start calculating some basic number statistics for finite sized random matrices using Hermite polynomials, and compare to numerical experiments. In the second half, I will explain the connection between random matrices and Hermite polynomials.

 

Location:  Gibson Hall 310   
Time: 3:30pm 

 

_______________________

 

 

 

Week of January 31 - January 27

 

______________________

Friday,  January  31

Colloquium

Topic: Partitions Detect Primes

Ken Ono - University of Virginia Host: ( )

Abstract: This talk presents “partition theoretic” analogs of the classical work of Matiyasevich that resolved Hilbert’s Tenth Problem in the negative. The Diophantine equations we consider involve equations of MacMahon’s partition functions and their natural generalizations. Here we explicitly construct infinitely many Diophantine equations in partition functions whose solutions are precisely the prime numbers. To this end, we produce explicit additive bases of all graded weights of quasimodular forms, which is of independent interest with many further applications. This is joint work with Will Craig and Jan-Willem van Ittersum.
 

Location: Gibson Hall 126  Subject to change

Time: 4:00 pm

________________

 

Friday, January  31

Applied and Computational Math

Topic: Towards efficient deep operator learning for forward and inverse PDEs: theory and algorithms

Ke Chen - University of Delaware Host: (Hongfei Chen)

Abstract: Deep neural networks (DNNs) have been a successful model across diverse machine learning tasks, increasingly capturing the interest for their potential in scientific computing. This talk delves into efficient training for PDE operator learning in both the forward and inverse PDE settings. Firstly, we address the curse of dimensionality in PDE operator learning, demonstrating that certain PDE structures require fewer training samples through an analysis of learning error estimates. Secondly, we introduce an innovative DNN, the pseudo-differential auto-encoder integral network (pd-IAE net), and compare its numerical performance with baseline models on several inverse problems, including optical tomography and inverse scattering.

 

Location:  Gibson Hall 325 (Room Change)  
Time: 3:00pm 

 

__________________

 

Tuesday, January  28

Graduate Student Colloquium

Topic: Unearthing Latent Time Series in Repeated Survey Data

John V Argentino - Tulane University Host: (Moslem Uddin)

Abstract: In today’s world of readily available data, repeated survey data is commonplace in a variety of settings. These data are collected to model the impacts of particular variables of interest, which are often estimated using methods that assume temporal independence in the observed noise. This premise is shaky given how easily conceivable it is that variables not accounted for have some degree of continuity over time. This talk will present a method that seeks to reconcile mixed effect models and time series analysis while employing classic results from linear algebra to identify it’s potential pitfalls.

 

Location:  DW 102   
Time: 3:30pm 

 

________________

 

Monday, January  27

Integrability and Beyond !!!

Topic: Random Matrices: Fredholm determinant representations for (a) spectral gaps, (b) largest eigenvalues, and (c) number statistics.

Ken McLaughlin - Tulane University

Abstract: How to compute interesting statistical quantities in random matrices: Fredholm determinant representations for (a) spectral gaps, (b) largest eigenvalues, and (c) number statistics.

With the assistance of the whole group, this should be very introductory.

Speakers: to be determined, starting with Ken McLaughlin on January 27.

 

Location:  Gibson Hall 310   
Time: 3:30pm 

 

_______________________

 

 

 

Week of January 24 - January 20

Friday, January  24

Applied and Computational Math

Topic: Manuela Girotti - Emory University Host: (Aikaterini Gkogkou)

 Di Fang - Duke University

Abstract: N. Zabusky coined the word "soliton" in 1965 to describe a curious feature he and M. Kruskal observed in their numerical simulations of the initial-value problem for a simple nonlinear PDE. The first part of the talk will be a broad introduction to the theory of solitons/solitary waves and integrable PDEs (the KdV and modified KdV equation in particular), describing classical results in the field. The second (and main) part of the talk will focus on some new developments and growing interest into a special case of solutions defined as "soliton gas".

I will describe a collection of works done in collaborations with K. McLaughlin (Tulane U.), T. Grava (SISSA/Bristol), R. Jenkins (UCF) and A. Minakov (U. Karlova).
We analyze the case of a regular, dense KdV soliton gas and its large time behaviour with the presence of a single trial soliton travelling through it.
We are able to derive a series of physical quantities that precisely describe the dynamics, such as the local phase shift of the gas after the passage of the soliton, and the velocity of the soliton peak, which is highly oscillatory and it satisfies the kinetic velocity equation analogous to the one posited by V. Zakharov and G. El (at leading order).
 

I will finally present some ongoing work where we establish that the soliton gas is the universal limit for a large class of N-solutions with random initial data.

 

Location:  Gibson Hall 325   
Time: 3:00pm 

 

Week of January 17 - January 13

 

Friday, January  17

Applied and Computational Math Seminar

Topic: _______

 Di Fang - Duke University

Abstract: Unbounded Hamiltonian Simulation: Quantum Algorithm and Superconvergence

 

Location:  Simulation of quantum dynamics, emerging as the original motivation for quantum computers, is widely viewed as one of the most important applications of a quantum computer. Quantum algorithms for Hamiltonian simulation with unbounded operators Recent years have witnessed tremendous progress in developing and analyzing quantum algorithms for Hamiltonian simulation of bounded operators. However, many scientific and engineering problems require the efficient treatment of unbounded operators, which may frequently arise due to the discretization of differential operators. Such applications include molecular dynamics, electronic structure, quantum differential equations solver and quantum optimization. We will introduce some recent progresses in quantum algorithms for efficient unbounded Hamiltonian simulation, including Trotter type splitting and Magnus expansion based algorithms in the interaction picture. (The talk does not assume a priori knowledge on quantum computing.)

Location: Gibson Hall 126 

Time: 3:00pm 

 

______________________

Thursday,  January  16

Colloquium

Topic: On the flow of zeros of derivatives of polynomials

Andrei Martinez-Finkelshtein - Baylor University (Host: Ken)

Abstract: Assume we have a sequence of polynomials whose asymptotic zero distribution is known. What can be said about the zeros of their derivatives? Especially if we differentiate each polynomial several times, proportional to its degree? This simple-to-formulate problem has recently attracted the attention of researchers. Both the problem and the methods of its solution have exciting connections with free probability, random matrices, and approximation theory on the complex plane. In this talk, I will explain some known results in this direction and our approach to the problem, which uses only some elementary complex analysis. This is a joint work with E. Rakhmanov from the University of South Florida.
 

Location: Gibson Hall 126

Time: 3:30 pm

________________

 

Wednesday,  January  15

Algebra and Combinatorics

Topic: Rings with extremal cohomology annihilator

Souvik Dey - Charles University, Prague Host: (Dipendranath Mahato, Tai Ha)

Abstract: The cohomology annihilator of Noetherian algebras was defined by Iyengar and Takahashi in their work on strong generation in the module category. For a commutative Noetherian local ring, it can be observed that the cohomology annihilator ideal is the entire ring if and only if the ring is regular. Motivated by this, I will consider the question: When is the cohomology annihilator ideal of a local ring equal to the maximal ideal? I will discuss various ring-theoretic and category-theoretic conditions towards understanding this question and describe applications for understanding when the test ideal of the module closure operation on cyclic surface quotient singularities is the maximal ideal.
 

Location: Gibson Hall, room 310

Time: 3:00 pm

________________