English
Related papers

Related papers: Promotion and Rowmotion

200 papers

We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…

Combinatorics · Mathematics 2022-05-17 Miguel Ottina

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

Alternating sign matrices (ASMs) are square matrices with entries 0, 1, or -1 whose rows and columns sum to 1 and whose nonzero entries alternate in sign. We present a unifying perspective on ASMs and other combinatorial objects by studying…

Combinatorics · Mathematics 2014-08-25 Jessica Striker

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

Number Theory · Mathematics 2026-04-06 Katya Borodinova

A $d$-angulation is a planar map with faces of degree $d$. We present for each integer $d\geq 3$ a bijection between the class of $d$-angulations of girth $d$ (i.e., with no cycle of length less than $d$) and a class of decorated plane…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

We describe a special bijection between the indecomposable summands of two basic $\tau$-tilting modules.

Representation Theory · Mathematics 2025-04-10 Gabriella D'Este , H. Melis Tekin Akcin

Many robot manipulation tasks can be framed as geometric reasoning tasks, where an agent must be able to precisely manipulate an object into a position that satisfies the task from a set of initial conditions. Often, task success is defined…

Robotics · Computer Science 2024-04-23 Ben Eisner , Yi Yang , Todor Davchev , Mel Vecerik , Jonathan Scholz , David Held

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

Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures such as posets and directed graphs. We first show that…

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

The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…

Discrete Mathematics · Computer Science 2024-06-25 Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriah Sigron

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

Combinatorics · Mathematics 2024-01-17 Gunnar Fløystad

It is well known since the seminal work by Bousquet-M\'elou, Claesson, Dukes and Kitaev (2010) that certain refinements of the ascent sequences with respect to several natural statistics are in bijection with corresponding refinements of…

Combinatorics · Mathematics 2020-10-13 Emma Yu Jin , Michael J. Schlosser

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Combinatorics · Mathematics 2015-07-27 Marie Albenque , Dominique Poulalhon

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

Combinatorics · Mathematics 2019-08-13 Hillary S. W. Han , Christian M. Reidys

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde

We show that there are $n!$ matchings on $2n$ points without, so called, left (neighbor) nestings. We also define a set of naturally labeled $(2+2)$-free posets, and show that there are $n!$ such posets on $n$ elements. Our work was…

Combinatorics · Mathematics 2010-07-14 Anders Claesson , Svante Linusson

This note discusses the bijection between the exceptional subcategories of representations of quivers and generalized non-crossing partitions of Weyl groups. We give a new proof of the Ingalls-Thomas-Igusa-Schiffler bijection by using the…

Representation Theory · Mathematics 2016-01-29 Anningzhe Gao

Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…

Combinatorics · Mathematics 2011-08-17 Gábor Hetyei , Christian Krattenthaler