10 citations · 11 across the 6 of their papers we have counts for
6 papers · 1 filter
Ramsey Theory Problems over the Integers: Avoiding Generalized Progressions
Andrew Best, Karen Huan, Nathan McNew +4
Two well studied Ramsey-theoretic problems consider subsets of the natural numbers which either contain no three elements in arithmetic progression, or in geometric progression. We…
Gaussian Distribution of the Number of Summands in Generalized Zeckendorf Decompositions in Small Intervals
Andrew Best, Patrick Dynes, Xixi Edelsbrunner +5
Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers , with initial terms . Previo…
Benford Behavior of Generalized Zeckendorf Decompositions
Andrew Best, Patrick Dynes, Xixi Edelsbrunner +5
We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by and , every…
Geometric-progression-free sets over quadratic number fields
Andrew Best, Karen Huan, Nathan McNew +4
A problem of recent interest has been to study how large subsets of the natural numbers can be while avoiding 3-term geometric progressions. Building on recent progress on this pro…
Gaussian Behavior of the Number of Summands in Zeckendorf Decompositions in Small Intervals
Andrew Best, Patrick Dynes, Xixi Edelsbrunner +5
Zeckendorf's theorem states that every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers , with initial terms . We con…
Benford Behavior of Zeckendorf Decompositions
Andrew Best, Patrick Dynes, Xixi Edelsbrunner +5
A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers . A set $S \subset \…