Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
From MaRDI portal
Publication:5408768
DOI10.1137/100783704zbMath1285.68116OpenAlexW2150616341MaRDI QIDQ5408768
Swastik Kopparty, Madhu Sudan, Zeev Dvir, Shubhangi Saraf
Publication date: 11 April 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/59284
Combinatorics in computer science (68R05) Finite geometry and special incidence structures (51E99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (33)
Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials ⋮ Joints of varieties ⋮ Proof of the Kakeya set conjecture over rings of integers modulo square-free N ⋮ Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Covering almost all the layers of the hypercube with multiplicities ⋮ Ranks of matrices with few distinct entries ⋮ The Kakeya conjecture on local fields of positive characteristic ⋮ Fast systematic encoding of multiplicity codes ⋮ The constant of point-line incidence constructions ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Polynomials that vanish to high order on most of the hypercube ⋮ Multijoints and factorisation ⋮ Joints tightened ⋮ Sharp density bounds on the finite field Kakeya problem ⋮ Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof ⋮ Interactions of computational complexity theory and mathematics ⋮ The Spherical Kakeya Problem in Finite Fields ⋮ On Zeros of a Polynomial in a Finite Grid ⋮ On the Alon-Füredi bound ⋮ Extractor Lower Bounds, Revisited ⋮ New bounds on the density of lattice coverings ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ Unnamed Item ⋮ Probabilities of incidence between lines and a plane curve over finite fields ⋮ Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives ⋮ Joints formed by lines and a $k$-plane, and a discrete estimate of Kakeya type ⋮ How to extract useful randomness from unreliable sources ⋮ A discretized Severi-type theorem with applications to harmonic analysis ⋮ Conical Kakeya and Nikodym sets in finite fields ⋮ Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019
This page was built for publication: Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
