Invited Talks

Jeremiah Bartz, University of North Dakota

Title: Balancing Numbers: Finding Balance in Sequences

Abstract: A common endeavor in mathematics is to identify when two quantities are equal. In 1999, Behera and Panda applied this concept to a certain integer sequence to define the notion of balancing numbers. More precisely, we say the positive integer B is a balancing number if there is a positive integer m such that T(B-1)+T(B)=T(m) where T(k) = k(k+1)/2 is the kth triangular number. For example, 6 is a balancing number since T(5)+T(6)=T(8) or equivalently 1+2+3+4+5=7+8. In this talk, we survey results of balancing numbers and their generalizations. In particular, we identify characteristics that balancing numbers share with Pythagorean triples and the Fibonacci sequence as well as current research directions.


Slides for Jeremiah Bartz's talk are here



Emily Heath, Iowa State University

Title: The Erdős-Gyárfás problem on generalized Ramsey numbers

Abstract: (p, q)-coloring of a graph G is an edge-coloring of G (not necessarily proper) in which each p-clique contains edges of at least q distinct colors. We are interested in finding the minimum number of colors, f(n, p, q), needed for a (p, q)-coloring of the complete graph on n vertices. Erdős and Gyárfás initiated the systematic study of this function in 1997. In this talk, I will survey known results for this Ramsey problem and describe strategies for improving the upper and lower bounds on f(n, p, q).

This is joint work with Alex Cameron and with József Balogh, Sean English, and Robert Krueger.


Slides for Emily Heath's talk are here.


Chris Fraser, Michigan State University

Title: Webs and canonical bases in degree two

Abstract: An ongoing problem in algebraic combinatorics is the construction of "good bases" for representations of simple Lie groups. I will give some background on some approaches to this problem, including an approach via web diagrams. Then I will explain a new result which fits into this framework: Lusztig's canonical basis for the degree two part of the Grassmannian coordinate ring consists of web diagrams.


Slides for Chris Fraser's talk are here.


Jeremy Martin, University of Kansas

Title: Simplicial and Cellular Trees

Abstract: One of the first results in algebraic graph theory is Kirchhoff's Matrix-Tree Theorem, which enumerates spanning trees of a graph in terms of its Laplacian matrix. A classic application is a quick proof of "Cayley's formula" $n^{n-2}$ for the number of labeled trees on $n$ vertices. What about spanning trees of higher-dimensional objects, like

simplicial and cell complexes? It turns out that the same methods work (with some topological wrinkles). I will give an overview of the subject, and if time permits will discuss my recent work with Duval, Kook, and Lee on higher-dimensional electrical potential theory and applications to spanning tree enumeration.


Slides for Jeremy Martin's talk are here.



Anna Weigandt, Massachusetts Institute of Technology

Title: The Castelnuovo-Mumford Regularity of Matrix Schubert Varieties

Abstract: The Castelnuovo-Mumford regularity of a graded module provides a measure of how complicated its minimal free resolution is. In work with Rajchgot, Ren, Robichaux, and St. Dizier, we noted that the regularity of Matrix Schubert Varieties can be easily obtained by knowing the degree of the corresponding Grothendieck polynomial. Furthermore, we gave explicit, combinatorial formulas for the degrees of symmetric Grothendieck polynomials. In this talk, I will present a combinatorial degree formula for arbitrary Grothendieck polynomials. This is joint work with Oliver Pechenik and David Speyer.


Slides for Anna Weigandt's talk are here.


Nathan Williams, University of Texas at Dallas

Title: Pop-Tsack Torsing

Abstract: Given a finite irreducible Coxeter group W, we use the W-noncrossing partition lattice to define a Bessis dual version of C. Defant’s notion of a Coxeter pop-stack sorting operator. We show that if W is coincidental or of type D, then the identity element of W is the unique periodic point of this operator and the maximum size of a forward orbit is the Coxeter number of W. In each of these types, we obtain a natural lift from W to the dual braid monoid of W. This is joint work with C. Defant.



Mei Yin, University of Denver

Title: Parking functions: Interdisciplinary connections

Abstract: The topic of parking functions has wide applications in probability, combinatorics, group theory, and computer science. Suppose that m drivers each choose a preferred parking space in a linear car park with n spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If all drivers park successfully, the sequence of choices is called a parking function. Through a combinatorial construction termed a parking function multi-shuffle, we investigate various probabilistic properties of a uniform parking function. Time permitting, algebraic properties of parking functions will also be discussed. Partially based on joint work with Richard Kenyon.

Worksheet for Mei Yin's talk is here.