5 citations · 12 across the 18 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.NT2016
Random multiplicative walks on the residues modulo n
Nathan McNew
We introduce a new arithmetic function defined to be the number of random multiplications by residues modulo before the running product is congruent to 0 modulo . We…
math.NT2016★ 4 cited
When Sets Can and Cannot Have MSTD Subsets
Hung Chu, Nathan McNew, Steven J. Miller +2
A finite set of integers is a sum-dominant (also called an More Sums Than Differences or MSTD) set if . While almost all subsets of are not sum…
math.NT2016
Subsets of free of 3-term geometric progressions
Megumi Asada, Eva Fourakis, Sarah Manski +3
Several recent papers have considered the Ramsey-theoretic problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has a…