Imagen de Portada

Multiplicative error set system sparsification: A simpler proof via chain length contraction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brakensiek, Joshua, Guruswami, Venkatesan, Putterman, Aaron
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Classification of Non-redundancy of Boolean Predicates of Arity 4
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Tight Bounds for Sparsifying Random CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Maximal Recoverability: A Nexus of Coding Theory
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Redundancy Is All You Need (for CSP Sparsification)
por: Brakensiek, Joshua, et al.
Publicado: (2024)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
por: Brakensiek, Joshua, et al.
Publicado: (2026)

The Richness of CSP Non-redundancy
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
por: Alrabiah, Omar, et al.
Publicado: (2024)

SDPs and Robust Satisfiability of Promise CSP
por: Brakensiek, Joshua, et al.
Publicado: (2022)

A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble
por: Guruswami, Venkatesan, et al.
Publicado: (2023)

Punctured Low-Bias Codes Behave Like Random Linear Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2021)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2026)

On infinite sets with no $3$ on a line
por: Putterman, Moe, et al.
Publicado: (2026)

Many Hamiltonians Are Sparsifiable
por: Basu, Arpon, et al.
Publicado: (2026)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Short proofs in combinatorics and number theory
por: Alexeev, Boris, et al.
Publicado: (2026)

Perfect matchings in random sparsifications of Dirac hypergraphs
por: Kang, Dong Yeap, et al.
Publicado: (2022)

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
por: Brakensiek, Joshua, et al.
Publicado: (2023)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
por: Brakensiek, Joshua, et al.
Publicado: (2022)

Short proofs in combinatorics, probability and number theory II
por: Alexeev, Boris, et al.
Publicado: (2026)

Single conflict coloring and palette sparsification of uniform hypergraphs
por: Casselgren, Carl Johan, et al.
Publicado: (2026)

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Kapranov degrees
por: Brakensiek, Joshua, et al.
Publicado: (2023)

Berge Hamilton cycles in a random sparsification of dense hypergraphs
por: Im, Seonghyuk, et al.
Publicado: (2025)

Threshold rates for properties of random codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

Matroid reinforcement and sparsification
por: Truong, Huy, et al.
Publicado: (2024)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
por: Alrabiah, Omar, et al.
Publicado: (2023)

Moonflowers and efficient code sparsification
por: Lovett, Shachar, et al.
Publicado: (2026)

A proof of the Erdős primitive set conjecture
por: Lichtman, Jared Duker
Publicado: (2022)

Restriction on minimum degree in the contractible sets problem
por: Karol, Nikolai
Publicado: (2022)

Big Ramsey combinatorics of the Cantor set and a simple proof of Blass' perfect set theorem
por: Mašulović, Dragan
Publicado: (2026)

On the existence of stable contract systems
por: Danilov, V. I.
Publicado: (2025)

Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths
por: Harutyunyan, Ararat, et al.
Publicado: (2026)

A categorical proof of the nonexistence of (120, 35, 10)-difference sets
por: Kajiura, Hiroki, et al.
Publicado: (2025)

A simple proof on the number of $(3 \times n)$-Latin rectangles based on a set of $λ$ elements
por: Thengarnanchai, Pantaree, et al.
Publicado: (2024)

Descent set distribution for permutations with cycles of only odd or only even lengths
por: Adin, Ron M., et al.
Publicado: (2025)

Stabbing non-piercing sets and face lengths in large girth plane graphs
por: Pálvölgyi, Dömötör, et al.
Publicado: (2025)

Cycle lengths in the percolated hypercube
por: Anastos, Michael, et al.
Publicado: (2025)

A combinatorial proof of Jacobi's elliptic identity via alternating permutations
por: Pain, Jean-christophe
Publicado: (2026)

Tight bounds for stream decodable error-correcting codes
por: Gupta, Meghal, et al.
Publicado: (2024)