4 citations · 9 across the 4 of their papers we have counts for
4 papers
Discretised sum-product theorems by Shannon-type inequalities
András Máthé, William O'Regan
By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if is a $(…
Equivalences between different forms of the Kakeya conjecture and duality of Hausdorff and packing dimensions for additive complements
Tamás Keleti, András Máthé
The Kakeya conjecture is generally formulated as one the following statements: every compact/Borel/arbitrary subset of that contains a (unit) line segment in every…
Moser-Tardos Algorithm with small number of random bits
Endre Csóka, Łukasz Grabowski, András Máthé +2
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…
Circle Squaring with Pieces of Small Boundary and Low Borel Complexity
András Máthé, Jonathan A. Noel, Oleg Pikhurko
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a part…