Combinatorics, Algebra, & Topology Seminar
Fall 2017
All talks are from 12001300 in the designated room unless otherwise specified.

Dec04

MIDN Research PresentationsUSNATime: 12:00 PM

Dec01

Schur positivity in a special case of the Delta ConjectureEmily SergelUniversity of PennsylvaniaTime: 12:00 PM
View Abstract
The modified Macdonald polynomials are an important basis for the ring of symmetric functions with two parameters, q and t. There are several open problems regarding the combinatorics of these polynomials. For example, they are known to expand positively into the Schur basis, but the coefficients of this expansion are unknown. The Shuffle Conjecture was another famous example, but it was proved in 2015 after being open for over a decade. We discuss a related and stillopen conjecture called the Delta Conjecture. The Delta conjecture equates a certain symmetric function with a weighted sum of combinatorial objects called parking functions. The combinatorial side of this conjecture can be expressed in terms of LLT polynomials, which implies Schur positivity. However, Schur positivity on the symmetric function side is unclear. After a detailed introduction to the world of Macdonald polynomials and parking functions, I will prove that, in a special case, the coefficient of any Schur function on the symmetric function side of the Delta conjecture is not just positive, but a positive sum of q,tanalogs. My talk will assume no prior knowledge of symmetric function theory. (Joint work with Dun Qui, Jeff Remmel and Guoce Xin.)

Nov27

The combinatorics of symmetric quotient ringsAndrew WilsonUniversity of PennsylvaniaTime: 12:00 PM
View Abstract
he coinvariant ring of the symmetric group is the quotient of the polynomial ring by the ideal generated by all symmetric polynomials without a constant term. Many properties of this ring are closely connected to the combinatorics of the symmetric group. What if, instead, we mod out by an ideal generated by some other set of polynomials? If the ideal is symmetric, can we use combinatorics to understand the properties of the resulting quotient ring? A variety of authors (Rhoades, Haglund, Shimozono, Huang, Scrimshaw, the speaker, and others) have discovered many wellbehaved quotient rings this way. Furthermore, they have shown that the rings are connected to classical combinatorial objects like ordered set partitions and words. We will provide an overview of the work in this area and pose a conjecture that, if proven, would unify much of the existing work on this problem.

Nov09

Michael TaitCarnegie Mellon UniversityTime: 12:00 PM
View Abstract
How many edges may be in an nvertex graph that does not contain a triangle? Can a set of integers "look like" both an arithmetic progression and a geometric progression at the same time? These are examples of questions in extremal graph theory and combinatorial number theory respectively. In this talk, we discuss how to use finite incidence geometries (eg, a projective plane) to prove theorems in these areas of combinatorics.

Nov06

Degree Sequence PackingJames ShookNational Institute of Standards and TechnologyTime: 12:00 PM

Nov02

A stable arithmetic regularity lemma in finitedimensional vector spaces over fields of prime orderCaroline TerryUniversity of MarylandTime: 12:00 PM
View Abstract
In this talk we present a stable version of the arithmetic regularity lemma for vector spaces over fields of prime order. The arithmetic regularity lemma for $\mathbb{F}_p^n$ (first proved by Green in 2005) states that given $A\subseteq \F_p^n$, there exists $H\leq \F_p^n$ of bounded index such that $A$ is Fourieruniform with respect to almost all costs of $H$. In general, the growth of the index of $H$ is required to be of tower type depending on the degree of uniformity, and must also allow for a small number of nonuniform elements. Our main result is that, under a natural stability theoretic assumption, the bad bounds and nonuniform elements are not necessary. Specifically, we present an arithmetic regularity lemma for kstable sets $A\subseteq \mathbb{F}_p^n$, where the bound on the index of the subspace is only polynomial in the degree of uniformity, and where there are no nonuniform elements. This result is a natural extension to the arithmetic setting of the work on stable graph regularity lemmas initiated by Malliaris and Shelah. This is joint work with Julia Wolf.

Oct30

Franklin KenterUSNATime: 12:00 PM

Oct16

David JoynerUSNATime: 12:00 PM

Sep11

Grothendieck polynomials and the technique of iterated residuesJustin AllmanUSNATime: 12:00 PM
View Abstract
The stable Grothendieck polynomials are symmetric functions which are a nonhomogeneous deformation of Schur functions. In fact, they are the representatives of the Schubert varieties in the Ktheory of the Grassmannian (a role played by Schur functions in cohomology). Recently, Richard Rimanyi and I have shown that the technique of iterated residues can be used to explain many of their important properties; in particular, I will discuss "straightening laws" and the multiplication of stable Grothendieck polynomials in this context. One interesting special case of the multiplicative structure is the Ktheoretic Pieri rule, for which we give a new (to our knowledge) formulation.