Search arXivSearch

arXiv · 1512.00365

Resonance in orbits of plane partitions and increasing tableaux

Abstract

We introduce a new concept of resonance on discrete dynamical systems. This concept formalizes the observation that, in various combinatorially-natural cyclic group actions, orbit cardinalities are all multiples of divisors of a fundamental frequency. Our main result is an equivariant bijection between plane partitions in a box (or order ideals in the product of three chains) under rowmotion and increasing tableaux under $K$-promotion. Both of these actions were observed to have orbit sizes that were small multiples of divisors of an expected orbit size, and we show this is an instance of resonance, as $K$-promotion cyclically rotates the set of labels appearing in the increasing tableaux. We extract a number of corollaries from this equivariant bijection, including a strengthening of a theorem of [P. Cameron--D. Fon-der-Flaass '95] and several new results on the order of $K$-promotion. Along the way, we adapt the proof of the conjugacy of promotion and rowmotion from [J. Striker--N. Williams '12] to give a generalization in the setting of $n$-dimensional lattice projections. Finally we discuss known and conjectured examples of resonance relating to alternating sign matrices and fully-packed loop configurations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin Dilks, Oliver Pechenik, Jessica Striker. 2017-03-17. Resonance in orbits of plane partitions and increasing tableaux. https://doi.org/10.1016/j.jcta.2016.12.007

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