336 citations · 393 across the 8 of their papers we have counts for
8 papers
Ideal solutions in the Prouhet-Tarry-Escott problem
Don Coppersmith, Michael J. Mossinghoff, Danny Scheinerman +1
For given positive integers and with , the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size having identical th momen…
Counting De Bruijn sequences as perturbations of linear recursions
Don Coppersmith, Robert C. Rhoades, Jeffrey M. VanderKam
Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating…
On curves contained in convex subsets of the plane
Don Coppersmith, Gyozo Nagy, Alex Ravsky
If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of…
Binary Non-tiles
Don Coppersmith, Victor S. Miller
A subset V of GF(2)^n is a tile if GF(2)^n can be covered by disjoint translates of V. In other words, V is a tile if and only if there is a subset A of GF(2)^n such that V+A = GF(…
Random MAX SAT, Random MAX CUT, and Their Phase Transitions
Don Coppersmith, David Gamarnik, Mohammad Hajiaghayi +1
Given a 2-SAT formula consisting of variables and $\cn$ random clauses, what is the largest number of clauses satisfiable by a single assignment of the variables?…
An approximate Fourier transform useful in quantum factoring
D. Coppersmith
We define an approximate version of the Fourier transform on elements, which is computationally attractive in a certain setting, and which may find application to the problem…