9 citations · 17 across the 8 of their papers we have counts for
Showing math.NTShow all
2 papers · 1 filter
math.NT2017★ 2 cited
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…
math.NT2016★ 9 cited
Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions
Katherine Cordwell, Max Hlavacek, Chi Huynh +3
Given a recurrence sequence , with where for all and , the generalized Zeckendorf decomposi…