Search arXivSearch

arXiv · 1703.07099

Limit shapes of stable configurations of a generalized Bulgarian solitaire

Abstract

Bulgarian solitaire is played on $n$ cards divided into several piles; a move consists of picking one card from each pile to form a new pile. In a recent generalization, $σ$-Bulgarian solitaire, the number of cards you pick from a pile is some function $σ$ of the pile size, such that you pick $σ(h)\le h$ cards from a pile of size $h$. Here we consider a special class of such functions. Let us call $σ$ well-behaved if $σ(1)=1$ and if both $σ(h)$ and $h-σ(h)$ are non-decreasing functions of $h$. Well-behaved $σ$-Bulgarian solitaire has a geometric interpretation in terms of layers at certain levels being picked in each move. It also satisfies that if a stable configuration of $n$ cards exists it is unique. Moreover, if piles are sorted in order of decreasing size ($λ_1 \ge λ_2\ge \dots$) then a configuration is convex if and only if it is a stable configuration of some well-behaved $σ$-Bulgarian solitaire. If sorted configurations are represented by Young diagrams and scaled down to have unit height and unit area, the stable configurations corresponding to an infinite sequence of well-behaved functions ($σ_1, σ_2, \dots$) may tend to a limit shape $ϕ$. We show that every convex $ϕ$ with certain properties can arise as the limit shape of some sequence of well-behaved $σ_n$. For the special case when $σ_n(h)=\lceil q_n h \rceil$ for $0 < q_n \le 1$, these limit shapes are triangular (in case $q_n^2 n\rightarrow 0$), or exponential (in case $q_n^2 n\rightarrow \infty$), or interpolating between these shapes (in case $q_n^2 n\rightarrow C>0$).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kimmo Eriksson, Markus Jonsson, Jonas Sjöstrand. 2017-03-21. Limit shapes of stable configurations of a generalized Bulgarian solitaire. https://arxiv.org/abs/1703.07099

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