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

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

collaborators

6 papers

math.NT2015

A p-adic Perron-Frobenius Theorem

Robert Costa, Patrick Dynes, Clayton Petsche

We prove that if an matrix defined over (or more generally an arbitrary complete, discretely-valued, non-Archimedean field) satisfies a certain congruen…

math.NT2015

The emergence of 4-cycles in polynomial maps over the extended integers

Andrew Best, Patrick Dynes, Steven J. Miller +2

Let ; for each integer it is interesting to consider the number of iterates , if possible, needed to satisfy . The sets $\{α, f(α),…

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