Corners theorem

Corners theorem In arithmetic combinatorics, the corners theorem states that for every {displaystyle varepsilon >0} , for large enough {Anzeigestil N} , any set of at least {displaystyle varepsilon N^{2}} points in the {displaystyle Ntimes N} grid {Anzeigestil {1,Punkte ,N}^{2}} contains a corner, d.h., a triple of points of the form {Anzeigestil {(x,j),(x+h,j),(x,y+h)}} mit {displaystyle hneq 0} . It was first proved by Miklós Ajtai and Endre Szemerédi in 1974 using Szemerédi's theorem.[1] Im 2003, József Solymosi gave a short proof using the triangle removal lemma.[2] Inhalt 1 Aussage 2 Proof overview 3 Quantitative Grenzen 4 Multidimensional extension 4.1 Multidimensional Szemerédi's Theorem 5 Verweise 6 External links Statement Define a corner to be a subet of {Anzeigestil mathbb {Z} ^{2}} des Formulars {Anzeigestil {(x,j),(x+h,j),(x,y+h)}} , wo {Anzeigestil x,j,hin mathbb {Z} } und {displaystyle hneq 0} . Für jeden {displaystyle varepsilon >0} , es gibt eine positive ganze Zahl {Anzeigestil N(varepsilon )} such that for any {displaystyle Ngeq N(varepsilon )} , any subset {displaystyle Asubseteq {1,Punkte ,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 {Anzeigestil A} is dense, then it has some dense subset that is centrally symmetric.

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

Vermuten {displaystyle Asubset {1,Punkte ,N}^{2}} is corner-free. Construct an auxiliary tripartite graph {Anzeigestil G} with parts {Anzeigestil X={x_{1},Punkte ,x_{N}}} , {displaystyle Y={y_{1},Punkte ,y_{N}}} , und {displaystyle Z={z_{1},Punkte ,z_{2N}}} , wo {Anzeigestil x_{ich}} corresponds to the line {displaystyle x=i} , {Anzeigestil y_{j}} corresponds to the line {displaystyle y=j} , und {Anzeigestil z_{k}} corresponds to the line {displaystyle x+y=k} . Connect two vertices if the intersection of their corresponding lines lies in {Anzeigestil A} .

Note that a triangle in {Anzeigestil G} corresponds to a corner in {Anzeigestil A} , except in the trivial case where the lines corresponding to the vertices of the triangle concur at a point in {Anzeigestil A} . It follows that every edge of {Anzeigestil G} is in exactly one triangle, so by the triangle removal lemma, {Anzeigestil G} hat {Anzeigestil o(|v(G)|^{2})} Kanten, Also {Anzeigestil |EIN|=o(N^{2})} , wie gewünscht.

Quantitative bounds Let {Anzeigestil r_{angle }(N)} be the size of the largest subset of {Anzeigestil [N]^{2}} which contains no corner. The best known bounds are {Anzeigestil {frac {N^{2}}{2^{(c_{1}+Ö(1)){quadrat {Protokoll _{2}N}}}}}leq r_{angle }(N)leq {frac {N^{2}}{(Protokoll Protokoll N)^{c_{2}}}},} wo {Anzeigestil c_{1}ca 1.822} und {Anzeigestil c_{2}ca 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 {Anzeigestil mathbb {Z} ^{d}} is a set of points of the form {Anzeigestil {a}Tasse {a+he_{ich}:1leq ileq d}} , wo {displaystyle e_{1},Punkte ,e_{d}} is the standard basis of {Anzeigestil mathbb {R} ^{d}} , und {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, Rödl, 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} ^{d}} , and for every {displaystyle varepsilon >0} , es gibt eine positive ganze Zahl {Anzeigestil N(S,varepsilon )} such that for any {displaystyle Ngeq N(S,varepsilon )} , any subset {displaystyle Asubseteq {1,Punkte ,N}^{d}} with size at least {displaystyle varepsilon N^{d}} contains a subset of the form {displaystyle acdot S+h} . This theorem follows from the multidimensional corners theorem by a simple projection argument.[6] Im Speziellen, Roth's theorem follows directly from the ordinary corners theorem.

References ^ Ajtai, Miklós; Sie gehört dir, Veränderung (1974). "Sets of lattice points that form no squares". Stud. Wissenschaft. Mathematik. ungarisch. 9: 9–11. HERR 0369299.. ^ Solymosi, Joseph (2003). "Note on a generalization of Roth's theorem". In Aronov, Boris; Basu, Saugata; Der Geruch, John; et al. (Hrsg.). Discrete and computational geometry. Algorithms and Combinatorics. Vol. 25. Berlin: Springer-Verlag. pp. 825–827. doi:10.1007/978-3-642-55566-4_39. ISBN 3-540-00371-1. HERR 2038505. ^ Grün, 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. doi:10.19086/da.28933. S2CID 231740736. ^ Shkredov, I.D. (2006). "On a Generalization of Szemerédi's Theorem". Verfahren der London Mathematical Society. 93 (3): 723–760. arXiv:math/0503639. doi:10.1017/S0024611506015991. S2CID 55252774. ^ Nach oben springen: a b Gowers, Timotheus (2007). "Hypergraphenregularität und das mehrdimensionale Szemerédi-Theorem". Annalen der Mathematik. 166 (3): 897–946. arXiv:0710.3032. doi:10.4007/Annalen.2007.166.897. HERR 2373376. S2CID 56118006. ^ Rodl, v.; Nagle, B.; Jumper, J.; Schacht, M.; Kohayakawa, Y. (2005-05-26). "From The Cover: The hypergraph regularity method and its applications". Proceedings of the National Academy of Sciences. 102 (23): 8109–8113. Bibcode:2005PNAS..102.8109R. doi:10.1073/pnas.0502771102. ISSN 0027-8424. PMC 1149431. PMID 15919821. External links Proof of the corners theorem on polymath. Kategorien: 1974 introductions1974 in mathematicsRamsey theoryAdditive combinatoricsTheorems in combinatorics

Wenn Sie andere ähnliche Artikel wissen möchten Corners theorem Sie können die Kategorie besuchen 1974 in mathematics.

Hinterlasse eine Antwort

Deine Email-Adresse wird nicht veröffentlicht.

Geh hinauf

Wir verwenden eigene Cookies und Cookies von Drittanbietern, um die Benutzererfahrung zu verbessern Mehr Informationen