◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

B. McDonald

11 papers hereh-index 456 citations15 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author10
  • last author1

Across the 11 of 11 papers where every author was matched, so the position is known.

fields
  • math.CO5
  • math.NT5
  • math.MG1
same name
  • B. McDonald — 2 papers, h 70
  • B. McDonald — 1 paper, h 1
  • B. McDonald — 1 paper, h 10
  • B. McDonald — 1 paper, h 15
  • B. McDonald — 1 paper, h 3
  • B. McDonald — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

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

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

collaborators
Showing 2014 · math.NTShow all

4 papers · 2 filters

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 F1​=1,F2​=2 and Fn+1​=Fn​+Fn−1​, every…

math.NT2014★ 3 cited

Gaps between zeros of GL(2) L-functions

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

Let L(s,f) be an L-function associated to a primitive (holomorphic or Maass) cusp form f on GL(2) over Q. 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 Fn​, with initial terms F1​=1,F2​=2. 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 {Fi​}i=1∞​. A set $S \subset \…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.