17 citations · 42 across the 3 of their papers we have counts for
3 papers
Explicit constructions of infinite families of MSTD sets
Steven J. Miller, Brooke Orosz, Daniel Scheinerman
We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r…
Asymptotic estimates for phi functions for subsets of {m+1, m+2,...,n}
Melvyn B. Nathanson, Brooke Orosz
Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime…
Binary linear forms over finite sets of integers
Melvyn B. Nathanson, Kevin O'Bryant, Brooke Orosz +2
Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for e…