Searcharxiv⌕ Search

arXiv subjects

SuHo Oh

Publications and source records attributed to SuHo Oh.

13 recordsLinked to original sources
arXiv2026

Shifted lower Bruhat intervals are EL-shellable

Let $W$ be an arbitrary Coxeter group. The shifted Bruhat interval $[w_1,w_2]\,x^{-1}$, the translate of the Bruhat interval $[w_1,w_2]$ by an element $x$, is partially ordered by the Bruhat order of $W$. These posets arise from affine pavings of Richardson varieties, and in general they are neither twisted intervals nor tilted Bruhat intervals. Our main result is that the shifted lower intervals $[e,w]\,x^{-1}$ are EL-shellable for every Coxeter group, via an explicit labeling of each cover by a reflection. Along the way we show that $[e,w]\,x^{-1}$ is a graded poset with a unique maximum given by the Demazure product and a unique minimum given by an opposite Demazure operator that we introduce.

math.CO↗
arXiv2025

Parking functions and chip-firing on hypergraphs

For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of chip-firing. The set of all $G$-parking functions have various algebraic and combinatorial properties; for instance they relate to evaluations of the Tutte polynomial and in particular are counted by spanning trees of $G$. We extend these constructions to the setting of hypergraphs, where edges can have multiple vertices. For a hypergraph $H$ with sink $q$, we define $H$-parking functions in terms of cuts in $H$ and prove that the maximal such sequences are characterized by certain acyclic orientations of $H$. We introduce a notion of a $q$-rooted spanning tree for $H$, and prove that the set of all such objects are counted by $H$-parking functions. We also show how $H$-parking functions can be recovered as the superstable configurations in a version of chip-firing on $H$, where chips have a choice of where to go when fired. We prove that one can recover such configurations via chip-firing on a family of digraphs associated to $H$.

math.CO↗
arXiv2025

Extendability of $1$-decomposable complexes

A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time while maintaining shellability. The notion of $k$-decomposability for simplicial complexes, which generalizes shellability, was introduced by Provan and Billera (1980). Coleman, Dochtermann, Geist, and Oh (2022) showed that any pure $d$-dimensional $0$-decomposable complex on $n$ vertices can similarly be extended to $\Delta_{n-1}^{(d)}$, attaching one facet at a time while preserving $0$-decomposability. In this paper, we investigate the analogous question for $1$-decomposable complexes. We prove a slightly relaxed version: any pure $d$-dimensional $1$-decomposable complex on $n$ vertices can be extended to $\Delta_{n + d - 3}^{(d)}$, attaching one facet at a time while maintaining $1$-decomposability.

math.CO↗
arXiv2025

Permutation ensembles on products of simplices

We propose the study of $S_n$-ensembles: $n \times n$ arrays of permutations of $[n]$ that encode the boundary data of $n\Delta_{n-1}$. We develop a general toolkit for these ensembles, valid for all $n$, and use it to settle the case $n = 4$. Our main result characterizes which boundary data extend to the interior: an $S_4$-ensemble contains a permutation appearing four times if and only if it avoids a single forbidden configuration, which we call a pattern. We show moreover that the pattern is rigid (an $S_4$-ensemble containing one is unique up to symmetry), so that the non-extendable boundaries form a single orbit.

math.CO↗
arXiv2024

On z-Superstable and Critical Configurations of Chip Firing Pairs

It is well known that there is a duality map between the superstable configurations and the critical configurations of a graph. This was extended to all M-matrices in (Guzm\`an-Klivans 2015). We show a natural way to extend this to all $(L,M)$-chip firing pairs introduced in (Guzm\`an-Klivans 2016). In addition, we study various properties of this map.

math.CO↗
arXiv2024

Gap between the number of facets of the two poset polytopes

We study the difference between the number of facets of the order polytope and the chain polytope of a poset. Hibi and Li classified posets where the gap is exactly zero. We describe the bounds on this gap using the new notion of crossing numbers, and then use this result to classify the posets where the gap is exactly one.

math.CO↗
arXiv2021

The h-vector of a Positroid is a pure O-sequence

A well-known conjecture of Stanley is that the h-vector of any matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. Positroids are special class of linear matroids that play a crucial role in the field of total positivity. In this short note, we prove that Stanley's conjecture holds for positroids.

math.CO↗
arXiv2021

Triconed Graphs, weighted forests, and h-vectors of matroid complexes

A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from taking the spanning trees of a graph as bases, the conjecture is mostly unsolved. In graph theory, a set of vertices is called dominating if every other vertex is adjacent to some vertex inside the chosen set. Kook proved Stanley's conjecture for coned graphs, which is the class of graphs that are dominated by a single vertex. Cranford et al extended that result to biconed graphs, which is the class of graphs dominated by a single edge. In this paper we extend that result to triconed graphs, the class of graphs dominated by a path of length 2.

math.CO↗
arXiv2017

The rank function of a positroid and non-crossing partitions

A positroid is a special case of a realizable matroid, that arose from the study of totally nonnegative part of the Grassmannian by Postnikov. Postnikov demonstrated that positroids are in bijection with certain interesting classes of combinatorial objects, such as Grassmann necklaces and decorated permutations. The bases of a positroid can be described directly in terms of the Grassmann necklace and decorated permutation. In this paper, we show that the rank of an arbitrary set in a positroid can be computed directly from the associated decorated permutation using non-crossing partitions.

math.CO↗
arXiv2014

Links in the complex of weakly separated collections

Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face labels of a plabic graph if that collection forms a maximal weakly separated collection. There are moves that one can apply to plabic graphs, and thus to maximal weakly separated collections, analogous to mutations of seeds in cluster algebras. In this short note, we show that if two maximal weakly separated collections can be mutated from one to another, then one can do so while freezing the face labels they have in common.

math.CO↗
arXiv2013

Poset vectors and generalized permutohedra

We show that given a poset P and and a subposet Q, the integer points obtained by restricting linear extensions of P to Q can be explained via integer lattice points of a generalized permutohedron.

math.CO↗