Results 1 to 10 of about 27 (24)
On Bruhat posets associated to compositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 The purpose of this work 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.
Mahir Bilen Can, Yonah Cherniavsky
doaj +4 more sources
EL-Shellability of Generalized Noncrossing Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In this article we prove that the poset of m-divisible noncrossing partitions is EL-shellable for every well-generated complex reflection group. This was an open problem for type G(d,d,n) and for the exceptional types, for which a proof is given case-by ...
Henri Mühle
doaj +4 more sources
On the Topology of the Cambrian Semilattices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 For an arbitrary Coxeter group $W$, David Speyer and Nathan Reading defined Cambrian semilattices $C_{\gamma}$ as certain sub-semilattices of the weak order on $W$.
Myrto Kallipoliti, Henri Mühle
doaj +1 more source
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 12 pages, 3 ...
Mikael Hansson
doaj +1 more source
Segre Powers of Posets Preserve EL-Shellability
Order9 pages, 3 figures. This paper contains the results of Section 2, Theorems 2.6 and 2.7 of arXiv2408.08421v2 (Version 2), which was was split into two parts. The main part (25 pages) has already appeared in the journal Enumer. Comb. Appl. 5 (2025), no. 3, Paper No. S2R19, 21 pp., doi.org/10.54550/ECA2025V5S3R19.
Yifei Li, Sheila Sundaram
openaire +2 more sources
EL-Shellability of the poset of ranked cactuses
Recently the poset of ranked cactuses $(\mathfrak{P}(X),\preceq)$ was introduced. For a finite set $X$, this poset consists of a set $\mathfrak{P}(X)$ of certain collections of ordered pairs of subsets of $X$ together with an ordering $\preceq$ that is similar to the refinement ordering of partitions of a finite set.
Moulton, Vincent +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
2012
In this article we prove that the poset of m-divisible noncrossing partitions is EL-shellable for every wellgenerated complex reflection group. This was an open problem for type G(d, d, n) and for the exceptional types, for which a proof is given case-by-case.
openaire +1 more source
In this article we prove that the poset of m-divisible noncrossing partitions is EL-shellable for every wellgenerated complex reflection group. This was an open problem for type G(d, d, n) and for the exceptional types, for which a proof is given case-by-case.
openaire +1 more source
Shellability and homology of q-complexes and q-matroids
Journal of Algebraic Combinatorics, 2022Sudhir R Ghorpade, Ghorpade Sudhir R
exaly
Shellability of generalized Dowling posets
Journal of Combinatorial Theory - Series A, 2020Giovanni Paolini
exaly
General lexicographic shellability and orbit arrangements
Annals of Combinatorics, 1997Dmitry Kozlov
exaly