Pages that link to "Item:Q5408768"

The following pages link to Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers (Q5408768):

Displaying 36 items.

• On the Alon-Füredi bound (Q510534) (← links)
• Contemporary coding theory. Abstracts from the workshop held March 17--23, 2019 (Q782984) (← links)
• Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
• Ranks of matrices with few distinct entries (Q1686308) (← links)
• How to extract useful randomness from unreliable sources (Q2055615) (← links)
• Joints of varieties (Q2127884) (← links)
• Probabilities of incidence between lines and a plane curve over finite fields (Q2291355) (← links)
• A discretized Severi-type theorem with applications to harmonic analysis (Q2324619) (← links)
• Conical Kakeya and Nikodym sets in finite fields (Q2326692) (← links)
• Fast systematic encoding of multiplicity codes (Q2422714) (← links)
• New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
• On Zeros of a Polynomial in a Finite Grid (Q4635504) (← links)
• Sharp density bounds on the finite field Kakeya problem (Q5028492) (← links)
• Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials (Q5038094) (← links)
• Proof of the Kakeya set conjecture over rings of integers modulo square-free N (Q5048441) (← links)
• Quantified Derandomization: How to Find Water in the Ocean (Q5060673) (← links)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
• (Q5092448) (← links)
• The Spherical Kakeya Problem in Finite Fields (Q5139665) (← links)
• Joints formed by lines and a $k$-plane, and a discrete estimate of Kakeya type (Q5144434) (← links)
• New bounds on the density of lattice coverings (Q5163491) (← links)
• Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives (Q5219319) (← links)
• Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
• Covering almost all the layers of the hypercube with multiplicities (Q6041856) (← links)
• The Kakeya conjecture on local fields of positive characteristic (Q6075449) (← links)
• Extractor Lower Bounds, Revisited (Q6084344) (← links)
• The constant of point-line incidence constructions (Q6110067) (← links)
• Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes (Q6110528) (← links)
• Polynomials that vanish to high order on most of the hypercube (Q6134539) (← links)
• Multijoints and factorisation (Q6154393) (← links)
• Joints tightened (Q6159562) (← links)
• Furstenberg sets in finite fields: explaining and improving the Ellenberg-Erman proof (Q6191438) (← links)
• Interactions of computational complexity theory and mathematics (Q6198725) (← links)
• Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds (Q6566468) (← links)
• Gröbner bases for increasing sequences (Q6574394) (← links)
• The resultant method in higher dimensions (Q6615550) (← links)