J. Vanderkam

activity

20172024

most citedCounting De Bruijn sequences as perturbations of linear recursions

9 citations · 9 across the 3 of their papers we have counts for

collaborators

3 papers

cs.IT2024

Efficient Unbiased Sparsification

Leighton Barnes, Stephen Cameron, Timothy Chow +6

An unbiased $m$ -sparsification of a vector $p \in R^{n}$ is a random vector $Q \in R^{n}$ with mean $p$ that has at most $m < n$ nonzero coordinates. Unbiased sparsificat…

math.NT2023

Ideal solutions in the Prouhet-Tarry-Escott problem

Don Coppersmith, Michael J. Mossinghoff, Danny Scheinerman +1

For given positive integers $m$ and $n$ with $m < n$ , the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size $n$ having identical $k$ th momen…

math.CO2017★ 9 cited

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…