English
Related papers

Related papers: $P$-strict promotion and $Q$-partition rowmotion: …

200 papers

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

The $(P, \omega)$-partition generating function of a labeled poset $(P, \omega)$ is a quasisymmetric function enumerating certain order-preserving maps from $P$ to $\mathbb{Z}^+$. We study the expansion of this generating function in the…

Combinatorics · Mathematics 2019-12-24 Ricky Ini Liu , Michael Weselcouch

We study the restrictions, the strict fixed points, and the strict quotients of the partition complex $|\Pi_n|$, which is the $\Sigma_n$-space attached to the poset of proper nontrivial partitions of the set $\{1,\ldots,n\}$. We express the…

Algebraic Topology · Mathematics 2021-04-09 Gregory Arone , Lukas Brantner

A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x<y$. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating…

Combinatorics · Mathematics 2024-12-20 David Bevan , Gi-Sang Cheon , Sergey Kitaev

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

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

Combinatorics · Mathematics 2016-12-30 Gejza Jenča , Peter Sarkoci

A proper merging of two disjoint quasi-ordered sets $P$ and $Q$ is a quasi-order on the union of $P$ and $Q$ such that the restriction to $P$ and $Q$ yields the original quasi-order again and such that no elements of $P$ and $Q$ are…

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

We investigate the dynamics of the well-known RSK bijection on permutations when iterated on various reading words of the recording tableau. In the setting of the ordinary (row) reading word, we show that there is exactly one fixed point…

Combinatorics · Mathematics 2021-03-09 Maria Gillespie , Jacob Hocevar , Ananya Kulshrestha , Kosha Upadhyay

For a set $M$ of $m$ elements, we define a decreasing chain of classes of normalized monotone-increasing valuation functions from $2^M$ to $\mathbb{R}_{\geq 0}$, parameterized by an integer $q \in [2,m]$. For a given $q$, we refer to the…

Computer Science and Game Theory · Computer Science 2023-04-05 Kiril Bangachev , S. Matthew Weinberg

We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal…

Combinatorics · Mathematics 2025-08-28 Esther Banaian , Emily Barnard , Sunita Chepuri , Jessica Striker

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Combinatorics · Mathematics 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

For several pairs $(P,Q)$ of classical distributions on $\N_0$, we show that their stochastic ordering $P\leq_{st} Q$ can be characterized by their extreme tail ordering equivalent to $ P(\{k_\ast \})/Q(\{k_\ast\}) \le 1 \le \lim_{k\to…

Probability · Mathematics 2010-03-09 Achim Klenke , Lutz Mattner

Given a linear extension $\sigma$ of a finite poset $R$, we consider the permutation matrix indexing the Schubert cell containing the Cartan matrix of $R$ with respect to $\sigma$. This yields a bijection $\mathrm{Ech}_\sigma\colon R\to R$…

For an oriented matroid M, and given a generic single element extension and a generic single element lifting of M, the main result of [1] provides a bijection between bases of M and certain reorientations of M induced by the…

Combinatorics · Mathematics 2023-12-13 Emeric Gioan

The Jordan type of a nilpotent matrix is the partition giving the sizes of its Jordan blocks. We study pairs of partitions $(P,Q)$, where $Q={\mathcal Q}(P)$ is the Jordan type of a generic nilpotent matrix A commuting with a nilpotent…

Rings and Algebras · Mathematics 2018-03-15 Anthony Iarrobino , Leila Khatami , Bart Van Steirteghem , Rui Zhao

We consider profunctors $f : P \promap Q$ between posets and introduce their {\em graph} and {\em ascent}. The profunctors $\Pro(P,Q)$ form themselves a poset, and we consider a partition $\cI \sqcup \cF$ of this into a down-set $\cI$ and…

Combinatorics · Mathematics 2023-02-21 Gunnar Fløystad

Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define…

Combinatorics · Mathematics 2023-09-22 Jennifer Elder , Nadia Lafrenière , Erin McNicholas , Jessica Striker , Amanda Welch

A nilpotent endomorphism of a quiver representation induces a linear transformation on the vector space at each vertex. Generically among all nilpotent endomorphisms, there is a well-defined Jordan form for these linear transformations,…

Representation Theory · Mathematics 2022-12-15 Alexander Garver , Rebecca Patrias , Hugh Thomas

We introduce the combinatorial notion of a $q$-fatorization graph intended as a tool to study and express results related to the classification of prime simple modules for quantum affine algebras. These are directed graphs equipped with…

Representation Theory · Mathematics 2024-06-12 Adriano Moura , Clayton Silva

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Anders Claesson , Mark Dukes , Sergey Kitaev