Skip to content

Author

John Fairfax-Ball

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Fixed-Offset Transition for Random Stackability on Paths

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 a single vertex. On the path P_n, we choose a configuration uniformly from all weak compositions of total n times mu_n, where mu_n is a posi...

John Fairfax-Ball · 0 citations
Preprint Oct 2026

Sharp $p$-adic Extrema and Least Extremal Rows for Restricted Binomial GCDs

For integers $m\ge 2$ and rows $N>m$ divisible by $m$, consider the restricted binomial greatest common divisor $G(N;m)=\gcd\{\binom Nk:0<k<N,\ m\mid k\}$. Fix a prime $p$ with $p\nmid m$, and let $r_p(m)$ be the least positive integer $r$ such that $m<p^r$. We prove that the largest possible value of $v_p(G(N;m))$, as...

John Fairfax-Ball · 0 citations
Preprint Sep 2026

Restricted Binomial GCDs at Primes Congruent to -1

For integers $m\geq 2$ and $m\mid N$, let $G(N;m)=\gcd\{\binom{N}{k}:0<k<N,\ m\mid k\}$. We prove a complete $p$-adic valuation formula for $G(N;m)$ at primes $p\equiv -1\pmod m$, under the hypotheses $m\geq 3$, $m\mid N$, and $m<N$. Writing $N=\sum_i d_i p^i$, put $A=\sum_{i\text{ even}}d_i$ and $B=\sum_{i\text{ odd}}...

John Fairfax-Ball · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.