On the public citation graph

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

0 signed · 74 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcom.1997.0439openalex-snapshot
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
inferredcites →https://doi.org/10.1006/jcss.2002.1824openalex-snapshot
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors
inferredcites →https://doi.org/10.1007/s00037-007-0223-zopenalex-snapshot
An Improved Analysis of Linear Mergers
inferredcites →https://doi.org/10.1007/s004930050049openalex-snapshot
Expanders That Beat the Eigenvalue Bound: Explicit Construction and Applications
inferredcites →https://doi.org/10.1090/s0894-0347-08-00607-3openalex-snapshot
On the size of Kakeya sets in finite fields
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/tit.2007.911222openalex-snapshot
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
inferredcites →https://doi.org/10.1137/s0097539703431032openalex-snapshot
Extracting Randomness via Repeated Condensing
inferredcites →https://doi.org/10.1145/1538902.1538904openalex-snapshot
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
inferredcites →https://doi.org/10.2140/apde.2008.1.375openalex-snapshot
Improved lower bound on the size of Kakeya sets over finite fields
inferredcites →https://doi.org/10.4086/toc.2007.v003a006openalex-snapshot

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_13openalex-snapshot
How to Extract Useful Randomness from Unreliable Sources
inferred← citeshttps://doi.org/10.1007/978-3-319-56620-7_14openalex-snapshot
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
inferred← citeshttps://doi.org/10.1007/s00037-018-0167-5openalex-snapshot
Algebraic independence over positive characteristic: New criterion and applications to locally low-algebraic-rank circuits
inferred← citeshttps://doi.org/10.1007/s00039-018-0455-xopenalex-snapshot
A discretized Severi-type theorem with applications to harmonic analysis
inferred← citeshttps://doi.org/10.1007/s00039-022-00597-5openalex-snapshot
Joints of Varieties
inferred← citeshttps://doi.org/10.1007/s00454-023-00585-yopenalex-snapshot
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof
inferred← citeshttps://doi.org/10.1007/s10998-018-0270-zopenalex-snapshot
On the arithmetic Kakeya conjecture of Katz and Tao
inferred← citeshttps://doi.org/10.1007/s11856-017-1586-8openalex-snapshot
Ranks of matrices with few distinct entries
inferred← citeshttps://doi.org/10.1007/s12220-023-01469-6openalex-snapshot
Multijoints and Factorisation
inferred← citeshttps://doi.org/10.1007/s40687-025-00594-8openalex-snapshot
A bound for plany Kakeya sets in $$\mathbb {F}_q^4$$ using the planebrush method
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102009openalex-snapshot
The constant of point–line incidence constructions
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113397openalex-snapshot
Covering almost all the layers of the hypercube with multiplicities
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.011openalex-snapshot
On the Alon-Füredi bound
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.06.001openalex-snapshot
Conical Kakeya and Nikodym sets in finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.101582openalex-snapshot
Probabilities of incidence between lines and a plane curve over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102624openalex-snapshot
BRK-type sets over finite fields
inferred← citeshttps://doi.org/10.1016/j.jsc.2018.08.005openalex-snapshot
Fast systematic encoding of multiplicity codes
inferred← citeshttps://doi.org/10.1017/cbo9781316257449openalex-snapshot
Finite Geometry and Combinatorial Applications
inferred← citeshttps://doi.org/10.1017/s0963548317000566openalex-snapshot
On Zeros of a Polynomial in a Finite Grid
inferred← citeshttps://doi.org/10.1017/s0963548318000342openalex-snapshot
Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives
inferred← citeshttps://doi.org/10.1080/00927872.2022.2081332openalex-snapshot
Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials
inferred← citeshttps://doi.org/10.1090/bull/1648openalex-snapshot
New applications of the polynomial method: The cap set conjecture and beyond
inferred← citeshttps://doi.org/10.1090/jams/984openalex-snapshot
New bounds on the density of lattice coverings
inferred← citeshttps://doi.org/10.1109/access.2020.3012006openalex-snapshot
A New Frontier for IoT Security Emerging From Three Decades of Key Generation Relying on Wireless Channels
inferred← citeshttps://doi.org/10.1109/focs.2015.35openalex-snapshot
Deterministic Divisibility Testing via Shifted Partial Derivatives
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00066openalex-snapshot
Improved Extractors for Small-Space Sources
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00067openalex-snapshot
Affine Extractors for Almost Logarithmic Entropy
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00047openalex-snapshot
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619274openalex-snapshot
Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653994openalex-snapshot
List Decoding of Hyperderivative Reed-Solomon Codes under NRT-metric
inferred← citeshttps://doi.org/10.1109/itw46852.2021.9457625openalex-snapshot
On Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2946896openalex-snapshot
An Entropy Lower Bound for Non-Malleable Extractors
inferred← citeshttps://doi.org/10.1109/tit.2021.3116520openalex-snapshot
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3131992openalex-snapshot
Efficient List-Decoding With Constant Alphabet and List Sizes
inferred← citeshttps://doi.org/10.1109/tit.2023.3306849openalex-snapshot
Decoding Multivariate Multiplicity Codes on Product Sets
inferred← citeshttps://doi.org/10.1109/tit.2025.3575899openalex-snapshot
Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List Decoding Capacity
inferred← citeshttps://doi.org/10.1109/tit.2025.3605160openalex-snapshot
Nearly-Linear Time Seeded Extractors With Short Seeds
inferred← citeshttps://doi.org/10.1112/jlms.12637openalex-snapshot
Polynomials that vanish to high order on most of the hypercube
inferred← citeshttps://doi.org/10.1112/mtk.12171openalex-snapshot
The Kakeya conjecture on local fields of positive characteristic
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch106openalex-snapshot
Algorithmizing the Multiplicity Schwartz-Zippel Lemma
inferred← citeshttps://doi.org/10.1137/17m1133245openalex-snapshot
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
inferred← citeshttps://doi.org/10.1137/19m1293788openalex-snapshot
The Spherical Kakeya Problem in Finite Fields
inferred← citeshttps://doi.org/10.1137/20m1370215openalex-snapshot
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
inferred← citeshttps://doi.org/10.1137/24m1662126openalex-snapshot
Point-Polynomial Incidences Theorem with an Application to Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1142/s0219498825410191openalex-snapshot
Reed–Muller codes in the sum-rank metric
inferred← citeshttps://doi.org/10.1145/3055399.3055423openalex-snapshot
An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
inferred← citeshttps://doi.org/10.1145/3061640.3061647openalex-snapshot
Open Problems Column
inferred← citeshttps://doi.org/10.1145/3173127.3173134openalex-snapshot
Open Problems Column
inferred← citeshttps://doi.org/10.1145/3406325.3451027openalex-snapshot
Decoding multivariate multiplicity codes on product sets
inferred← citeshttps://doi.org/10.1145/3406678.3406688openalex-snapshot
Guest Column
inferred← citeshttps://doi.org/10.1145/3519935.3519963openalex-snapshot
Extractors for sum of two sources
inferred← citeshttps://doi.org/10.1145/3596264openalex-snapshot
TouchKey
inferred← citeshttps://doi.org/10.1561/0400000108openalex-snapshot
Quantified Derandomization: How to Find Water in the Ocean
inferred← citeshttps://doi.org/10.19086/da.30707openalex-snapshot
Sharp density bounds on the finite field Kakeya problem
inferred← citeshttps://doi.org/10.3390/e24070880openalex-snapshot
Recent Advances in Randomness Extraction
inferred← citeshttps://doi.org/10.37236/11437openalex-snapshot
Gröbner Bases for Increasing Sequences
inferred← citeshttps://doi.org/10.4086/toc.2015.v011a005openalex-snapshot
inferred← citeshttps://doi.org/10.4171/icm2022/190openalex-snapshot
Interactions of computational complexity theory and mathematics
inferred← citeshttps://doi.org/10.48550/arxiv.1605.04194openalex-snapshot
Quantum-Proof Extractors: Optimal up to Constant Factors
inferred← citeshttps://doi.org/10.48550/arxiv.1909.03180openalex-snapshot
Simple proofs for Furstenberg sets over finite fields
inferred← citeshttps://doi.org/10.48550/arxiv.2003.05400openalex-snapshot
Beyond the Guruswami-Sudan (and Parvaresh-Vardy) Radii: Folded Reed-Solomon, Multiplicity and Derivative Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2111.05445openalex-snapshot
On Vanishing Properties of Polynomials on Symmetric Sets of the Boolean Cube, in Positive Characteristic
inferred← citeshttps://doi.org/10.5070/c61055361openalex-snapshot
Proof of the Kakeya set conjecture over rings of integers modulo square-free N
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.