{"title":"向量空间的几乎相交族","authors":"Yunjing Shan, Junling Zhou","doi":"10.1007/s00373-024-02790-9","DOIUrl":null,"url":null,"abstract":"<p>Let <i>V</i> be an <i>n</i>-dimensional vector space over the finite field <span>\\({\\mathbb {F}}_{q}\\)</span> and let <span>\\(\\left[ \\begin{array}{c} V \\\\ k \\end{array}\\right] _q\\)</span> denote the family of all <i>k</i>-dimensional subspaces of <i>V</i>. A family <span>\\({{\\mathcal {F}}}\\subseteq \\left[ \\begin{array}{c} V \\\\ k \\end{array}\\right] _q\\)</span> is called intersecting if for all <i>F</i>, <span>\\(F'\\in {{\\mathcal {F}}},\\)</span> we have <span>\\({\\textrm{dim}}(F\\cap F')\\ge 1.\\)</span> A family <span>\\({{\\mathcal {F}}}\\subseteq \\left[ \\begin{array}{c} V \\\\ k \\end{array}\\right] _q\\)</span> is called almost intersecting if for every <span>\\(F\\in {{\\mathcal {F}}}\\)</span> there is at most one element <span>\\(F'\\in {{\\mathcal {F}}}\\)</span> satisfying <span>\\({\\textrm{dim}}(F\\cap F')=0.\\)</span> In this paper we investigate almost intersecting families in the vector space <i>V</i>. Firstly, for large <i>n</i>, we determine the maximum size of an almost intersecting family in <span>\\(\\left[ \\begin{array}{c} V \\\\ k \\end{array}\\right] _q,\\)</span> which is the same as that of an intersecting family. Secondly, we characterize the structures of all maximum almost intersecting families under the condition that they are not intersecting.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"16 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Almost Intersecting Families for Vector Spaces\",\"authors\":\"Yunjing Shan, Junling Zhou\",\"doi\":\"10.1007/s00373-024-02790-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <i>V</i> be an <i>n</i>-dimensional vector space over the finite field <span>\\\\({\\\\mathbb {F}}_{q}\\\\)</span> and let <span>\\\\(\\\\left[ \\\\begin{array}{c} V \\\\\\\\ k \\\\end{array}\\\\right] _q\\\\)</span> denote the family of all <i>k</i>-dimensional subspaces of <i>V</i>. A family <span>\\\\({{\\\\mathcal {F}}}\\\\subseteq \\\\left[ \\\\begin{array}{c} V \\\\\\\\ k \\\\end{array}\\\\right] _q\\\\)</span> is called intersecting if for all <i>F</i>, <span>\\\\(F'\\\\in {{\\\\mathcal {F}}},\\\\)</span> we have <span>\\\\({\\\\textrm{dim}}(F\\\\cap F')\\\\ge 1.\\\\)</span> A family <span>\\\\({{\\\\mathcal {F}}}\\\\subseteq \\\\left[ \\\\begin{array}{c} V \\\\\\\\ k \\\\end{array}\\\\right] _q\\\\)</span> is called almost intersecting if for every <span>\\\\(F\\\\in {{\\\\mathcal {F}}}\\\\)</span> there is at most one element <span>\\\\(F'\\\\in {{\\\\mathcal {F}}}\\\\)</span> satisfying <span>\\\\({\\\\textrm{dim}}(F\\\\cap F')=0.\\\\)</span> In this paper we investigate almost intersecting families in the vector space <i>V</i>. Firstly, for large <i>n</i>, we determine the maximum size of an almost intersecting family in <span>\\\\(\\\\left[ \\\\begin{array}{c} V \\\\\\\\ k \\\\end{array}\\\\right] _q,\\\\)</span> which is the same as that of an intersecting family. Secondly, we characterize the structures of all maximum almost intersecting families under the condition that they are not intersecting.</p>\",\"PeriodicalId\":12811,\"journal\":{\"name\":\"Graphs and Combinatorics\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graphs and Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00373-024-02790-9\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02790-9","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
让 V 是有限域 \({\mathbb {F}}_{q}\) 上的 n 维向量空间,让 \(\left[ \begin{array}{c} V \ k \end{array}\right] _q\) 表示 V 的所有 k 维子空间的族。如果对于所有的 F, (F'\in {{\mathcal {F}}, \)我们有 ({\textrm{dim}}(F\cap F')\ge 1.\) ,那么这个族 ({{\mathcal {F}}} (subseteq \left[ \begin{array}{c} V \k \end{array}\right] _q\)就叫做相交族。)一个族({{\mathcal {F}}} subseteq \left[ \begin{array}{c} V \k \end{array}\right] _q\ )被称为几乎相交,如果对于({textrm{dim}}(Fcap F')=0.\)首先,对于大 n,我们确定了 \(\left[ \begin{array}{c} V \ k \end{array}\right] _q,\)中几乎相交族的最大大小,它与相交族的最大大小相同。其次,我们在不相交的条件下描述了所有最大几乎相交族的结构。
Let V be an n-dimensional vector space over the finite field \({\mathbb {F}}_{q}\) and let \(\left[ \begin{array}{c} V \\ k \end{array}\right] _q\) denote the family of all k-dimensional subspaces of V. A family \({{\mathcal {F}}}\subseteq \left[ \begin{array}{c} V \\ k \end{array}\right] _q\) is called intersecting if for all F, \(F'\in {{\mathcal {F}}},\) we have \({\textrm{dim}}(F\cap F')\ge 1.\) A family \({{\mathcal {F}}}\subseteq \left[ \begin{array}{c} V \\ k \end{array}\right] _q\) is called almost intersecting if for every \(F\in {{\mathcal {F}}}\) there is at most one element \(F'\in {{\mathcal {F}}}\) satisfying \({\textrm{dim}}(F\cap F')=0.\) In this paper we investigate almost intersecting families in the vector space V. Firstly, for large n, we determine the maximum size of an almost intersecting family in \(\left[ \begin{array}{c} V \\ k \end{array}\right] _q,\) which is the same as that of an intersecting family. Secondly, we characterize the structures of all maximum almost intersecting families under the condition that they are not intersecting.
期刊介绍:
Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.