6 citations · 6 across the 1 of their papers we have counts for
4 papers
A Short Proof of Bernoulli Disjointness via the Local Lemma
Anton Bernshteyn
Recently, Glasner, Tsankov, Weiss, and Zucker showed that if is an infinite discrete group, then every minimal -flow is disjoint from the Bernoulli shift . Their proof…
Improved Lower Bound for Difference Bases
Anton Bernshteyn, Michael Tait
A difference basis with respect to is a subset such that . Rédei and Rényi showed that the minimum size of a differen…
Free Subshifts with Invariant Measures from the Lovász Local Lemma
Anton Bernshteyn
Gao, Jackson, and Seward (see arXiv:1201.0513) proved that every countably infinite group admits a nonempty free subshift . Furthermore, a theorem of Sew…
Regular colorings and factors of regular graphs
Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4
An -coloring of an -regular graph is an edge coloring such that each vertex is incident to edges of one color and edge of a different color. In this paper…