Cover Image

Quasipolynomial bounds for the corners theorem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jaber, Michael, Liu, Yang P., Lovett, Shachar, Ostuni, Anthony, Sawhney, Mehtaab
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Computational Complexity Number Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Corners in Quasirandom Groups via Sparse Mixing
by: Jaber, Michael, et al.
Published: (2024)

Strong Bounds for Skew-Corner-Free Sets
by: Jaber, Michael, et al.
Published: (2024)

Quasipolynomial bounds on the inverse theorem for the Gowers $U^{s+1}[N]$-norm
by: Leng, James, et al.
Published: (2024)

Improved bounds for five-term arithmetic progressions
by: Leng, James, et al.
Published: (2023)

Bounds for monochromatic solutions to $\{x+y,xy\}$
by: Green, Ben, et al.
Published: (2025)

On polynomial progressions via transference
by: Altman, Daniel, et al.
Published: (2025)

Primes of the form $p^2 + nq^2$
by: Green, Ben, et al.
Published: (2024)

The proportion of permutations fixing a $k$-set
by: Green, Ben, et al.
Published: (2026)

The Log-Rank Conjecture: New Equivalent Formulations
by: Hambardzumyan, Lianna, et al.
Published: (2025)

Improved Bounds for Szemerédi's Theorem
by: Leng, James, et al.
Published: (2024)

New bounds for the Furstenberg-Sárközy theorem
by: Green, Ben, et al.
Published: (2024)

Refuting approaches to the log-rank conjecture for XOR functions
by: Hatami, Hamed, et al.
Published: (2023)

On the degree of polynomials computing square roots mod p
by: Kedlaya, Kiran, et al.
Published: (2023)

Quasipolynomial inverse theorem for the $\mathsf{U}^4(\mathbb{F}_p^n)$ norm
by: Milićević, Luka
Published: (2024)

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

Vinogradov's theorem for primes with restricted digits
by: Leng, James, et al.
Published: (2024)

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

Good bounds for sets lacking skew corners
by: Milićević, Luka
Published: (2024)

Improved bounds for skew corner-free sets
by: Beker, Adrian
Published: (2024)

On further questions regarding unit fractions
by: Liu, Yang P., et al.
Published: (2024)

Improved Parallel Repetition for GHZ-Supported Games via Spreadness
by: Liu, Yang P., et al.
Published: (2026)

An exposition of recent list-size bounds of FRS Codes
by: Garg, Abhibhav, et al.
Published: (2025)

A new kind of automorphic form and a proof of the essential transformation laws
by: Henry, Michael Andrew
Published: (2025)

Explicit separations between randomized and deterministic Number-on-Forehead communication
by: Kelley, Zander, et al.
Published: (2023)

New bounds for Szemeredi's theorem, II: A new bound for $r_4(N)$
by: Green, Ben, et al.
Published: (2006)

Quantitative bounds in a popular polynomial Szemerédi theorem
by: Shao, Xuancheng, et al.
Published: (2025)

Moduli of hybrid curves I: Variations of canonical measures
by: Amini, Omid, et al.
Published: (2020)

Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis
by: Chattopadhyay, Arkadev, et al.
Published: (2025)

A criterion for Andrásfai--Erdős--Sós type theorems and applications
by: Hou, Jianfeng, et al.
Published: (2024)

Mittag-Leffler type theorems for Helson zeta-functions
by: Andersson, Johan
Published: (2024)

Quantitative bounds in the inverse theorem for the Gowers $U^{s+1}$-norms over cyclic groups
by: Manners, Frederick
Published: (2018)

Indefiniteness makes lattice reduction easier
by: Joux, Antoine
Published: (2025)

NP-hardness of SVP in Euclidean Space
by: Wan, Daqing
Published: (2026)

On $q$-real and $q$-complex numbers
by: Etingof, Pavel
Published: (2025)

Non-Archimedean GUE corners and Hecke modules
by: Shen, Jiahe, et al.
Published: (2024)

HNN extensions of free groups with equal associated subgroups of finite index: polynomial time word problem
by: Shen, Hanwen, et al.
Published: (2025)

The edge of the asymptotic spectrum of tensors
by: Alman, Josh, et al.
Published: (2026)

LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)

All Kronecker coefficients are reduced Kronecker coefficients
by: Ikenmeyer, Christian, et al.
Published: (2023)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
by: Doron, Dean, et al.
Published: (2024)