English
Related papers

Related papers: Shellability of posets of labeled partitions and a…

200 papers

A generalization of Dowling lattices was recently introduced by Bibby and Gadish, in a work on orbit configuration spaces. The authors left open the question as to whether these posets are shellable. In this paper we prove EL-shellability…

Combinatorics · Mathematics 2023-12-05 Giovanni Paolini

In this paper, we are concerned with identifying among the family of posets associated with Kohnert polynomials, those whose order complex has a certain combinatorial property. In particular, for numerous families of Kohnert polynomials,…

Combinatorics · Mathematics 2024-04-29 Celia Kerr , Nicholas W. Mayers , Nicholas Russoniello

The concept of a matroid quotient has connections to fundamental questions in the geometry of flag varieties. In previous work, Benedetti and Knauer characterized quotients in the class of lattice path matroids (LPMs) in terms of a simple…

Combinatorics · Mathematics 2025-04-11 Carolina Benedetti , Anton Dochtermann , Kolja Knauer , Yupeng Li

Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a…

Combinatorics · Mathematics 2012-04-03 Russ Woodroofe

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

Combinatorics · Mathematics 2018-06-12 Mahir Bilen Can , Yonah Cherniavsky

In this manuscript we study inclusion posets of Borel orbit closures on (symmetric) matrices. In particular, we show that the Bruhat poset of partial involutions is a lexicographiically shellable poset. Also, studying the embeddings of…

Combinatorics · Mathematics 2013-02-22 Mahir Bilen Can , Tim Twelbeck

We prove that if a simplicial complex is shellable, then the intersection lattice for the corresponding diagonal arrangement is homotopy equivalent to a wedge of spheres. Furthermore, we describe precisely the spheres in the wedge, based on…

Combinatorics · Mathematics 2008-04-12 Sangwook Kim

We give a case-free proof that the lattice of noncrossing partitions associated to any finite real reflection group is EL-shellable. Shellability of these lattices was open for the groups of type $D_n$ and those of exceptional type and rank…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis , Thomas Brady , Colum Watt

In this article we prove that the lattice of noncrossing partitions is EL-shellable when associated with the well-generated complex reflection group of type $G(d,d,n)$, for $d,n\geq 3$, or with the exceptional well-generated complex…

Combinatorics · Mathematics 2016-07-27 Henri Mühle

We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…

Combinatorics · Mathematics 2023-01-02 Keiichi Shigechi

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…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

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…

Combinatorics · Mathematics 2015-03-24 Peter R. W. McNamara , Einar Steingrimsson

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

A poset-stratified space is a pair $(S, S \xrightarrow \pi P)$ of a topological space $S$ and a continuous map $\pi: S \to P$ with a poset $P$ considered as a topological space with its associated Alexandroff topology. In this paper we show…

Algebraic Topology · Mathematics 2019-10-10 Toshihiro Yamaguchi , Shoji Yokura

For a bounded and graded poset $P$, we show that if $P$ is EL-shellable, then so is its $t$-fold Segre power $P^{(t)}=P\circ \cdots \circ P$ ($t$ factors), as defined by Bj\"orner and Welker [J. Pure Appl. Algebra, 198(1-3), 43--55 (2005)].…

Combinatorics · Mathematics 2025-12-12 Yifei Li , Sheila Sundaram

Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.

Combinatorics · Mathematics 2007-05-23 Riccardo Biagioli , Frederic Chapoton

We consider the poset of vector partitions of $[n]$ into $s$ components, denoted $\Pi_{n,s}$, which was first defined by Stanley in 1978. In 1986, Sagan showed that this poset is CL-shellable, and hence has the homotopy type of a wedge of…

Combinatorics · Mathematics 2015-06-16 Natalie Aisbett

It is shown that the coset lattice of a finite group has shellable order complex if and only if the group is complemented. Furthermore, the coset lattice is shown to have a Cohen-Macaulay order complex in exactly the same conditions. The…

Group Theory · Mathematics 2011-01-27 Russ Woodroofe

We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…

Combinatorics · Mathematics 2024-01-09 Roberto Pagaria , Maddalena Pismataro , Tan Nhat Tran , Lorenzo Vecchi

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic
‹ Prev 1 2 3 10 Next ›