English
Related papers

Related papers: A self-dual poset on objects counted by the Catala…

200 papers

As observed by Joyal, the cohomology groups of the partition posets are naturally identified with the components of the operad encoding Lie algebras. This connection was explained in terms of operadic Koszul duality by Fresse, and later…

Combinatorics · Mathematics 2025-09-18 Bérénice Delcroix-Oger , Clément Dupont

The superspace ring $\Omega_n$ is a rank $n$ polynomial ring tensor a rank $n$ exterior algebra. Using an extension of the Vandermonde determinant to $\Omega_n$, the authors previously defined a family of doubly graded quotients…

Combinatorics · Mathematics 2021-08-10 Brendon Rhoades , Andrew Timothy Wilson

We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.

Combinatorics · Mathematics 2014-06-24 Thomas Lam

For each permutation $w$, we consider the set $\mathrm{PD}(w)$ of reduced pipe dreams for $w$, partially ordered so that cover relations correspond to (generalized) chute moves. Settling a conjecture of Rubey from 2012, we prove that…

Combinatorics · Mathematics 2025-07-18 Ilani Axelrod-Freed , Colin Defant , Hanna Mularczyk , Son Nguyen , Katherine Tung

We define semi-pointed partition posets, which are a generalisation of partition posets and show that they are Cohen-Macaulay. We then use multichains to compute the dimension and the character for the action of the symmetric groups on…

Combinatorics · Mathematics 2015-06-04 Bérénice Delcroix-Oger

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Combinatorics · Mathematics 2015-12-15 Clifford Smyth

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

Combinatorics · Mathematics 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

In 2010, Bousquet-M\'elou et al. defined sequences of nonnegative integers called ascent sequences and showed that the ascent sequences of length $n$ are in one-to-one correspondence with the interval orders, i.e., the posets not containing…

Combinatorics · Mathematics 2020-04-20 Mitchel T. Keller , Stephen J. Young

Let $B$ be an $n \times n$ nilpotent matrix with entries in an infinite field $\k$. Assume that $B$ is in Jordan canonical form with the associated Jordan block partition $P$. In this paper, we study a poset $\mathcal{D}_P$ associated to…

Commutative Algebra · Mathematics 2015-03-20 Leila Khatami

Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspired much work in recent years. In this paper, we study $P$-strict labelings of a finite, graded poset $P$ of rank $n$ and labels at most…

Combinatorics · Mathematics 2024-06-07 Joseph Bernstein , Jessica Striker , Corey Vorland

Let $\mathbf{H}$ be the cartesian product of a family of finite abelian groups indexed by a finite set $\Omega$. A given poset (i.e., partially ordered set) $\mathbf{P}=(\Omega,\preccurlyeq_{\mathbf{P}})$ gives rise to a poset metric on…

Information Theory · Computer Science 2021-07-23 Yang Xu , Haibin Kan , Guangyue Han

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

The stack sort algorithm has been the subject of extensive study over the years. In this paper we explore a generalized version of this algorithm where instead of avoiding a single decrease, the stack avoids a set $T$ of permutations. We…

Combinatorics · Mathematics 2021-06-14 Katalin Berlow

The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…

Combinatorics · Mathematics 2007-05-23 Bruce E. Sagan

Let B_n be the hyperoctahedral group; that is, the set of all signed permutations on n letters, and let B_n(T) be the set of all signed permutations in B_n which avoids a set T of signed patterns. In this paper, we find all the…

Combinatorics · Mathematics 2007-05-23 T. Mansour , J. West

As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…

Rings and Algebras · Mathematics 2019-11-14 Ivan Chajda , Miroslav Kolařík , Helmut Länger

Nonnesting permutations are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid subsequences of the form $abba$ for any $a\neq b$. These permutations have recently been studied in connection to noncrossing (also called…

Combinatorics · Mathematics 2026-01-21 Sergi Elizalde , Amya Luo

We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…

Information Theory · Computer Science 2013-12-18 Alexander Barg , Luciano V. Felix , Marcelo Firer , Marcos V. P. Spreafico

For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…

Combinatorics · Mathematics 2021-07-26 Henri Mühle , Philippe Nadeau , Nathan Williams