Search arXivSearch

arXiv · 1705.02665

Homomesy in products of three chains and multidimensional recombination

Abstract

J. Propp and T. Roby isolated a phenomenon in which a statistic on a set has the same average value over any orbit as its global average, naming it homomesy. They proved that the cardinality statistic on order ideals of the product of two chains poset under rowmotion exhibits homomesy. In this paper, we prove an analogous result in the case of the product of three chains where one chain has two elements. In order to prove this result, we generalize from two to $n$ dimensions the recombination technique that D. Einstein and Propp developed to study homomesy. We see that our main homomesy result does not fully generalize to an arbitrary product of three chains, nor to larger products of chains; however, we have a partial generalization to an arbitrary product of three chains. Additional corollaries include refined homomesy results in the product of three chains and a new result on increasing tableaux. We conclude with a generalization of recombination to any ranked poset and a homomesy result for the Type B minuscule poset cross a two element chain.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Corey Vorland. 2019-11-20. Homomesy in products of three chains and multidimensional recombination. https://arxiv.org/abs/1705.02665

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