×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.

Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

Click here to flash read.

Bulgarian Solitaire is an interesting self-map on the set of integer
partitions of a fixed number $n$. As a finite dynamical system, its long-term
behavior is well-understood, having recurrent orbits parametrized by necklaces
of beads with two colors black $B$ and white $W$. However, the behavior of the
transient elements within each orbit is much less understood.


Recent work of Pham considered the orbits corresponding to a family of
necklaces $P^\ell$ that are concatenations of $\ell$ copies of a fixed
primitive necklace $P$. She proved striking limiting behavior as $\ell$ goes to
infinity: the level statistic for the orbit, counting how many steps it takes a
partition to reach the recurrent cycle, has a limiting distribution, whose
generating function $H_p(x)$ is rational. Pham also conjectured that $H_P(x),
H_{P^*}(x)$ share the same denominator whenever $P^*$ is obtained from $P$ by
reading it backwards and swapping $B$ for $W$.


Here we introduce a new representation of Bulgarian Solitaire that is
convenient for the study of these generating functions. We then use it to prove
two instances of Pham's conjecture, showing that


$$H_{BWBWB \cdots WB}(x)=H_{WBWBW \cdots BW}(x)$$ and that $H_{BWWW\cdots
W}(x),H_{WBBB\cdots B}(x)$ share the same denominator.

Click here to read this post out
ID: 329721; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: Aug. 13, 2023, 7:31 a.m. Changes:
Dictionaries:
Words:
Spaces:
Views: 11
CC:
No creative common's license
Comments: