Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1702.00806

Diamond-colored distributive lattices, move-minimizing games, and fundamental Weyl symmetric functions: The type $\mathsf{A}$ case

Robert G. Donnelly·Elizabeth A. Donovan·Timothy A. Schroeder
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present some elementary but foundational results concerning diamond-colored modular and distributive lattices and connect these structures to certain one-player combinatorial "move-minimizing games," in particular, a so-called "domino game." The objective of this game is to find, if possible, the least number of "domino moves" to get from one partition to another, where a domino move is, with one exception, the addition or removal of a domino-shaped pair of tiles. We solve this domino game by demonstrating the somewhat surprising fact that the associated "game graphs" coincide with a well-known family of diamond-colored distributive lattices which shall be referred to as the "type $\mathsf{A}$ fundamental lattices." These lattices arise as supporting graphs for the fundamental representations of the special linear Lie algebras and as splitting posets for type $\mathsf{A}$ fundamental symmetric functions, connections which are further explored in sequel papers for types $\mathsf{A}$, $\mathsf{C}$, and $\mathsf{B}$. In this paper, this connection affords a solution to the proposed domino game as well as new descriptions of the type $\mathsf{A}$ fundamental lattices.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert G. Donnelly, Elizabeth A. Donovan, Timothy A. Schroeder. 2017-02-02. Diamond-colored distributive lattices, move-minimizing games, and fundamental Weyl symmetric functions: The type $\mathsf{A}$ case. https://arxiv.org/abs/1702.00806

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗