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

10 citations · 14 across the 5 of their papers we have counts for

collaborators

5 papers

math.NT2015★ 1 cited

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…

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★ 3 cited

Gaps between zeros of GL(2) -functions

Owen Barrett, Brian McDonald, Steven J. Miller +3

Let be an -function associated to a primitive (holomorphic or Maass) cusp form on GL(2) over . Combining mean-value estimates of Montgomery and Vaughan…

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