Search arXivSearch

arXiv · 2507.18230

Rowmotion and Echelonmotion

Abstract

Given a linear extension $σ$ of a finite poset $R$, we consider the permutation matrix indexing the Schubert cell containing the Cartan matrix of $R$ with respect to $σ$. This yields a bijection $\mathrm{Ech}_σ\colon R\to R$ that we call echelonmotion; it is the inverse of the Coxeter permutation studied by Klász, Marczinzik, and Thomas. Those authors proved that echelonmotion agrees with rowmotion when $R$ is a distributive lattice. We generalize this result to semidistributive lattices. In addition, we prove that every trim lattice has a linear extension with respect to which echelonmotion agrees with rowmotion. We also show that echelonmotion on an Eulerian poset (with respect to any linear extension) is an involution. Finally, we initiate the study of echelon-independent posets, which are posets for which echelonmotion is independent of the chosen linear extension. We prove that a lattice is echelon-independent if and only if it is semidistributive. Moreover, we show that echelon-independent connected posets are bounded and have semidistributive MacNeille completions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Colin Defant, Yuhan Jiang, Rene Marczinzik, Adrien Segovia, David E Speyer, Hugh Thomas, Nathan Williams. 2025-07-24. Rowmotion and Echelonmotion. https://arxiv.org/abs/2507.18230

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO