12 citations · 64 across the 43 of their papers we have counts for
6 papers · 1 filter
Counting Restricted Partitions of Integers into Fractions: Symmetry and Modes of the Generating Function and a Connection to
Zachary Hoelscher, Eyvindur Ari Palsson
Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even num…
Tinkering with Lattices: A New Take on the Erdős Distance Problem
Elzbieta Boldyriew, Elena Kim, Steven J. Miller +4
The Erdős distance problem concerns the least number of distinct distances that can be determined by points in the plane. The integer lattice with points is known as \texti…
Discrete maximal operators over surfaces of higher codimension
Theresa C. Anderson, Eyvindur Ari Palsson, Angel V. Kumchev
Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analy…
On algorithms to calculate integer complexity
Katherine Cordwell, Alyssa Epstein, Anand Hemmady +5
We consider a problem first proposed by Mahler and Popken in 1953 and later developed by Coppersmith, Erdős, Guy, Isbell, Selfridge, and others. Let be the complexity of $n…
Individual Gap Measures from Generalized Zeckendorf Decompositions
Robert Dorward, Pari L. Ford, Eva Fourakis +3
Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers. The distribution of the number of summands converge…
A Generalization of Zeckendorf's Theorem via Circumscribed -gons
Robert Dorward, Pari L. Ford, Eva Fourakis +4
Zeckendorf's theorem states that every positive integer can be uniquely decomposed as a sum of nonconsecutive Fibonacci numbers, where the Fibonacci numbers satisfy $F_n=F_{n-1}+F_…