{"title":"Stability of Erdős–Ko–Rado theorems in circle geometries","authors":"Sam Adriaensen","doi":"10.1002/jcd.21854","DOIUrl":null,"url":null,"abstract":"<p>Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in three-dimensional space. In a previous paper, the author characterised the largest intersecting families in finite ovoidal circle geometries, except for Möbius planes of odd order. In this paper we show that also in these Möbius planes, if the order is greater than 3, the largest intersecting families are the sets of circles through a fixed point. We show the same result in the only known family of finite nonovoidal circle geometries. Using the same techniques, we show a stability result on large intersecting families in all ovoidal circle geometries. More specifically, we prove that an intersecting family <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>ℱ</mi>\n </mrow>\n </mrow>\n <annotation> ${\\rm{ {\\mathcal F} }}$</annotation>\n </semantics></math> in one of the known finite circle geometries of order <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mi>q</mi>\n </mrow>\n </mrow>\n <annotation> $q$</annotation>\n </semantics></math>, with <math>\n <semantics>\n <mrow>\n \n <mrow>\n <mo>∣</mo>\n \n <mi>ℱ</mi>\n <mspace></mspace>\n \n <mo>∣</mo>\n \n <mo>≥</mo>\n \n <mfrac>\n <mn>1</mn>\n \n <msqrt>\n <mn>2</mn>\n </msqrt>\n </mfrac>\n \n <msup>\n <mi>q</mi>\n \n <mn>2</mn>\n </msup>\n \n <mo>+</mo>\n \n <mn>2</mn>\n \n <msqrt>\n <mn>2</mn>\n </msqrt>\n \n <mi>q</mi>\n \n <mo>+</mo>\n \n <mn>8</mn>\n </mrow>\n </mrow>\n <annotation> $| {\\rm{ {\\mathcal F} }}\\,| \\ge \\frac{1}{\\sqrt{2}}{q}^{2}+2\\sqrt{2}q+8$</annotation>\n </semantics></math>, must consist of circles through a common point, or through a common nucleus in case of a Laguerre plane of even order.</p>","PeriodicalId":15389,"journal":{"name":"Journal of Combinatorial Designs","volume":"30 11","pages":"689-715"},"PeriodicalIF":0.5000,"publicationDate":"2022-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Designs","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jcd.21854","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
Circle geometries are incidence structures that capture the geometry of circles on spheres, cones and hyperboloids in three-dimensional space. In a previous paper, the author characterised the largest intersecting families in finite ovoidal circle geometries, except for Möbius planes of odd order. In this paper we show that also in these Möbius planes, if the order is greater than 3, the largest intersecting families are the sets of circles through a fixed point. We show the same result in the only known family of finite nonovoidal circle geometries. Using the same techniques, we show a stability result on large intersecting families in all ovoidal circle geometries. More specifically, we prove that an intersecting family in one of the known finite circle geometries of order , with , must consist of circles through a common point, or through a common nucleus in case of a Laguerre plane of even order.
期刊介绍:
The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory, and in which design theory has important applications, are covered, including:
block designs, t-designs, pairwise balanced designs and group divisible designs
Latin squares, quasigroups, and related algebras
computational methods in design theory
construction methods
applications in computer science, experimental design theory, and coding theory
graph decompositions, factorizations, and design-theoretic techniques in graph theory and extremal combinatorics
finite geometry and its relation with design theory.
algebraic aspects of design theory.
Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field, and to provide a forum for both theoretical research and applications. All papers appearing in the Journal of Combinatorial Designs are carefully peer refereed.