5 papers
Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders
John Fairfax-Ball
Choose a uniformly random ordering of the vertices of a finite tree and run the usual greedy maximal-independent-set algorithm. We compare the resulting law on maximal independent…
Sharp -adic Extrema and Least Extremal Rows for Restricted Binomial GCDs
John Fairfax-Ball
For integers and rows divisible by , consider the restricted binomial greatest common divisor . Fix a prime with $p\…
A Fixed-Offset Transition for Random Stackability on Paths
John Fairfax-Ball
We study a support-collapse version of graph pebbling on paths. A configuration is stackable if a sequence of legal pebbling moves can produce a nonzero configuration supported on…
Restricted Binomial GCDs at Primes Congruent to -1
John Fairfax-Ball
For integers and , let . We prove a complete -adic valuation formula for at primes ,…
The stacking number of a tree
John Fairfax-Ball
Csernák and Soukup introduced the stacking number of a graph: the least integer such that every configuration of pebbles can be transformed by pebbling moves into a con…