首页 > 最新文献

Journal of Combinatorial Theory Series A最新文献

英文 中文
Distribution of maxima and minima statistics on alternating permutations, Springer numbers, and avoidance of flat POPs 关于交替排列、施普林格数字和避免扁平持久性有机污染物的最大值和最小值统计的分布
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-28 DOI: 10.1016/j.jcta.2025.106034
Tian Han , Sergey Kitaev , Philip B. Zhang
In this paper, we find distributions of the left-to-right maxima, right-to-left maxima, left-to-right minima and right-to-left-minima statistics on up-down and down-up permutations of even and odd lengths. We recover and generalize a result by Carlitz and Scoville, obtained in 1975, stating that the distribution of left-to-right maxima on down-up permutations of even length is given by (sec(t))q. We also derive the joint distribution of the maxima (resp., minima) statistics, extending the scope of the respective results of Carlitz and Scoville, who obtain them in terms of certain systems of PDEs and recurrence relations. To accomplish this, we generalize a result of Kitaev and Remmel by deriving joint distributions involving non-maxima (resp., non-minima) statistics. Consequently, we refine classic enumeration results of André by introducing new q-analogues and (p,q)-analogues for the number of alternating permutations.
Additionally, we verify Callan's conjecture (2012) that up-down permutations of even length fixed by reverse and complement are counted by the Springer numbers, thereby offering another combinatorial interpretation of these numbers. Furthermore, we propose two q-analogues and a (p,q)-analogue of the Springer numbers. Lastly, we enumerate alternating permutations that avoid certain flat partially ordered patterns.
本文研究了奇偶长度上下置换的从左到右极大值、从右到左极大值、从左到右极小值和从右到左极小值统计量的分布。我们恢复并推广了Carlitz和Scoville在1975年得到的一个结果,即偶数长度的上下排列的从左到右极大值的分布由(sec (t)))q给出。我们还推导出了极大值的联合分布。(极小值)统计量,扩展了Carlitz和Scoville各自结果的范围,他们根据偏微分方程和递推关系的某些系统获得了这些结果。为了实现这一点,我们通过推导涉及非极大值的联合分布来推广Kitaev和Remmel的结果。(非最小值)统计。因此,我们通过引入新的q-类似物和(p,q)-类似物来改进andr的经典枚举结果。此外,我们验证了Callan的猜想(2012),即由逆和补固定的偶数长度的上下排列由施普林格数计算,从而提供了这些数的另一种组合解释。此外,我们提出了施普林格数的两个q类似物和一个(p,q)-类似物。最后,我们列举了避免某些平坦部分有序模式的交替排列。
{"title":"Distribution of maxima and minima statistics on alternating permutations, Springer numbers, and avoidance of flat POPs","authors":"Tian Han ,&nbsp;Sergey Kitaev ,&nbsp;Philip B. Zhang","doi":"10.1016/j.jcta.2025.106034","DOIUrl":"10.1016/j.jcta.2025.106034","url":null,"abstract":"<div><div>In this paper, we find distributions of the left-to-right maxima, right-to-left maxima, left-to-right minima and right-to-left-minima statistics on up-down and down-up permutations of even and odd lengths. We recover and generalize a result by Carlitz and Scoville, obtained in 1975, stating that the distribution of left-to-right maxima on down-up permutations of even length is given by <span><math><msup><mrow><mo>(</mo><mi>sec</mi><mo>⁡</mo><mo>(</mo><mi>t</mi><mo>)</mo><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msup></math></span>. We also derive the joint distribution of the maxima (resp., minima) statistics, extending the scope of the respective results of Carlitz and Scoville, who obtain them in terms of certain systems of PDEs and recurrence relations. To accomplish this, we generalize a result of Kitaev and Remmel by deriving joint distributions involving non-maxima (resp., non-minima) statistics. Consequently, we refine classic enumeration results of André by introducing new <em>q</em>-analogues and <span><math><mo>(</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>)</mo></math></span>-analogues for the number of alternating permutations.</div><div>Additionally, we verify Callan's conjecture (2012) that up-down permutations of even length fixed by reverse and complement are counted by the Springer numbers, thereby offering another combinatorial interpretation of these numbers. Furthermore, we propose two <em>q</em>-analogues and a <span><math><mo>(</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>)</mo></math></span>-analogue of the Springer numbers. Lastly, we enumerate alternating permutations that avoid certain flat partially ordered patterns.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106034"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143511458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
More on r-cross t-intersecting families for vector spaces 更多关于向量空间的r- x - t相交族
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-26 DOI: 10.1016/j.jcta.2025.106031
Tian Yao , Dehai Liu , Kaishun Wang
Let V be a finite dimensional vector space over a finite field. Suppose that F1, F2, …, Fr are r-cross t-intersecting families of k-subspaces of V. In this paper, we determine the extremal structure when i=1r|Fi| is maximum under the condition that dim(FFiF)<t for each i.
设V是有限维向量空间在有限域上。设F1, F2,…,Fr是v的k个子空间的r-交叉t-相交族。本文在每个i取dim (F∈FiF)<;t的条件下,确定了∏i=1r|Fi|最大时的极值结构。
{"title":"More on r-cross t-intersecting families for vector spaces","authors":"Tian Yao ,&nbsp;Dehai Liu ,&nbsp;Kaishun Wang","doi":"10.1016/j.jcta.2025.106031","DOIUrl":"10.1016/j.jcta.2025.106031","url":null,"abstract":"<div><div>Let <em>V</em> be a finite dimensional vector space over a finite field. Suppose that <span><math><msub><mrow><mi>F</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>, <span><math><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>, …, <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>r</mi></mrow></msub></math></span> are <em>r</em>-cross <em>t</em>-intersecting families of <em>k</em>-subspaces of <em>V</em>. In this paper, we determine the extremal structure when <span><math><msubsup><mrow><mo>∏</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mrow><mi>r</mi></mrow></msubsup><mo>|</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo></math></span> is maximum under the condition that <span><math><mi>dim</mi><mo>⁡</mo><mo>(</mo><msub><mrow><mo>⋂</mo></mrow><mrow><mi>F</mi><mo>∈</mo><msub><mrow><mi>F</mi></mrow><mrow><mi>i</mi></mrow></msub></mrow></msub><mi>F</mi><mo>)</mo><mo>&lt;</mo><mi>t</mi></math></span> for each <em>i</em>.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106031"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143510698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unique representations of integers by linear forms 用线性形式表示整数的唯一形式
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-01-17 DOI: 10.1016/j.jcta.2025.106007
Sándor Z. Kiss , Csaba Sándor
Let k2 be an integer and let A be a set of nonnegative integers. For a k-tuple of positive integers λ_=(λ1,,λk) with 1λ1<λ2<<λk, we define the additive representation function RA,λ_(n)=|{(a1,,ak)Ak:λ1a1++λkak=n}|. For k=2, Moser constructed a set A of nonnegative integers such that RA,λ_(n)=1 holds for every nonnegative integer n. In this paper we characterize all the k-tuples λ_ and the sets A of nonnegative integers with RA,λ_(n)=1 for every integer n0.
设k≥2为整数,设A为一组非负整数。正整数的k-tupleλ_ =(λ1,…,λk) 1≤λ1 & lt;λ2 & lt;⋯& lt;λk,我们定义添加剂表示函数RA,λ_ (n) = | {(a1,…,正义与发展党)∈ak:λ1 a1 +⋯+λ谷湖= n} |。对于k=2, Moser构造了一个非负整数集合a,使得RA,λ_(n)=1对每一个非负整数n都成立。本文刻画了所有k元组λ_和RA,λ_(n)=1对每一个整数n≥0的非负整数集合a。
{"title":"Unique representations of integers by linear forms","authors":"Sándor Z. Kiss ,&nbsp;Csaba Sándor","doi":"10.1016/j.jcta.2025.106007","DOIUrl":"10.1016/j.jcta.2025.106007","url":null,"abstract":"<div><div>Let <span><math><mi>k</mi><mo>≥</mo><mn>2</mn></math></span> be an integer and let <em>A</em> be a set of nonnegative integers. For a <em>k</em>-tuple of positive integers <span><math><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder><mo>=</mo><mo>(</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>λ</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo></math></span> with <span><math><mn>1</mn><mo>≤</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>&lt;</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>&lt;</mo><mo>⋯</mo><mo>&lt;</mo><msub><mrow><mi>λ</mi></mrow><mrow><mi>k</mi></mrow></msub></math></span>, we define the additive representation function <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>A</mi><mo>,</mo><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mo>|</mo><mo>{</mo><mo>(</mo><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mrow><mi>a</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>)</mo><mo>∈</mo><msup><mrow><mi>A</mi></mrow><mrow><mi>k</mi></mrow></msup><mo>:</mo><msub><mrow><mi>λ</mi></mrow><mrow><mn>1</mn></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mrow><mi>λ</mi></mrow><mrow><mi>k</mi></mrow></msub><msub><mrow><mi>a</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>=</mo><mi>n</mi><mo>}</mo><mo>|</mo></math></span>. For <span><math><mi>k</mi><mo>=</mo><mn>2</mn></math></span>, Moser constructed a set <em>A</em> of nonnegative integers such that <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>A</mi><mo>,</mo><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span> holds for every nonnegative integer <em>n</em>. In this paper we characterize all the <em>k</em>-tuples <span><math><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></math></span> and the sets <em>A</em> of nonnegative integers with <span><math><msub><mrow><mi>R</mi></mrow><mrow><mi>A</mi><mo>,</mo><munder><mrow><mi>λ</mi></mrow><mo>_</mo></munder></mrow></msub><mo>(</mo><mi>n</mi><mo>)</mo><mo>=</mo><mn>1</mn></math></span> for every integer <span><math><mi>n</mi><mo>≥</mo><mn>0</mn></math></span>.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106007"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143099170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multivariate P- and/or Q-polynomial association schemes 多元P-和/或q -多项式关联方案
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-27 DOI: 10.1016/j.jcta.2025.106025
Eiichi Bannai , Hirotake Kurihara , Da Zhao , Yan Zhu
The classification problem of P- and Q-polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of P- and Q-polynomial association schemes to multivariate cases, namely to consider higher rank P- and Q-polynomial association schemes, has been tried by some authors, but it seems that so far there were neither very well-established definitions nor results. Very recently, Bernard, Crampé, d'Andecy, Vinet, and Zaimi [4], defined bivariate P-polynomial association schemes, as well as bivariate Q-polynomial association schemes. In this paper, we study these concepts and propose a new modified definition concerning a general monomial order, which is more general and more natural and also easy to handle. We prove that there are many interesting families of examples of multivariate P- and/or Q-polynomial association schemes.
P-和q -多项式关联方案的分类问题一直是代数组合学中的核心问题之一。一些作者已经尝试将P-和q -多项式关联方案的概念推广到多元情况,即考虑更高阶的P-和q -多项式关联方案,但迄今为止似乎既没有非常完善的定义也没有结果。最近,Bernard, crampaud, d'Andecy, Vinet, and Zaimi[4],定义了二元p -多项式关联格式,以及二元q -多项式关联格式。本文对这些概念进行了研究,提出了一个更一般、更自然、更易于处理的关于一般单阶的新的修正定义。我们证明了有许多有趣的多元P-和/或q -多项式关联方案的例子族。
{"title":"Multivariate P- and/or Q-polynomial association schemes","authors":"Eiichi Bannai ,&nbsp;Hirotake Kurihara ,&nbsp;Da Zhao ,&nbsp;Yan Zhu","doi":"10.1016/j.jcta.2025.106025","DOIUrl":"10.1016/j.jcta.2025.106025","url":null,"abstract":"<div><div>The classification problem of <em>P</em>- and <em>Q</em>-polynomial association schemes has been one of the central problems in algebraic combinatorics. Generalizing the concept of <em>P</em>- and <em>Q</em>-polynomial association schemes to multivariate cases, namely to consider higher rank <em>P</em>- and <em>Q</em>-polynomial association schemes, has been tried by some authors, but it seems that so far there were neither very well-established definitions nor results. Very recently, Bernard, Crampé, d'Andecy, Vinet, and Zaimi <span><span>[4]</span></span>, defined bivariate <em>P</em>-polynomial association schemes, as well as bivariate <em>Q</em>-polynomial association schemes. In this paper, we study these concepts and propose a new modified definition concerning a general monomial order, which is more general and more natural and also easy to handle. We prove that there are many interesting families of examples of multivariate <em>P</em>- and/or <em>Q</em>-polynomial association schemes.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106025"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143510697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Truncated forms of MacMahon's q-series MacMahon q级数的截短形式
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106020
Mircea Merca
<div><div>In 1920, Percy Alexander MacMahon defined the partition generating functions<span><span><span><math><mrow><msub><mrow><mi>A</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></mrow></math></span></span></span> and<span><span><span><math><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>)</mo><mo>:</mo><mo>=</mo><munder><mo>∑</mo><mrow><mn>0</mn><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo><</mo><mo>⋯</mo><mo><</mo><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow></munder><mfrac><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>+</mo><mo>⋯</mo><mo>+</mo><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mi>k</mi></mrow></msup></mrow><mrow><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>⋯</mo><msup><mrow><mo>(</mo><mn>1</mn><mo>−</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn><msub><mrow><mi>n</mi></mrow><mrow><mi>k</mi></mrow></msub><mo>−</mo><mn>1</mn></mrow></msup><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup></mrow></mfrac></math></span></span></span> which have since played an important rol
1920 年,珀西-亚历山大-麦克马洪定义了分区生成函数 Ak(q):=∑0<n1<n2<⋯<nkqn1+n2+⋯+nk(1-qn1)2(1-qn2)2⋯(1-qnk)2 和 Ck(q):=∑0<n1<n2<⋯<nkq2n1+2n2+⋯+2nk-k(1-q2n1-1)2(1-q2n2-1)2⋯(1-q2nk-1)2,它们在组合数学中发挥了重要作用。对于每一个非负整数 k,乔治-安德鲁斯(George E. Andrews)和西蒙-罗斯(Simon C. F. Rose)证明了 Ak(q)可以用分区的生成函数来表示,其中每一部分可以用三种不同颜色中的一种来着色,而 Ck(q)可以用过分区的生成函数来表示。最近,对于每个非负整数 k,Ken Ono 和 Ajit Singh 证明了 Ak(q)、Ak+1(q)、Ak+2(q)......给出了每个部分可以用三种不同颜色中的一种着色的 n 的分区数的生成函数,而 Ck(q)、Ck+1(q)、Ck+2(q)......给出了 n 的过度分区数的生成函数。本文还介绍了一些悬而未决的问题。
{"title":"Truncated forms of MacMahon's q-series","authors":"Mircea Merca","doi":"10.1016/j.jcta.2025.106020","DOIUrl":"10.1016/j.jcta.2025.106020","url":null,"abstract":"&lt;div&gt;&lt;div&gt;In 1920, Percy Alexander MacMahon defined the partition generating functions&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;munder&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;mrow&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/munder&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; and&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;munder&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;mrow&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mo&gt;&lt;&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/munder&gt;&lt;mfrac&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;⋯&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;q&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;/mfrac&gt;&lt;/math&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; which have since played an important rol","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106020"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480764","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Simple geometric mitosis 简单几何有丝分裂
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106022
Valentina Kiritchenko
We construct simple geometric operations on faces of the Cayley sum of two polytopes. These operations can be thought of as convex geometric counterparts of divided difference operators in Schubert calculus. We show that these operations give a uniform construction of Knutson–Miller mitosis in the type A and Fujita mitosis in the type C on Kogan faces of Gelfand–Zetlin polytopes.
在两个多面体的Cayley和的面上构造了简单的几何运算。这些操作可以被认为是舒伯特微积分中差除算子的凸几何对应物。我们证明了这些操作在Gelfand-Zetlin多面体的Kogan面上给出了a型的Knutson-Miller有丝分裂和C型的Fujita有丝分裂的统一结构。
{"title":"Simple geometric mitosis","authors":"Valentina Kiritchenko","doi":"10.1016/j.jcta.2025.106022","DOIUrl":"10.1016/j.jcta.2025.106022","url":null,"abstract":"<div><div>We construct simple geometric operations on faces of the Cayley sum of two polytopes. These operations can be thought of as convex geometric counterparts of divided difference operators in Schubert calculus. We show that these operations give a uniform construction of Knutson–Miller mitosis in the type <em>A</em> and Fujita mitosis in the type <em>C</em> on Kogan faces of Gelfand–Zetlin polytopes.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106022"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474227","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On common energies and sumsets 在共同的能量和日落
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106026
Shkredov I.D.
We obtain a polynomial criterion for a set to have a small doubling in terms of the common energy of its subsets.
我们得到了一个多项式标准,即一个集合在其子集合的公共能量方面有一个小的加倍。
{"title":"On common energies and sumsets","authors":"Shkredov I.D.","doi":"10.1016/j.jcta.2025.106026","DOIUrl":"10.1016/j.jcta.2025.106026","url":null,"abstract":"<div><div>We obtain a polynomial criterion for a set to have a small doubling in terms of the common energy of its subsets.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106026"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143474228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On recursive constructions for 2-designs over finite fields 有限域上2-设计的递归结构
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-01-20 DOI: 10.1016/j.jcta.2025.106006
Xiaoran Wang, Junling Zhou
This paper concentrates on recursive constructions for 2-designs over finite fields. In 1998, Itoh presented a powerful recursive construction: for certain index λ, if there exists a Singer cycle invariant 2-(l,3,λ)q design, then there also exists an SL(m,ql) invariant 2-(ml,3,λ)q design for all integers m3. We investigate the GL(m,ql)-incidence matrix between 2-subspaces and k-subspaces of GF(q)ml with m2 and k3 in this work. As a generalization of Itoh's construction, the important case of m=2 is supplemented and a doubling construction is established for 2-(l,3,λ)q designs over finite fields. As a further generalization, a product construction is developed for q-analogs of group divisible designs (q-GDDs). For general block dimension k3, several new infinite families of q-GDDs are constructed. As applications, plenty of new infinite families of 2-designs over finite fields are constructed.
本文主要研究有限域上2-设计的递归结构。1998年,Itoh提出了一个强大的递归构造:对于某些指标λ,如果存在Singer循环不变量2-(l,3,λ)q设计,那么对于所有整数m≥3,也存在SL(m,ql)不变量2-(ml,3,λ)q设计。本文研究了GF(q)ml中m≥2和k≥3的2-子空间和k-子空间之间的GL(m,ql)-关联矩阵。作为Itoh构造的推广,补充了m=2的重要情况,并建立了有限域上2-(1,3,λ)q设计的双重构造。作为进一步推广,提出了群可分设计q-类似物的产品结构。对于一般块维数k≥3,构造了几个新的q- gdd无限族。作为应用,在有限域上构造了许多新的2-设计无限族。
{"title":"On recursive constructions for 2-designs over finite fields","authors":"Xiaoran Wang,&nbsp;Junling Zhou","doi":"10.1016/j.jcta.2025.106006","DOIUrl":"10.1016/j.jcta.2025.106006","url":null,"abstract":"<div><div>This paper concentrates on recursive constructions for 2-designs over finite fields. In 1998, Itoh presented a powerful recursive construction: for certain index <em>λ</em>, if there exists a Singer cycle invariant 2-<span><math><msub><mrow><mo>(</mo><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> design, then there also exists an SL<span><math><mo>(</mo><mi>m</mi><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup><mo>)</mo></math></span> invariant 2-<span><math><msub><mrow><mo>(</mo><mi>m</mi><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> design for all integers <span><math><mi>m</mi><mo>≥</mo><mn>3</mn></math></span>. We investigate the <span><math><mrow><mi>GL</mi></mrow><mo>(</mo><mi>m</mi><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>l</mi></mrow></msup><mo>)</mo></math></span>-incidence matrix between 2-subspaces and <em>k</em>-subspaces of <span><math><mi>GF</mi><mspace></mspace><msup><mrow><mo>(</mo><mi>q</mi><mo>)</mo></mrow><mrow><mi>m</mi><mi>l</mi></mrow></msup></math></span> with <span><math><mi>m</mi><mo>≥</mo><mn>2</mn></math></span> and <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span> in this work. As a generalization of Itoh's construction, the important case of <span><math><mi>m</mi><mo>=</mo><mn>2</mn></math></span> is supplemented and a doubling construction is established for 2-<span><math><msub><mrow><mo>(</mo><mi>l</mi><mo>,</mo><mn>3</mn><mo>,</mo><mi>λ</mi><mo>)</mo></mrow><mrow><mi>q</mi></mrow></msub></math></span> designs over finite fields. As a further generalization, a product construction is developed for <em>q</em>-analogs of group divisible designs (<em>q</em>-GDDs). For general block dimension <span><math><mi>k</mi><mo>≥</mo><mn>3</mn></math></span>, several new infinite families of <em>q</em>-GDDs are constructed. As applications, plenty of new infinite families of 2-designs over finite fields are constructed.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106006"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143103356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Structure of Terwilliger algebras of quasi-thin association schemes 拟薄关联格式的Terwilliger代数的结构
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-24 DOI: 10.1016/j.jcta.2025.106024
Zhenxian Chen , Changchang Xi
We show that the Terwilliger algebra of a quasi-thin association scheme over a field is always a quasi-hereditary cellular algebra in the sense of Cline-Parshall-Scott and of Graham-Lehrer, respectively, and that the basic algebra of the Terwilliger algebra is the dual extension of a star with all arrows pointing to its center if the field has characteristic 2. Thus many homological and representation-theoretic properties of these Terwilliger algebras can be determined completely. For example, the Nakayama conjecture holds true for Terwilliger algebras of quasi-thin association schemes.
我们证明了场上的拟薄关联格式的Terwilliger代数分别是Cline-Parshall-Scott和Graham-Lehrer意义上的拟遗传元代数,并且如果场具有特征2,则Terwilliger代数的基本代数是一颗所有箭头都指向其中心的星的对偶扩展。从而可以完全确定这些Terwilliger代数的许多同调性质和表示论性质。例如,Nakayama猜想对拟薄关联格式的Terwilliger代数成立。
{"title":"Structure of Terwilliger algebras of quasi-thin association schemes","authors":"Zhenxian Chen ,&nbsp;Changchang Xi","doi":"10.1016/j.jcta.2025.106024","DOIUrl":"10.1016/j.jcta.2025.106024","url":null,"abstract":"<div><div>We show that the Terwilliger algebra of a quasi-thin association scheme over a field is always a quasi-hereditary cellular algebra in the sense of Cline-Parshall-Scott and of Graham-Lehrer, respectively, and that the basic algebra of the Terwilliger algebra is the dual extension of a star with all arrows pointing to its center if the field has characteristic 2. Thus many homological and representation-theoretic properties of these Terwilliger algebras can be determined completely. For example, the Nakayama conjecture holds true for Terwilliger algebras of quasi-thin association schemes.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106024"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Regular ovoids and Cameron-Liebler sets of generators in polar spaces 极空间中的正则卵圆和Cameron-Liebler生成集
IF 0.9 2区 数学 Q2 MATHEMATICS Pub Date : 2025-07-01 Epub Date: 2025-02-25 DOI: 10.1016/j.jcta.2025.106029
Maarten De Boeck , Jozefien D'haeseleer , Morgan Rodgers
Cameron-Liebler sets of generators in polar spaces were introduced a few years ago as natural generalisations of the Cameron-Liebler sets of subspaces in projective spaces. In this article we present the first two constructions of non-trivial Cameron-Liebler sets of generators in polar spaces. Also regular m-ovoids of k-spaces are introduced as a generalization of m-ovoids of polar spaces. They are used in one of the aforementioned constructions of Cameron-Liebler sets.
极空间中的卡梅隆-利伯勒生成器集是几年前作为投影空间中子空间的卡梅隆-利伯勒集的自然广义而提出的。在这篇文章中,我们首次提出了极空间中非难卡梅隆-利伯勒生成器集的两个构造。此外,还介绍了 k 空间的正则 m-ovoids 作为极空间 m-ovoids 的广义。它们被用于上述卡梅隆-利伯勒集合的一个构造中。
{"title":"Regular ovoids and Cameron-Liebler sets of generators in polar spaces","authors":"Maarten De Boeck ,&nbsp;Jozefien D'haeseleer ,&nbsp;Morgan Rodgers","doi":"10.1016/j.jcta.2025.106029","DOIUrl":"10.1016/j.jcta.2025.106029","url":null,"abstract":"<div><div>Cameron-Liebler sets of generators in polar spaces were introduced a few years ago as natural generalisations of the Cameron-Liebler sets of subspaces in projective spaces. In this article we present the first two constructions of non-trivial Cameron-Liebler sets of generators in polar spaces. Also regular <em>m</em>-ovoids of <em>k</em>-spaces are introduced as a generalization of <em>m</em>-ovoids of polar spaces. They are used in one of the aforementioned constructions of Cameron-Liebler sets.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":"213 ","pages":"Article 106029"},"PeriodicalIF":0.9,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Combinatorial Theory Series A
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1