{"title":"少三角形集合的一个结构定理","authors":"Sam Mansfield, Jonathan Passant","doi":"10.1007/s00493-023-00066-z","DOIUrl":null,"url":null,"abstract":"<p>We show that if a finite point set <span>\\(P\\subseteq {\\mathbb {R}}^2\\)</span> has the fewest congruence classes of triangles possible, up to a constant <i>M</i>, then at least one of the following holds.</p><ul>\n<li>\n<p>There is a <span>\\(\\sigma >0\\)</span> and a line <i>l</i> which contains <span>\\(\\Omega (|P|^\\sigma )\\)</span> points of <i>P</i>. Further, a positive proportion of <i>P</i> is covered by lines parallel to <i>l</i> each containing <span>\\(\\Omega (|P|^\\sigma )\\)</span> points of <i>P</i>.</p>\n</li>\n<li>\n<p>There is a circle <span>\\(\\gamma \\)</span> which contains a positive proportion of <i>P</i>.</p>\n</li>\n</ul><p> This provides evidence for two conjectures of Erdős. We use the result of Petridis–Roche–Newton–Rudnev–Warren on the structure of the affine group combined with classical results from additive combinatorics.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":"11 18","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Structural Theorem for Sets with Few Triangles\",\"authors\":\"Sam Mansfield, Jonathan Passant\",\"doi\":\"10.1007/s00493-023-00066-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We show that if a finite point set <span>\\\\(P\\\\subseteq {\\\\mathbb {R}}^2\\\\)</span> has the fewest congruence classes of triangles possible, up to a constant <i>M</i>, then at least one of the following holds.</p><ul>\\n<li>\\n<p>There is a <span>\\\\(\\\\sigma >0\\\\)</span> and a line <i>l</i> which contains <span>\\\\(\\\\Omega (|P|^\\\\sigma )\\\\)</span> points of <i>P</i>. Further, a positive proportion of <i>P</i> is covered by lines parallel to <i>l</i> each containing <span>\\\\(\\\\Omega (|P|^\\\\sigma )\\\\)</span> points of <i>P</i>.</p>\\n</li>\\n<li>\\n<p>There is a circle <span>\\\\(\\\\gamma \\\\)</span> which contains a positive proportion of <i>P</i>.</p>\\n</li>\\n</ul><p> This provides evidence for two conjectures of Erdős. We use the result of Petridis–Roche–Newton–Rudnev–Warren on the structure of the affine group combined with classical results from additive combinatorics.</p>\",\"PeriodicalId\":50666,\"journal\":{\"name\":\"Combinatorica\",\"volume\":\"11 18\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2023-10-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00493-023-00066-z\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00066-z","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
We show that if a finite point set \(P\subseteq {\mathbb {R}}^2\) has the fewest congruence classes of triangles possible, up to a constant M, then at least one of the following holds.
There is a \(\sigma >0\) and a line l which contains \(\Omega (|P|^\sigma )\) points of P. Further, a positive proportion of P is covered by lines parallel to l each containing \(\Omega (|P|^\sigma )\) points of P.
There is a circle \(\gamma \) which contains a positive proportion of P.
This provides evidence for two conjectures of Erdős. We use the result of Petridis–Roche–Newton–Rudnev–Warren on the structure of the affine group combined with classical results from additive combinatorics.
期刊介绍:
COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are
- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).
- Combinatorial optimization.
- Combinatorial aspects of geometry and number theory.
- Algorithms in combinatorics and related fields.
- Computational complexity theory.
- Randomization and explicit construction in combinatorics and algorithms.