Carla D. Savage’s research while affiliated with North Carolina State University and other places

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee rectangle. We also obtain a new bijective proof of a result of Andrews and Bressoud that the number of partitions of N with all ranks at least $1-\ell$ equals the number of partitions of N with no parts equal to $\ell+1$, for $\ell\ge0$, which allows us to refine it by the above statistics. Combining Foata's second fundamental transformation for words with Greene and Kleitman's mapping for subsets, interpreted in terms of lattice paths, we obtain enumeration formulas for partitions whose successive ranks satisfy certain constraints, such as being bounded by a constant.

It follows from work of Chung and Graham that for a certain family of polynomials $P_{n}(x)$ derived from the descent statistic on permutations, the sequence of nonzero coefficients of $P_{n-1}(x)$ coincides with that of the polynomial $P_{n}(x)/(1+x+x^{2}+\cdots+x^{n})$. We observed computationally that the inflated $\mathbf{s}$-Eulerian polynomials, $Q_{n}^{(\mathbf{s})}(x)$, of which $P_{n}(x)$ is a special case, also have this property for many sequences $\mathbf{s}$. In this work we show that $Q_{n}^{(\mathbf{s})}(x)/\left(1+x+\cdots+x^{s_{n}-1}\right)$ is a polynomial for all positive integer sequences $\mathbf{s}$ and characterize those sequences $\mathbf{s}$ for which the sequence of nonzero coefficients of the $Q_{n-1}^{(\mathbf{s})}(x)$ coincides with that of the polynomial $Q_{n}^{(\mathbf{s})}(x)/\left(1+x+\cdots+x^{s_{n}-1}\right)$. In particular, we show that all nondecreasing sequences satisfy this condition.

In 1997 Bousquet-M\'elou and Eriksson introduced lecture hall partitions as the inversion vectors of elements of the parabolic quotient $\widetilde{C}/C$. We provide a new view of their correspondence that allows results in one domain to be translated into the other. We determine the equivalence between combinatorial statistics in each domain and use this correspondence to translate certain generating function formulas on lecture hall partitions to new observations about $\widetilde{C}/C$.

In 1997 Bousquet-M\'elou and Eriksson introduced lecture hall partitions as the inversion vectors of elements of the parabolic quotient $\widetilde{C}/C$. We provide a new view of their correspondence that allows results in one domain to be translated into the other. We determine the equivalence between combinatorial statistics in each domain and use this correspondence to translate certain generating function formulas on lecture hall partitions to new observations about $\widetilde{C}/C$.

Inversion sequences of length n, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each i. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and Corteel-Martinez-Savage-Weselcouch through a systematic study of inversion sequences avoiding words of length 3. We continue this investigation by generalizing the notion of a pattern to a fixed triple of binary relations $(\rho_1,\rho_2,\rho_3)$ and consider the set $\mathbf{I}_n(\rho_1,\rho_2,\rho_3)$ consisting of those $e \in \mathbf{I}_n$ with no $i < j < k$ such that $e_i \rho_1 e_j$, $e_j \rho_2 e_k$, and $e_i \rho_3 e_k$. We show that "avoiding a triple of relations" can characterize inversion sequences with a variety of monotonicity or unimodality conditions, or with multiplicity constraints on the elements. We uncover several interesting enumeration results and relate pattern avoiding inversion sequences to familiar combinatorial families. We highlight open questions about the relationship between pattern avoiding inversion sequences and families such as plane permutations and Baxter permutations. For several combinatorial sequences, pattern avoiding inversion sequences provide a simpler interpretation than otherwise known.

Over the past twenty years, lecture hall partitions have emerged as fundamental combinatorial structures, leading to new generalizations and interpretations of classical theorems and new results. In recent years, geometric approaches to lecture hall partitions have used polyhedral geometry to discover further properties of these rich combinatorial objects. In this paper we give an overview of some of the surprising connections that have surfaced in the process of trying to understand the lecture hall partitions.

Over the past twenty years, lecture hall partitions have emerged as fundamental combinatorial structures, leading to new generalizations and interpretations of classical theorems and new results. In recent years, geometric approaches to lecture hall partitions have used polyhedral geometry to discover further properties of these rich combinatorial objects. In this paper we give an overview of some of the surprising connections that have surfaced in the process of trying to understand the lecture hall partitions.

Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying interpretation that relates a vast array of combinatorial structures. In this paper, we introduce the notion of patterns in inversion sequences. A sequence $(e_1,e_2,\ldots,e_n)$ is an inversion sequence if $0 \leq e_i<i$ for all $i \in [n]$. Inversion sequences of length n are in bijection with permutations of length n; an inversion sequence can be obtained from any permutation $\pi=\pi_1\pi_2\ldots \pi_n$ by setting $e_i = |\{j \ | \ j < i \ {\rm and} \ \pi_j > \pi_i \}|$. This correspondence makes it a natural extension to study patterns in inversion sequences much in the same way that patterns have been studied in permutations. This paper, the first of two on patterns in inversion sequences, focuses on the enumeration of inversion sequences that avoid words of length three. Our results connect patterns in inversion sequences to a number of well-known numerical sequences including Fibonacci numbers, Bell numbers, Schr\"oder numbers, and Euler up/down numbers.

For fixed n and k, we find a three-variable generating function for the set of sequences (λ1,…,λn) satisfyingk≥λ1a1≥λ2a2≥…≥λnan≥0, where a:=(a1,…,an)=(1,2,…,n) or (n,n−1,…,1). When k→∞ we recover the refined anti-lecture hall and lecture hall theorems. When a=(1,2,…,n) and n→∞, we obtain a refinement of a recent result of Chen, Sang and Shi. The main tools are elementary combinatorics and Andrews' generalization of the Watson–Whipple transformation.

We investigate the arithmetic-geometric structure of the lecture hall cone \[ L_n \ := \ \left\{\lambda\in \mathbb{R}^n: \, 0\leq \frac{\lambda_1}{1}\leq \frac{\lambda_2}{2}\leq \frac{\lambda_3}{3}\leq \cdots \leq \frac{\lambda_n}{n}\right\} . \] We show that $L_n$ is isomorphic to the cone over the lattice pyramid of a reflexive simplex whose Ehrhart $h^*$-polynomial is given by the $(n-1)$st Eulerian polynomial, and prove that lecture hall cones admit regular, flag, unimodular triangulations. After explicitly describing the Hilbert basis for $L_n$, we conclude with observations and a conjecture regarding the structure of unimodular triangulations of $L_n$, including connections between enumerative and algebraic properties of $L_n$ and cones over unit cubes.