{"title":"所有 3 传递群都满足严格的厄尔多斯-柯-拉多性质","authors":"Venkata Raghu Tej Pantangi","doi":"10.1016/j.ejc.2024.104057","DOIUrl":null,"url":null,"abstract":"<div><p>A subset <span><math><mi>S</mi></math></span> of a transitive permutation group <span><math><mrow><mi>G</mi><mo>≤</mo><mi>Sym</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> is said to be an intersecting set if, for every <span><math><mrow><msub><mrow><mi>g</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>∈</mo><mi>S</mi></mrow></math></span>, there is an <span><math><mrow><mi>i</mi><mo>∈</mo><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow></math></span> such that <span><math><mrow><msub><mrow><mi>g</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>=</mo><msub><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msub><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></mrow></math></span>. The stabilizer of a point in <span><math><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></math></span> and its cosets are intersecting sets of size <span><math><mrow><mrow><mo>|</mo><mi>G</mi><mo>|</mo></mrow><mo>/</mo><mi>n</mi></mrow></math></span>. Such families are referred to as canonical intersecting sets. A result by Meagher, Spiga, and Tiep states that if <span><math><mi>G</mi></math></span> is a 2-transitive group, then <span><math><mrow><mrow><mo>|</mo><mi>G</mi><mo>|</mo></mrow><mo>/</mo><mi>n</mi></mrow></math></span> is the size of an intersecting set of maximum size in <span><math><mi>G</mi></math></span>. In some 2-transitive groups (for instance <span><math><mrow><mi>Sym</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>, <span><math><mrow><mi>Alt</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>), every intersecting set of maximum possible size is canonical. A permutation group, in which every intersecting family of maximum possible size is canonical, is said to satisfy the strict-EKR property. In this article, we investigate the structure of intersecting sets in 3-transitive groups. A conjecture by Meagher and Spiga states that all 3-transitive groups satisfy the strict-EKR property. Meagher and Spiga showed that this is true for the 3-transitive group <span><math><mrow><mi>PGL</mi><mrow><mo>(</mo><mn>2</mn><mo>,</mo><mi>q</mi><mo>)</mo></mrow></mrow></math></span>. Using the classification of 3-transitive groups and some results in the literature, the conjecture reduces to showing that the 3-transitive group <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> satisfies the strict-EKR property. We show that <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> satisfies the strict-EKR property and as a consequence, we prove Meagher and Spiga’s conjecture. We also prove a stronger result for <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> by showing that “large” intersecting sets in <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> must be a subset of a canonical intersecting set. This phenomenon is called stability.</p></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"All 3-transitive groups satisfy the strict-Erdős–Ko–Rado property\",\"authors\":\"Venkata Raghu Tej Pantangi\",\"doi\":\"10.1016/j.ejc.2024.104057\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A subset <span><math><mi>S</mi></math></span> of a transitive permutation group <span><math><mrow><mi>G</mi><mo>≤</mo><mi>Sym</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> is said to be an intersecting set if, for every <span><math><mrow><msub><mrow><mi>g</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>∈</mo><mi>S</mi></mrow></math></span>, there is an <span><math><mrow><mi>i</mi><mo>∈</mo><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mrow></math></span> such that <span><math><mrow><msub><mrow><mi>g</mi></mrow><mrow><mn>1</mn></mrow></msub><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow><mo>=</mo><msub><mrow><mi>g</mi></mrow><mrow><mn>2</mn></mrow></msub><mrow><mo>(</mo><mi>i</mi><mo>)</mo></mrow></mrow></math></span>. The stabilizer of a point in <span><math><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></math></span> and its cosets are intersecting sets of size <span><math><mrow><mrow><mo>|</mo><mi>G</mi><mo>|</mo></mrow><mo>/</mo><mi>n</mi></mrow></math></span>. Such families are referred to as canonical intersecting sets. A result by Meagher, Spiga, and Tiep states that if <span><math><mi>G</mi></math></span> is a 2-transitive group, then <span><math><mrow><mrow><mo>|</mo><mi>G</mi><mo>|</mo></mrow><mo>/</mo><mi>n</mi></mrow></math></span> is the size of an intersecting set of maximum size in <span><math><mi>G</mi></math></span>. In some 2-transitive groups (for instance <span><math><mrow><mi>Sym</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>, <span><math><mrow><mi>Alt</mi><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span>), every intersecting set of maximum possible size is canonical. A permutation group, in which every intersecting family of maximum possible size is canonical, is said to satisfy the strict-EKR property. In this article, we investigate the structure of intersecting sets in 3-transitive groups. A conjecture by Meagher and Spiga states that all 3-transitive groups satisfy the strict-EKR property. Meagher and Spiga showed that this is true for the 3-transitive group <span><math><mrow><mi>PGL</mi><mrow><mo>(</mo><mn>2</mn><mo>,</mo><mi>q</mi><mo>)</mo></mrow></mrow></math></span>. Using the classification of 3-transitive groups and some results in the literature, the conjecture reduces to showing that the 3-transitive group <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> satisfies the strict-EKR property. We show that <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> satisfies the strict-EKR property and as a consequence, we prove Meagher and Spiga’s conjecture. We also prove a stronger result for <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> by showing that “large” intersecting sets in <span><math><mrow><mi>AGL</mi><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mn>2</mn><mo>)</mo></mrow></mrow></math></span> must be a subset of a canonical intersecting set. This phenomenon is called stability.</p></div>\",\"PeriodicalId\":50490,\"journal\":{\"name\":\"European Journal of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0195669824001422\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001422","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
All 3-transitive groups satisfy the strict-Erdős–Ko–Rado property
A subset of a transitive permutation group is said to be an intersecting set if, for every , there is an such that . The stabilizer of a point in and its cosets are intersecting sets of size . Such families are referred to as canonical intersecting sets. A result by Meagher, Spiga, and Tiep states that if is a 2-transitive group, then is the size of an intersecting set of maximum size in . In some 2-transitive groups (for instance , ), every intersecting set of maximum possible size is canonical. A permutation group, in which every intersecting family of maximum possible size is canonical, is said to satisfy the strict-EKR property. In this article, we investigate the structure of intersecting sets in 3-transitive groups. A conjecture by Meagher and Spiga states that all 3-transitive groups satisfy the strict-EKR property. Meagher and Spiga showed that this is true for the 3-transitive group . Using the classification of 3-transitive groups and some results in the literature, the conjecture reduces to showing that the 3-transitive group satisfies the strict-EKR property. We show that satisfies the strict-EKR property and as a consequence, we prove Meagher and Spiga’s conjecture. We also prove a stronger result for by showing that “large” intersecting sets in must be a subset of a canonical intersecting set. This phenomenon is called stability.
期刊介绍:
The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.