activity
20142017
most citedGaussian Behavior of the Number of Summands in Zeckendorf Decompositions in Small Intervals

10 citations · 11 across the 6 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.NT2014

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…

math.NT2014

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…

math.PR2014

Limiting Spectral Measures for Random Matrix Ensembles with a Polynomial Link Function

Kirk Swanson, Steven J. Miller, Kimsy Tor +1

Consider the ensembles of real symmetric Toeplitz matrices and real symmetric Hankel matrices whose entries are i.i.d. random variables chosen from a fixed probability distribution…

math.NT2014★ 10 cited

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…

math.NT2014

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 \…