Search arXivSearch

arXiv · 2205.04938

$P$-strict promotion and $Q$-partition rowmotion: the graded case

Abstract

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 $q$, which generalize semistandard Young tableaux with $n$ rows and entries at most $q$, under promotion. These $P$-strict labelings are in equivariant bijection with $Q$-partitions under rowmotion, where $Q$ equals the product of $P$ and a chain of $q-n-1$ elements. We study the case where $P$ equals the product of chains in detail, yielding new homomesy and order results in the realm of tableaux and beyond. Furthermore, we apply the bijection to the cases in which $P$ is a minuscule poset and when $P$ is the three element $V$ poset. Finally, we give resonance results for promotion on $P$-strict labelings and rowmotion on $Q$-partitions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Bernstein, Jessica Striker, Corey Vorland. 2023-07-11. $P$-strict promotion and $Q$-partition rowmotion: the graded case. https://doi.org/10.1016/j.ejc.2023.103776

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO