## Spring 2023

Time & Location: All talks are on Wednesday in Gibson Hall 126A, at 3:00 PM unless otherwise noted.

Organizer: Daniel Bernstein

Information on up coming events can be found at unofficial seminar website: Here

*September 6*** **

*September 6*

**Title: **The number of F_q-points on diagonal hypersurfaces with monomial deformation

**Speaker**: Dermot McCarthy - Texas Tech University

**Abstract:**

The abstract had a lot of special characters, so I'll just assume that anyone who's actually interested will read it on Kalina's website

**Location**: Gibson 126 A

**Time**:

**3:00**

*September 20*** **

*September 20*

**Title: ***The Left Half and the Right Half of the Brain: Mathematics and Art*

**Speaker**: **Karl Hofmann - Tulane and TU Darmstadt**

**Abstract:** One area in which mathematics and art approach each other is the field of advertising mathematics in posters for colloquium lectures or seminars, or in providing illustrations in books or articles. As I have been active in this direction I propose a lecture on the difficulties one encounters in the attempt to advertise mathematical contents pictorially.

Accordingly, I shall guide the audience through a short tour of recent colloquium posters for the Mathematics Department of the Technical University of Darmstadt and explain some of the problems one encounters in illustrating and advertising mathematics.

**Location**:

**Gibson Hall 126A**

**Time**:

**3:00**

*September 27*** **

*September 27*

**Title: ***Matroid lifts and representability*

**Speaker**: **Dan Bernstein - Tulane **

**Abstract:** Matroid theory is an area of combinatorics that is becoming increasingly relevant in a broad range of research areas, from optimization to algebraic geometry. A matroid is a combinatorial structure meant to abstract the notion of linear independence in a vector space. In particular, given a vector space V and a finite subset E of V, the subsets of E that are linearly independent are an example of a matroid. Such matroids are called representable. Not all matroids are representable, but certifying that a given matroid is not representable can be a difficult task. In this talk, I will give an introduction to matroids and discuss a new certificate of non-representability that arises out of a matroid construction called lifts. This is joint work with Zach Walsh.

**Location**:

**Gibson Hall 126A**

**Time**:

**3:00**

**October 18**** **

**October 18**

**Title: ***Regularity Bound of Generalized Binomial Edge Ideal of Graphs*

**Arvind Kumar - New Mexico State University**

**Abstract:** I will discuss about the Castelnuovo-Mumford regularity of generalized binomial edge ideals. This class of ideals arises in the study of conditional independence ideals and was introduced by Johannes Rauh in 2011. I will cover Saeedi Madani and Kiani's conjecture about the regularity of this class of ideals.

**Location**: TBA

**Time**:

**3:00**

**October 25**** **

**October 25**

**Title: ***The Principal Minor Map and Its Tropicalization*

**Abeer Al Ahmadieh - TBA**

**Abstract: **The principal minor map takes an $n \times n$ square matrix and maps it to the $2^n$-length vector of its principal minors. In this talk, I will describe both the fiber and the image of this map. In 1986, Loewy proposed a sufficient condition for the fiber to be a single point up to diagonal equivalence. I will provide a necessary and sufficient condition for the fiber to be a single point. Additionally, I will describe the image of the space of complex matrices using a characterization of determinantal representations of multiaffine polynomials, based on the factorization of their Rayleigh differences. Using these techniques, I will present equations and inequalities characterizing the images of the spaces of real and complex symmetric and Hermitian matrices. I will also provide examples to demonstrate that, for general matrices, no finite characterization is possible. Finally, I will describe the tropicalization of the image of the cone of positive semidefinite matrices under this map. This is based on joint research with Felipe Rinc\'on, Cynthia Vinzant and Josephine Yu.

**Location**:

**Gibson Hall 126A**

**Time**:

**3:00**

### November 1** **

**Title: ***Ramanujan congruences for partition functions*

**Mike Hanson - University of North Texas**

**Abstract: **Integer partitions have been studied by mathematicians for many years and have a wide array of applications in and outside of mathematics. Ramanujan was the first to discover surprising divisibility properties of the classical partition-counting function p(n), known as the Ramanujan congruences. Mathematicians later used the connection between partitions and modular forms to fully classify the Ramanujan congruences for p(n). In this talk, we make use of this connection to conclude something more general about divisibility properties of a special class of modular forms called eta-products, and we explore applications to other types of partition-counting functions.

**Location**:

**Gibson Hall 126A**

**Time**:

**3:00**

### November **8 **

**8**

**Title: ***Spectrahedral Regression*

**Eliza O'Reilly - Johns Hopkins University**

**Abstract: **Convex regression is the problem of fitting a convex function to a collection of input-output pairs, and arises naturally in applications such as economics, engineering and computed tomography. We present a new approach to this problem called spectrahedral regression, in which we fit a spectrahedral function to the data, i.e. a function that is the maximum eigenvalue of an affine matrix expression of the input. This method generalizes polyhedral (also called max-affine) regression, in which a maximum of a fixed number of affine functions is fit to the data. We first provide bounds on how well spectrahedral functions can approximate arbitrary convex functions via statistical risk analysis. Second, we analyze an alternating minimization algorithm for the non-convex optimization problem of fitting a spectrahedral function to data. Finally, we demonstrate the utility of our approach with experiments on synthetic and real data sets. This talk is based on joint work with Venkat Chandrasekaran.

**Lcation**: **Gibson Hall 126A**

**Time**:

**3:00**

### November 29

**Title: ***Realizations of hypergraphs and their motions*

**Signe Lundqvist - Umea University**

**Abstract: **The mathematical theory of structural rigidity has a long history. In the nineteenth century, Cauchy studied rigidity of polyhedra, and Maxwell studied graph frameworks. The rigidity theory of graph frameworks has since been studied extensively. Pollaczek-Geiringer, and later Laman, proved a combinatorial characterization of the minimally rigid graphs in the plane.

Combinatorial rigidity theory is also concerned with geometric realizations of other combinatorial structures. In this talk, we will focus on rigidity of realizations of hypergraphs as points and straight lines. We will discuss how to determine whether a realization of a hypergraph is rigid, in the sense that there are no motions of the realization that preserve the incidences of points and lines, and the distance between any pair of points that lie on a line.

We will also discuss motions of realizations of hypergraphs that preserve only the incidences between points and lines. We will see that classical theorems in incidence geometry, such as Pascal's theorem, make determining rigidity with respect to such motions a difficult problem.

The talk will be based on joint work with K.Stokes and L-D. Öhman, as well as work in progress, joint with L.Berman, B.Schulze, B.Servatius, H.Servatius, K.Stokes and W.Whiteley.

**Location**:

**Gibson Hall 126A**

**Time**:

**3:00**