Searcharxiv⌕ Search

arXiv subjects

Patricia Hersh

Publications and source records attributed to Patricia Hersh.

32 records · Page 2Linked to original sources

Toric Cubes

A toric cube is a subset of the standard cube defined by binomial inequalities. These basic semialgebraic sets are precisely the images of standard cubes under monomial maps. We study toric cubes from the perspective of topological combinatorics. Explicit decompositions as CW-complexes are constructed. Their open cells are interiors of toric cubes and their boundaries are subcomplexes. The motivating example of a toric cube is the edge-product space in phylogenetics, and our work generalizes results known for that space.

math.CO↗

Symmetric chain decomposition for cyclic quotients of Boolean algebras and relation to cyclic crystals

The quotient of a Boolean algebra by a cyclic group is proven to have a symmetric chain decomposition. This generalizes earlier work of Griggs, Killian and Savage on the case of prime order, giving an explicit construction for any order, prime or composite. The combinatorial map specifying how to proceed downward in a symmetric chain is shown to be a natural cyclic analogue of the $\mathfrak{sl}_2$ lowering operator in the theory of crystal bases.

math.CO↗

Sorting orders, subword complexes, Bruhat order and total positivity

In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof of Björner and Wachs' result \cite{BW} that the proper part of Bruhat order is homotopy equivalent to the proper part of a Boolean algebra --- that is, to a sphere. We also obtain a geometric interpretation for sorting orders. We conclude with two new results: that the intersection of all sorting orders is the weak order, and the union of sorting orders is the Bruhat order.

math.CO↗

Shelling Coxeter-like Complexes and Sorting on Trees

In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $Δ_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that $Δ_T$ is $(n-b-1)$-connected when the tree has $b$ leaves. We provide a shelling for the $(n-b)$-skeleton of $Δ_T$, thereby proving this conjecture. In the process, we introduce notions of weak order and inversion functions on the labellings of a tree $T$ which imply shellability of $Δ_T$, and we construct such inversion functions for a large enough class of trees to deduce the aforementioned conjecture and also recover the shellability of chessboard complexes $M_{m,n}$ with $n \ge 2m-1$. We also prove that the existence or nonexistence of an inversion function for a fixed tree governs which networks with a tree structure admit greedy sorting algorithms by inversion elimination and provide an inversion function for trees where each vertex has capacity at least its degree minus one.

math.CO↗

Combinatorial Constructions of Weight Bases: The Gelfand-Tsetlin Basis

This work is part of a project on weight bases for the irreducible representations of semisimple Lie algebras with respect to which the representation matrices of the Chevalley generators are given by explicit formulas. In the case of sl_n, the celebrated Gelfand-Tsetlin basis is the only such basis known. Using the setup of supporting graphs developed by Donnelly, we present a simple combinatorial proof of the Gelfand-Tsetlin formulas based on a rational function identity. Some properties of the Gelfand-Tsetlin basis are derived via an algorithm for solving certain equations on the lattice of semistandard Young tableaux.

math.CO↗

Random walks on quasisymmetric functions

Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained. Several well-studied random walks are now realized this way: Stanley's QS-distribution results from endomorphisms given by evaluation maps, a-shuffles result from the a-th convolution power of the universal character, and the Tchebyshev operator of the second kind introduced recently by Ehrenborg and Readdy yields traditional riffle shuffles. A conjecture of Ehrenborg regarding the spectra for a family of random walks on ab-words is proven. A theorem of Stembridge from the theory of enriched P-partitions is also recovered as a special case.

math.CO↗

Coloring complexes and arrangements

Steingrimsson's coloring complex and Jonsson's unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs. Similar results are obtained for characteristic polynomials of submatroids of type B_n arrangements.

math.CO↗

Groebner basis degree bounds on $\Tor^{k[Λ]}_\bullet(k,k)_\bullet$ and discrete Morse theory for posets

The purpose of this paper is twofold. 1. We give combinatorial bounds on the ranks of the groups $\Tor^{R}_\bullet(k,k)_\bullet$ in the case where $R = k[Λ]$ is an affine semi-group ring, and in the process provide combinatorial proofs for bounds by Eisenbud, Reeves and Totaro on which Tor groups vanish. In addition, we show that if the bounds hold for a field $k$ then they hold for $\field[Λ]$ and any field $\field$. Moreover, we provide a combinatorial construction for a free resolution of $\field$ over $\field[Λ]$ which achieves these bounds. 2. We extend the lexicographic discrete Morse function construction of Babson and Hersh for the determination of the homotopy type and homology of order complexes of posets to a larger class of facet orderings that includes orders induced by monomial term orders. Since it is known that the order complexes of finite intervals in the poset of monomials in $k[Λ]$ ordered by divisibility in $k[Λ]$ govern the $\Tor$-groups, the newly developed tools are applicable and serve as the main ingredients for the proof of the bounds and the construction of the resolution.

math.CO↗

Lexicographic shellability for balanced complexes

We introduce a notion of lexicographic shellability for pure, balanced boolean cell complexes, modelled after the $CL$-shellability criterion of Björner and Wachs for posets and its generalization by Kozlov called $CC$-shellability. We give a lexicographic shelling for the quotient of the order complex of a Boolean algebra of rank $2n$ by the action of the wreath product $S_2\wr S_n$ of symmetric groups, and we provide a partitioning for the quotient complex $Δ(Π_n)/S_n $. Stanley asked for a description of the symmetric group representation $β_S $ on the homology of the rank-selected partition lattice $Π_n^S $ in [St2], and in particular he asked when the multiplicity $b_S(n)$ of the trivial representation in $β_S$ is 0. One consequence of the partitioning for $\dps $ is a (fairly complicated) combinatorial interpretation for $b_S(n) $; another is a simple proof of Hanlon's result that $b_{1,..., i}(n)=0$. Using a result of Garsia and Stanton, we deduce from our shelling for $Δ(B_{2n})/S_2 \wr S_n$ that the ring of invariants $k[x_1,..., x_{2n}]^{S_2\wr S_n}$ is Cohen-Macaulay over any field $k$.

math.CO↗

Multiplicity of the trivial representation in rank-selected homology of the partition lattice

We study the multiplicity $b_S(n)$ of the trivial representation in the symmetric group representations $β_S$ on the (top) homology of the rank-selected partition lattice $Π_n^S$. We break the possible rank sets $S$ into three cases: (1) $1\not\in S$, (2) $S=1,..., i$ for $i\ge 1$ and (3) $S=1,..., i,j_1,..., j_l$ for $i,l\ge 1$, $j_1 > i+1$. It was previously shown by Hanlon that $b_S(n)=0$ for $S=1,..., i$. We use a partitioning for $Δ(Π_n)/S_n$ due to Hersh to confirm a conjecture of Sundaram that $b_S(n)>0$ for $1\not\in S$. On the other hand, we use the spectral sequence of a filtered complex to show $b_S(n)=0$ for $S=1,..., i,j_1,..., j_l$ unless a certain type of chain of support $S$ exists. The partitioning for $Δ(Π_n)/S_n$ allows us then to show that a large class of rank sets $S=1,..., i,j_1,..., j_l$ for which such a chain exists do satisfy $b_S(n)>0$. We also generalize the partitioning for $Δ(Π_n)/S_n$ to $Δ(Π_n)/S_λ$; when $λ= (n-1,1)$, this partitioning leads to a proof of a conjecture of Sundaram about $S_1\times S_{n-1}$-representations on the homology of the partition lattice.

math.CO↗

A partitioning and related properties for the quotient complex $Δ(B_{lm})/S_l \wr S_m$

We study the quotient complex $Δ(B_{lm})/S_l\wr S_m$ as a means of deducing facts about the ring $k[x_1,..., x_{lm}]^{S_l\wr S_m}$. It is shown in [He] that this quotient complex is shellable when $l=2$, implying Cohen-Macaulayness of $k[x_1,..., x_{2m}]^{S_2\wr S_m}$ for any field $k$. We now confirm for all pairs $(l,m)$ with $l>2$ and $m>1$ that this quotient complex is not Cohen-Macaulay over $\integ /2\integ $, but it is Cohen-Macaulay over fields of characteristic $p>m$ (independent of $l$). This yields corresponding characteristic-dependent results for the ring of invariants $k[x_1,..., x_{lm}]^{S_l\wr S_m}$. We also prove that this quotient complex and the links of many of its faces are collapsible, and we give a partitioning for this quotient complex.

math.CO↗

A Hodge decomposition for the complex of injective words

Reiner and Webb compute the $S_n$-module structure for the complex of injective words in [RW]. This paper refines their formula by providing a Hodge type decomposition. Along the way, this paper proves that the simplicial boundary map interacts in a nice fashion with the Eulerian idempotents. The Laplacian acting on the top chain group in the complex of injective words is also shown to equal the signed random to random shuffle operator. Uyemura-Reyes conjectures in [Uy] that the (unsigned) random to random shuffle operator has integral spectrum. We prove that this conjecture would imply that the Laplacian on (each chain group in) the complex of injective words has integral spectrum.

math.CO↗

Connectivity of h-complexes

This paper verifies a conjecture of Edelman and Reiner regarding the homology of the $h$-complex of a Boolean algebra. A discrete Morse function with no low-dimensional critical cells is constructed, implying a lower bound on connectivity. This together with an Alexander duality result of Edelman and Reiner implies homology-vanishing also in high dimensions. Finally, possible generalizations to certain classes of supersolvable lattices are suggested.

math.CO↗

A short simplicial h-vector and the upper bound theorem

We verify the Upper Bound Conjecture (UBC) for a class of odd-dimensional simplicial complexes that in particular includes all Eulerian simplicial complexes with isolated singularities. The proof relies on a new invariant of simplicial complexes -- a short simplicial h-vector.

math.CO↗