
Date Time 
Location  Speaker 
Title – click for abstract 

01/29 3:00pm 
Zoom 
Eric Rowell TAMU 
Representations of Braid Groups and Motion Groups
Representations of braid groups appear in many (related) guises, as sources of knot and link invariants, transfer matrices in statistical mechanics, quantum gates in topological quantum computers and commutativity morphisms in braided fusion categories. Regarded as trajectories of points in the plane, the natural generalization of braid groups are groups of motions of links in 3 manifolds. While much of the representation theory of braid groups and motions groups remains mysterious, we are starting to see hints that suggest a few conjectures. I will describe a few of these conjectures and some of the progress towards verification. 

02/05 3:00pm 
Zoom 
Jurij Volcic TAMU 
Freely noncommutative Hilbert's 17th problem
One of the problems on Hilbert's 1900 list asked whether every positive rational function can be written as a sum of squares of rational functions. Its affirmative resolution by Artin in 1927 was a breakthrough for real algebraic geometry. The talk addresses the analog of this problem for positive semidefinite noncommutative rational functions. More generally, a rational Positivstellensatz on matricial sets given by linear matrix inequalities will be presented; a crucial intermediate step is an extension theorem on invertible evaluations of linear matrix pencils, which has less to do with positivity and ostensibly more to do with representation theory. One of the consequences of the Positivstellensatz is an algorithm for eigenvalue optimization of noncommutative rational functions. Finally, some contrast between the polynomial and the rational Positivstellensatz in the noncommutative setting will be discussed. 

02/12 3:00pm 
Zoom 
Alexander Ruys de Perez TAMU 
Wheels of Neural Codes: A New Criterion for Nonconvexity
A neural code C on n neurons is a collection of subsets of the set of integers {1,2,...,n}. Usually, C is paired with a collection of n open subsets of some Euclidean space, with C encoding how those open sets intersect. A central problem concerning neural codes is determining convexity; that is, if the code can encode the intersections of n convex open subsets.
In this talk, I will generalize an example of Lienkaemper, Shiu, and Woodstock (2017) into a new criterion for nonconvexity called a 'wheel'. I will show why it forbids convexity, explain how one can find it combinatorially, and provide examples of previously unclassified codes that we now know to be nonconvex due to containing a wheel. 

02/20 3:00pm 
Zoom 

CombinaTexas 

02/21 3:00pm 
Zoom 

CombinaTexas 

02/26 3:00pm 
Zoom 
He Guo Georgia Tech 
Prague dimension of random graphs
The Prague dimension of graphs was introduced by Nesetril, Pultr and Rodl in the 1970s. Proving a conjecture of Furedi and Kantor, we show that the Prague dimension of the binomial random graph is typically of order n/log n for constant edgeprobabilities. The main new proof ingredient is a PippengerSpencer type edgecoloring result for random hypergraphs with large uniformities, i.e., edges of size O(log n).
Based on joint work with Kalen Patton and Lutz Warnke. 

03/05 3:00pm 
Zoom 
ChunHung Liu TAMU 
Wellquasiordering digraphs by the strong immersion relation
A wellquasiordering is a reflexive and transitive binary relation such that every infinite sequence has a nontrivial increasing subsequence. The study of wellquasiordering was stimulated by two conjectures of Vazsonyi in 1940s: trees and subcubic graphs are wellquasiordered by the topological minor relation. It is known that the topological minor relation does not wellquasiorder all graphs. NashWilliams in 1960s introduced the notion of strong immersion and conjectured that the strong immersion relation wellquasiorders all graphs, which is a common generalization of both conjectures of Vazsonyi. In this talk we consider strong immersion on digraphs. Paths that change direction arbitrarily many times form an infinite antichain with respect to the strong immersion relation. In this talk, we will prove that it is the only obstruction. Namely, for any integer k, digraphs with no paths that change direction at least k times are wellquasiordered by the strong immersion relation. Joint work with Irene Muzi. 

03/12 3:00pm 
Zoom 
Youngho Yoo Georgia Tech 
Packing Apaths and cycles with modularity constraints
A classical result of Erdős and Pósa states that a graph without many disjoint cycles contains a small vertex set intersecting every cycle. The analogous statement fails however for odd cycles, as can be shown by large projective planar grids. In 1987, Dejter and NeumannLara raised the question of when this approximate packingcovering duality holds for cycles of length L mod M, and there had been minimal progress on this problem until recently. There are similar questions on packing Apaths (paths meeting a vertex set A at exactly its endpoints) with modularity constraints. Casting these problems in the more general setting of grouplabelled graphs and studying their structure, we obtain a complete characterization of the integer pairs L and M for which the above approximate duality holds for Apaths and cycles of length L mod M. Joint work with Robin Thomas and with Pascal Gollin, Kevin Hendrey, Ojoung Kwon, and Sangil Oum. 

03/26 3:00pm 
Zoom 
Zixia Song University of Central Florida 
Hadwiger’s Conjecture
Hadwiger's conjecture from 1943 states that for every integer t, every graph either can be tcolored or has a subgraph that can be contracted to the complete graph on t+1 vertices. This is a farreaching generalization of the FourColor Theorem and perhaps the most famous conjecture in graph theory. In this talk we will survey the history of Hadwiger's conjecture and the main ideas of recent results. 

04/09 3:00pm 
Zoom 
Anton Dochtermann Texas State University 
Betti numbers of random edge ideals
We study asymptotic homological properties of random quadratic monomial ideals in a polynomial ring R = k[x_1, . . . , x_n], utilizing methods from the Erd\"osR\'enyi model of random graphs. Here we consider a graph on n vertices and exclude an edge (corresponding to a quadratic generator of the ideal I) with probability p, and consider algebraic properties as n tends to infinity. Our main results involve fixing the edge parameter p = p(n) so that asymptotically almost surely the Krull dimension of R/I is fixed. Under these conditions we establish various properties regarding the Betti table of R/I, including sharp bounds on regularity and projective dimension and distribution of nonzero Betti numbers. These results extend work of ErmanYang, who studied such ideals in the context of conjectured phenomena in the nonvanishing of asymptotic syzygies. Our results use collapsibility properties of random clique complexes and Garland's method regarding spectral gaps of graphs, and in particular rely on the underlying field in some cases. This is joint work with Andrew Newman. 

04/16 3:00pm 
Zoom 
Songling Shan Illinois State University 
Chromatic index of dense quasirandom graphs
Let $G$ be a simple graph with maximum degree $\Delta(G)$. A subgraph $H$ of $G$ is overfull if $E(H)>\Delta(G)\lfloor V(H)/2 \rfloor$. Chetwynd and Hilton in 1985 conjectured that a graph $G$ on $n$ vertices with $\Delta(G)>n/3$ has chromatic index $\Delta(G)$ if and only if $G$ contains no overfull subgraph. Glock, K\"{u}hn, and Osthus in 2016 showed that the conjecture is true for dense quasirandom graphs with even order, and they conjectured that the same should hold for such graphs with odd order. We show that the conjecture of Glock, K\"{u}hn, and Osthus is affirmative. 

04/23 3:00pm 
Zoom 
Byeongsu Yu TAMU 
When is the quotient of a semigroup ring by a monomial ideal CohenMacaulay?
We give a new combinatorial criterion for quotients of affine semigroup rings by monomial ideals to be CohenMacaulay, by computing the homology of finitely many polyhedral complexes. This provides a common generalization of wellknown criteria for affine semigroup rings and monomial ideals in polynomial rings. This is joint work with Laura Matusevich. 