151 citations · 264 across the 42 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.NT2008
Algorithms for translational tiling
Mihail N. Kolountzakis, Mate Matolcsi
In this paper we study algorithms for tiling problems. We show that the conditions and of Coven and Meyerowitz, conjectured to be necessary and sufficient for a finit…
math.NT2008
Coefficients of squares of Newman polynomials
Mihail N. Kolountzakis
We show that there are polynomials of arbitrarily large degree , with coefficients equal to 0 or 1 (Newman polynomials), such that $$ \liminf_{N \to \infty} N \Linf{p_N^2}…