Sept 18 
Richard Ehrenborg
University of Kentucky 
Simion's type B associahedron is a pulling triangulation
of the Legendre polytope
We show that the Simion type B associahedron is combinatorially equivalent to a pulling triangulation of the type A root polytope known as the Legendre polytope. Furthermore, we show that every pulling triangulation of the boundary of the Legendre polytope yields a flag complex. Our triangulation refines a decomposition of the boundary of the Legendre polytope given by Cho. This is joint work with Gábor Hetyei and Margaret Readdy. 
Sept 25 
Zhexiu Tu
Centre College 
Topological Representations of Matroids and the cdindex
There are several different topological representations of nonorientable matroids. In this talk, inspired by Swartz's work, I will show an explicit fully partitioned homotopy sphere darrangement S that is a CWcomplex whose intersection lattice is the geometric lattice of the corresponding matroid for matroids of rank < 5. Moreover S has a dsphere in it that is a regular CWcomplex. We will also look at enumerative properties, including how the flag fvector formula of Billera, Ehrenborg and Readdy for oriented matroids applies to arbitrary matroids. 
Oct 2 
Alex Happ
University of Kentucky 
The sum of powers of the descent set statistic
We study the sum of the rth powers of the descent set statistic and how many small prime factors occur in these numbers. The results will depend upon the base p expansion of n and r. This is joint work with Richard Ehrenborg 
Oct 9 
McCabe Olsen
University of Kentucky 
Level algebras and lecture hall polytopes
Given a family of lattice polytopes, a common question in Ehrhart theory is classifying the which polytopes in the family are Gorenstein. A less common question is classifying which polytopes in the family admit level semigroup algebras, a generalization of the Gorenstein property. In this talk, we consider these questions for lecture hall polytopes. We provide a characterization of the Gorenstein property for a large subfamily of lecture hall polytopes. Additionally, we also provide a complete characterization for the level property. This is joint work with Florian Kohl 
Oct 16 
Open date


Oct 23 
No meeting


Oct 30 
Rafael González D'león
Universidad Sergio Arboleda and York University 
The Whitney dual of a graded poset
Two posets are Whitney duals to each other if the (absolute value of their) Whitney numbers of the first and second kind are switched between the two posets. We introduce new types of edge and chainedge labelings of a graded poset which we call Whitney labelings. We prove that every graded poset with a Whitney labeling has a Whitney dual and we show how to explicitly construct a Whitney dual using a technique that involves quotient posets. As an application of our main theorem, we show that geometric lattices, the lattice of noncrossing partitions, the poset of weighted partitions studied by González D'LeónWachs and the R*Slabelable posets studied by SimionStanley all have Whitney duals. We also show that a graded poset P with a Whitney labeling admits a local action of the 0Hecke algebra on the set of maximal chains of P. The characteristic of the associated representation is Ehrenborg's flag quasisymmetric function of P. This is joint work with Josh Hallam (Wake Forest Universtity). 
Nov 6 
Megan Bernstein
Georgia Tech 
Progress in showing cutoff for random walks on the symmetric group
Cutoff is a remarkable property of many Markov chains in which they rapidly transition from an unmixed to a mixed distribution. Most random walks on the symmetric group, also known as card shuffles, are believed to mix with cutoff, but we are far from being able to proof this. We will survey existing cutoff results and techniques for random walks on the symmetric group, and present three recent results: cutoff for a biased transposition walk, cutoff for the randomtorandom card shuffle (answering a 2001 conjecture of Diaconis), and precutoff for the involution walk, generated by permutations with a binomially distributed number of twocycles. The results use either probabilistic techniques such as strong stationary times or diagonalization through algebraic combinatorics and representation theory of the symmetric group. Includes joint work with Nayantara Bhatnagar, Evita Nestoridi, and Igor Pak. 
Nov 13 
Radmila Sazdanovic
NC State University 
Chromatic homology theories
This talk is an entree to categorification through knot theory and graph theory. The focal point is the chromatic polynomial and is categorifications: chromatic graph homology over algebra defined by L. HelmeGuizon and Y. Rong, and the homology of a graph configuration space introduced by M. Eastwood, S. Huggett. Time permitting, we will discuss relations between these homology theories in the form of spectral sequences, as well as a new invariant of simplicial complexes inspired by the Eastwood and Huggett approach. 
Nov 20 
Andy Wilson
U Penn 
The combinatorics of symmetric quotient rings
The 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. 
Nov 27 
Joseph Cummings
University of Kentucky 
CohenMacaulay StanleyReisner Rings
It turns out that in order to solve many purely combinatorial problems relating to simplicial complexes, one needs to study algebraic properties of its StanleyReisner ring. For example, we will show the CohenMacaulay condition gives us sharp bounds on the complex’s hvector. We will also discuss Reisner’s criterion which gives an equivalent combinatorial criterion for CohenMacaulyness, and time permitting, Stanley’s upper bound theorem for simplicial spheres. 
Dec 4 
Marie Meyer
University of Kentucky 
Polytopes Associated to Graphs
There are many advantageous ways to associate a polytope to a graph. In this talk, we will discuss a couple of such constructions while highlighting some notable results. First we will look at edge polytopes introduced by Ohsugi and Hibi as well as applications through constructive examples from a paper by Lason and Michalek. Then we will look at Laplacian simplices associated to graphs and digraphs in the time remaining. 
Jan 22 
Brian Davis
University of Kentucky 
Regular triangulations and Gröbner bases
In this talk we will give a friendly introduction to regular triangulations, which is a tool for breaking down an integer polytope into simpler pieces: high dimensional triangles! In the second part of the talk we will present a context in which triangulations make a normally difficult computation much easier. The main theorem, presented without proof, is really charming! We assume no knowledge of commutative algebra beyond the prelim sequence. 
Jan 29 
McCabe Olsen
University of Kentucky 
Ehrhart theory and ordered set partitions
Given a lattice polytope P, one of the central questions in Ehrhart theory is to describe the h*polynomial (or h*vector) of P, as this encodes and detects certain algebraic and geometric properties of P. Given that the coefficients of the h*polynomial are nonnegative integers, it is natural (for a combinatorialist) to wishfully think that these coefficients count something; that is, ideally this polynomial encodes some statistic on some combinatorial object. In this talk, we will discuss some conjectures of Nick Early regarding the h*polynomial of two wellknown polytopes, namely dilated unit simplices and hypersimplices, involving a winding number statistic on certain decorated ordered set partitions. We will provide a proof to one of these conjectures and discuss the other. 
Feb 5 
Ben Braun
University of Kentucky 
Ehrhart h* polynomials, unit circle roots, and Ehrhart positivity
We will introduce the basics of Ehrhart theory, then discuss methods for establishing Ehrhart positivity using h* polynomials with roots on the unit circle. This is based on joint work with Fu Liu. 
Feb 12 
Karthik Chandrasekhar
University of Kentucky 
Facing up to metrics
Here we study arrangements of geodesic lines on spaces topologically equivalent to the real 2plane, but having different metrics. We study the regions of all possible fvectors. Mainly we study the hyperbolic plane (the upper half plane with a nonEuclidean metric) which reveals a vastly different region of fvectors. 
Feb 19 
Carl Lee
University of Kentucky 
The Ingredients of the gTheorem
I will present some of the historical context of the gTheorem, which characterizes the numbers of faces of simplicial convex polytopes, and the ingredients of its proof. 
Feb 26 
Andrés R. Vindas Meléndez
University of Kentucky 
Fixed Subpolytopes of the Permutahedron
Motivated by the generalization of Ehrhart theory with group actions, this project makes progress towards obtaining the equivariant Ehrhart theory of the permutahedron. The fixed subpolytopes of the permutahedron are the polytopes that are fixed by acting on the permutahedron by a permutation. We prove some general results about the fixed subpolytopes. In particular, we compute their dimension, show that they are combinatorially equivalent to permutahedra, provide hyperplane and vertex descriptions, and prove that they are zonotopes. Lastly, we obtain a formula for the volume of these fixed subpolytopes, which is a generalization of Richard Stanley's result of the volume for the standard permutahedron. This is joint work with Federico Ardila (San Francisco State) and Anna Schindler (University of Washington). 
Mar 5 
Gábor Hetyei
UNC Charlotte 
Partitions of a fixed genus have an algebraic generating function
We show that, for any fixed genus g, the ordinary generating function for the genus g partitions of an nelement set into k blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a primitive partition and that the number of primitive partitions of a given genus is finite. We illustrate our method by finding the generating function for genus 2 partitions, after identifying all genus 2 primitive partitions, using a computerassisted search. This is joint work with Robert Cori. 
Mar 12 
Spring Break


Mar 19 
Nick Early


Mar 26 
Open date

MR out of town 
Apr 2 
Open date


Apr 9 
Open date


Apr 16 
Open date


Apr 23 
Open date


Last updated January 29, 2018.