Related papers: Shellability of Kohnert posets

We discuss properties of root posets for finite crystallographic root systems, and show that these properties uniquely determine root posets for the noncrystallographic dihedral types and type $H_3$, while proving that there does not exist…

Building from the work of von Bell et al.~(2022), we study the Ehrhart theory of order polytopes arising from a special class of distributive lattices, known as generalized snake posets. We present arithmetic properties satisfied by the…

We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…

The purpose of this article is to initiate a combinatorial study of the Bruhat-Chevalley ordering on certain sets of permutations obtained by omitting the parentheses from their standard cyclic notation. In particular, we show that these…

In this article, we study properties of the exponential Hilbert series of a $G$-equivariant projective variety, where $G$ is a semisimple, simply-connected complex linear algebraic group. We prove a relationship between the exponential…

This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…

Shellings of simplicial complexes have long been a useful tool in topological and algebraic combinatorics. Shellings of a complex expose a large amount of information in a helpful way, but are not easy to construct, often requiring deep…

There are a large number of theorems detailing the homological properties of the Stanley--Reisner ring of a simplicial complex. Here we attempt to generalize some of these results to the case of a simplicial poset. By investigating the…

The goal of this paper is to generalize some of the existing toolkit of combinatorial algebraic topology in order to study the homology of abstract chain complexes. We define shellability of chain complexes in a similar way as for cell…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

We compute the Coxeter polynomial of a family of Salem trees, and also the limit of the spectral radii of their Coxeter transformations as the number of their vertices tends to infinity. We also prove a relation about multiplicities of…

A subfamily $\{F_1,F_2,\dots,F_{|P|}\}\subseteq \mathcal F$ is a copy of the poset $P$ if there exists a bijection $i:P\rightarrow \{F_1,F_2,\dots,F_{|P|}\}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$. A family $\mathcal F$ is…

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a…

In this article we give a simple, almost uniform proof that the lattice of noncrossing partitions associated with a well-generated complex reflection group is lexicographically shellable. So far a uniform proof is available only for Coxeter…

In this paper, we study a class of sequences of polynomials linked to the sequence of Bell polynomials. Some sequences of this class have applications on the theory of hyperbolic differential equations and other sequences generalize…

Kamiya, Takemura, and Terao introduced a characteristic quasi-polynomial which enumerates the numbers of elements in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic…

In 1980, Edelman defined a poset on objects called the noncrossing 2-partitions. They are closely related with noncrossing partitions and parking functions. To some extent, his definition is a precursor of the parking space theory, in the…

A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…