Corners theorem

Corners theorem In arithmetic combinatorics, the corners theorem states that for every {displaystyle varepsilon >0} , for large enough {displaystyle N} , any set of at least {displaystyle varepsilon N^{2}} points in the {displaystyle Ntimes N} grid {style d'affichage {1,ldots ,N}^{2}} contains a corner, c'est à dire., a triple of points of the form {style d'affichage {(X,y),(x+h,y),(X,y+h)}} avec {displaystyle hneq 0} . It was first proved by Miklós Ajtai and Endre Szemerédi in 1974 using Szemerédi's theorem.[1] Dans 2003, József Solymosi gave a short proof using the triangle removal lemma.[2] Contenu 1 Déclaration 2 Proof overview 3 Limites quantitatives 4 Multidimensional extension 4.1 Multidimensional Szemerédi's Theorem 5 Références 6 External links Statement Define a corner to be a subet of {style d'affichage mathbb {Z} ^{2}} of the form {style d'affichage {(X,y),(x+h,y),(X,y+h)}} , où {style d'affichage x,y,hin mathbb {Z} } et {displaystyle hneq 0} . Pour chaque {displaystyle varepsilon >0} , il existe un entier positif {displaystyle N(varepsilon )} such that for any {displaystyle Ngeq N(varepsilon )} , any subset {displaystyle Asubseteq {1,ldots ,N}^{2}} with size at least {displaystyle varepsilon N^{2}} contains a corner.

The condition {displaystyle hneq 0} can be relaxed to {displaystyle h>0} by showing that if {style d'affichage A} is dense, then it has some dense subset that is centrally symmetric.

Proof overview What follows is a sketch of Solymosi's argument.

Supposer {displaystyle Asubset {1,ldots ,N}^{2}} is corner-free. Construct an auxiliary tripartite graph {style d'affichage G} with parts {style d'affichage X={X_{1},ldots ,X_{N}}} , {displaystyle Y={y_{1},ldots ,y_{N}}} , et {displaystyle Z={z_{1},ldots ,z_{2N}}} , où {style d'affichage x_{je}} corresponds to the line {displaystyle x=i} , {style d'affichage y_{j}} corresponds to the line {displaystyle y=j} , et {style d'affichage z_{k}} corresponds to the line {displaystyle x+y=k} . Connect two vertices if the intersection of their corresponding lines lies in {style d'affichage A} .

Note that a triangle in {style d'affichage G} corresponds to a corner in {style d'affichage A} , except in the trivial case where the lines corresponding to the vertices of the triangle concur at a point in {style d'affichage A} . It follows that every edge of {style d'affichage G} is in exactly one triangle, so by the triangle removal lemma, {style d'affichage G} a {style d'affichage o(|V(g)|^{2})} bords, alors {style d'affichage |UN|=o(N^{2})} , comme voulu.

Quantitative bounds Let {style d'affichage r_{angle }(N)} be the size of the largest subset of {style d'affichage [N]^{2}} which contains no corner. The best known bounds are {style d'affichage {frac {N^{2}}{2^{(c_{1}+o(1)){sqrt {Journal _{2}N}}}}}leq r_{angle }(N)leq {frac {N^{2}}{(journal journal N)^{c_{2}}}},} où {displaystyle c_{1}environ 1.822} et {displaystyle c_{2}environ 0.0137} . The lower bound is due to Green,[3] building on the work of Linial and Shraibman.[4] The upper bound is due to Shkredov.[5] Multidimensional extension A corner in {style d'affichage mathbb {Z} ^{ré}} is a set of points of the form {style d'affichage {un}Coupe {a+he_{je}:1leq ileq d}} , où {displaystyle e_{1},ldots ,e_{ré}} is the standard basis of {style d'affichage mathbb {R} ^{ré}} , et {displaystyle hneq 0} . The natural extension of the corners theorem to this setting can be shown using the hypergraph removal lemma, in the spirit of Solymosi's proof. The hypergraph removal lemma was shown independently by Gowers[6] and Nagle, Rodl, Schacht and Skokan.[7] Multidimensional Szemerédi's Theorem The multidimensional Szemerédi theorem states that for any fixed finite subset {displaystyle Ssubseteq mathbb {Z} ^{ré}} , and for every {displaystyle varepsilon >0} , il existe un entier positif {displaystyle N(S,varepsilon )} such that for any {displaystyle Ngeq N(S,varepsilon )} , any subset {displaystyle Asubseteq {1,ldots ,N}^{ré}} with size at least {displaystyle varepsilon N^{ré}} contains a subset of the form {displaystyle acdot S+h} . This theorem follows from the multidimensional corners theorem by a simple projection argument.[6] En particulier, Roth's theorem follows directly from the ordinary corners theorem.

References ^ Ajtai, Miklós; Elle t'appartient, Changer (1974). "Sets of lattice points that form no squares". Stud. SCI. Math. hongrois. 9: 9–11. M 0369299.. ^ Solymosis, Joseph (2003). "Note on a generalization of Roth's theorem". In Aronov, Boris; Basu, Saugata; L'odeur, John; et al. (éd.). Discrete and computational geometry. Algorithms and Combinatorics. Volume. 25. Berlin: Springer Verlag. pp. 825–827. est ce que je:10.1007/978-3-642-55566-4_39. ISBN 3-540-00371-1. M 2038505. ^ Vert, Ben (2021). "Lower Bounds for Corner-Free Sets". arXiv:0710.3032 [math.CO]. ^ Linial, Nati; Shraibman, Adi (2021). "Larger Corner-Free Sets from Better NOF Exactly-N Protocols". Discrete Analysis. 2021. arXiv:2102.00421. est ce que je:10.19086/da.28933. S2CID 231740736. ^ Shkredov, I.D. (2006). "On a Generalization of Szemerédi's Theorem". Actes de la London Mathematical Society. 93 (3): 723–760. arXiv:math/0503639. est ce que je:10.1017/S0024611506015991. S2CID 55252774. ^ Sauter à: a b Gowers, Timothée (2007). "Régularité hypergraphique et théorème de Szemerédi multidimensionnel". Annales de Mathématiques. 166 (3): 897–946. arXiv:0710.3032. est ce que je:10.4007/annales.2007.166.897. M 2373376. S2CID 56118006. ^ Rodl, V; Nagle, B; Sauteur, J; Schacht, M; Kohayakawa, Oui. (2005-05-26). "From The Cover: The hypergraph regularity method and its applications". Actes de l'Académie nationale des sciences. 102 (23): 8109–8113. Code bib:2005PNAS..102.8109R. est ce que je:10.1073/pnas.0502771102. ISSN 0027-8424. PMC 1149431. PMID 15919821. External links Proof of the corners theorem on polymath. Catégories: 1974 introductions1974 in mathematicsRamsey theoryAdditive combinatoricsTheorems in combinatorics

Si vous voulez connaître d'autres articles similaires à Corners theorem vous pouvez visiter la catégorie 1974 in mathematics.

Monter

Nous utilisons nos propres cookies et ceux de tiers pour améliorer l'expérience utilisateur Plus d'informations