Search arXivSearch

arXiv · 2208.11156

Birational rowmotion on a rectangle over a noncommutative ring

Abstract

We extend the periodicity of birational rowmotion for rectangular posets to the case when the base field is replaced by a noncommutative ring (under appropriate conditions). This resolves a conjecture from 2014. The proof uses a novel approach and is fully self-contained. Consider labellings of a finite poset $P$ by $\left|P\right| + 2$ elements of a ring $\mathbb{K}$: one label associated with each poset element and two constant labels for the added top and bottom elements in $\hat{P}$. *Birational rowmotion* is a partial map on such labellings. It was originally defined by Einstein and Propp for $\mathbb{K}=\mathbb{R}$ as a lifting (via detropicalization) of *piecewise-linear rowmotion*, a map on the order polytope $\mathcal{O}(P) := \{\text{order-preserving } f: P \to[0,1]\}$. The latter, in turn, extends the well-studied rowmotion map on the set of order ideals (or more properly, the set of order filters) of $P$, which correspond to the vertices of $\mathcal{O}(P)$. Dynamical properties of these combinatorial maps sometimes (but not always) extend to the birational level, while results proven at the birational level always imply their combinatorial counterparts. Allowing $\mathbb{K}$ to be noncommutative, we generalize the birational level even further, and some properties are in fact lost at this step. In 2014, the authors gave the first proof of periodicity for birational rowmotion on rectangular posets (when $P$ is a product of two chains) for $\mathbb{K}$ a field, and conjectured that it survives (in an appropriately twisted form) in the noncommutative case. In this paper, we prove this noncommutative periodicity and a concomitant antipodal reciprocity formula. We end with some conjectures about periodicity for other posets, and the question of whether our results can be extended to (noncommutative) semirings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Darij Grinberg, Tom Roby. 2023-09-28. Birational rowmotion on a rectangle over a noncommutative ring. https://doi.org/10.5070/c63362790

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