首页 > 最新文献

Advances in Applied Mathematics最新文献

英文 中文
q-Super Catalan numbers: Combinatorial identities, generating functions, and Narayana refinements q-超级加泰罗尼亚数:组合恒等式,生成函数,和Narayana细化
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-05-23 DOI: 10.1016/j.aam.2025.102911
Arthur Rodelet–Causse , Lenny Tevlin
We derive a number of combinatorial identities satisfied by the q-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the q-super Catalan numbers.
Next, we introduce some q-convolution identities involving q-central binomial and q-Catalan numbers, and derive a generating function for q-Catalan numbers.
Then we introduce Narayana-type refinements of the super Catalan numbers. We prove algebraically the γ-positivity of those refinements and give a combinatorial proof in a special case through the type B analog of noncrossing partitions. Then we introduce their natural q-analogs, prove their q-γ-positivity, and prove some identities they satisfy, generalizing identities of Kreweras [17] and Le Jen-Shoo [11]. Using yet another identity, we prove that these refinements are positive integer polynomials in q.
我们得到了一些由q-超加泰罗尼亚数满足的组合恒等式。特别地,我们将一些已知的组合恒等式(Touchard, Koshy, Reed Dawson)推广到q-超加泰罗尼亚数。其次,我们引入了一些涉及q-中心二项式和q-加泰罗尼亚数的q-卷积恒等式,并推导了q-加泰罗尼亚数的生成函数。然后我们引入了超加泰罗尼亚数的narayana型细化。我们从代数上证明了这些改进的γ-正性,并通过非交叉分区的B型模拟给出了一个特殊情况下的组合证明。然后引入它们的天然q-类似物,证明了它们的q-γ-正性,并证明了它们满足的一些恒等式,推广了Kreweras[17]和Le jen - sho[11]的恒等式。利用另一个恒等式,我们证明了这些改进是q的正整数多项式。
{"title":"q-Super Catalan numbers: Combinatorial identities, generating functions, and Narayana refinements","authors":"Arthur Rodelet–Causse ,&nbsp;Lenny Tevlin","doi":"10.1016/j.aam.2025.102911","DOIUrl":"10.1016/j.aam.2025.102911","url":null,"abstract":"<div><div>We derive a number of combinatorial identities satisfied by the <em>q</em>-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the <em>q</em>-super Catalan numbers.</div><div>Next, we introduce some <em>q</em>-convolution identities involving q-central binomial and q-Catalan numbers, and derive a generating function for <em>q</em>-Catalan numbers.</div><div>Then we introduce Narayana-type refinements of the super Catalan numbers. We prove algebraically the <em>γ</em>-positivity of those refinements and give a combinatorial proof in a special case through the type B analog of noncrossing partitions. Then we introduce their natural <em>q</em>-analogs, prove their <em>q</em>-<em>γ</em>-positivity, and prove some identities they satisfy, generalizing identities of Kreweras <span><span>[17]</span></span> and Le Jen-Shoo <span><span>[11]</span></span>. Using yet another identity, we prove that these refinements are positive integer polynomials in <em>q</em>.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"169 ","pages":"Article 102911"},"PeriodicalIF":1.0,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144116089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Equivalence classes of lower and upper descent weak Bruhat intervals 上下下降弱Bruhat区间的等价类
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-05-20 DOI: 10.1016/j.aam.2025.102910
Seung-Il Choi , Sun-Young Nam , Young-Tak Oh
<div><div>Let <span><math><mrow><mi>Int</mi></mrow><mo>(</mo><mi>n</mi><mo>)</mo></math></span> denote the set of nonempty left weak Bruhat intervals in the symmetric group <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. We investigate the equivalence relation <figure><img></figure> on <span><math><mrow><mi>Int</mi></mrow><mo>(</mo><mi>n</mi><mo>)</mo></math></span>, where <figure><img></figure> if and only if there exists a descent-preserving poset isomorphism between <em>I</em> and <em>J</em>. For each equivalence class <em>C</em> of <figure><img></figure>, a partial order ⪯ is defined by <span><math><msub><mrow><mo>[</mo><mi>σ</mi><mo>,</mo><mi>ρ</mi><mo>]</mo></mrow><mrow><mi>L</mi></mrow></msub><mo>⪯</mo><msub><mrow><mo>[</mo><msup><mrow><mi>σ</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>,</mo><msup><mrow><mi>ρ</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>]</mo></mrow><mrow><mi>L</mi></mrow></msub></math></span> if and only if <span><math><mi>σ</mi><msub><mrow><mo>⪯</mo></mrow><mrow><mi>R</mi></mrow></msub><msup><mrow><mi>σ</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span>. Kim–Lee–Oh (2024) showed that the poset <span><math><mo>(</mo><mi>C</mi><mo>,</mo><mo>⪯</mo><mo>)</mo></math></span> is isomorphic to a right weak Bruhat interval.</div><div>In this paper, we focus on lower and upper descent weak Bruhat intervals, specifically those of the form <span><math><msub><mrow><mo>[</mo><msub><mrow><mi>w</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>,</mo><mi>σ</mi><mo>]</mo></mrow><mrow><mi>L</mi></mrow></msub></math></span> or <span><math><msub><mrow><mo>[</mo><mi>σ</mi><mo>,</mo><msub><mrow><mi>w</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo><mo>]</mo></mrow><mrow><mi>L</mi></mrow></msub></math></span>, where <span><math><msub><mrow><mi>w</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span> is the longest element in the parabolic subgroup <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>S</mi></mrow></msub></math></span> of <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, generated by <span><math><mo>{</mo><msub><mrow><mi>s</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>|</mo><mi>i</mi><mo>∈</mo><mi>S</mi><mo>}</mo></math></span> for a subset <span><math><mi>S</mi><mo>⊆</mo><mo>[</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>]</mo></math></span>, and <span><math><msub><mrow><mi>w</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><mi>S</mi><mo>)</mo></math></span> is the longest element among the minimal-length representatives of left <span><math><msub><mrow><mi>S</mi></mrow><mrow><mo>[</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>]</mo><mo>∖</mo><mi>S</mi></mrow></msub></math></span>-cosets in <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. We begin by providing a poset-theoretic characterization of the equivalence relation <figure><img></figure>. Using
设Int(n)表示对称群Sn中非空左弱Bruhat区间的集合。研究了Int(n)上的等价关系,其中当且仅当I与j之间存在一个保持下降的偏序同构。对于的每一个等价类C,一个偏阶⪯被定义为[σ,ρ]L⪯[σ ',ρ ‘]L当且仅当σ⪯Rσ ’。Kim-Lee-Oh(2024)证明了偏序集(C,⪯)与右弱Bruhat区间同构。本文主要研究下、上下降弱Bruhat区间,特别是[w0(S),σ]L或[σ,w1(S)]L的下降弱Bruhat区间,其中w0(S)是Sn的抛物子群SS中的最长元素,由{si|i∈S}对一个子集S (n−1)产生,w1(S)是Sn中左S[n−1]∑S-集的最小长度代表中的最长元素。我们首先提供等价关系的位论表征。利用这一特征,当C是下下降区间或上下降区间时,可以确定等价类C中的最小和最大元素。在附加条件下,提供了(C,⪯)结构的详细描述。进一步,对于含有[w0(S),σ]L的等价类,给出了B([w0(S),σ]L)的一个内射壳,对于含有[σ,w1(S)]L的等价类,给出了B([σ,w1(S)]L)的一个射影覆盖。其中,B(I)表示与I∈Int(n)相关联的0-Hecke代数的弱Bruhat区间模。应用所得结果研究了0-Hecke代数的射影不可分解模的商模和子模的下下降区间。
{"title":"Equivalence classes of lower and upper descent weak Bruhat intervals","authors":"Seung-Il Choi ,&nbsp;Sun-Young Nam ,&nbsp;Young-Tak Oh","doi":"10.1016/j.aam.2025.102910","DOIUrl":"10.1016/j.aam.2025.102910","url":null,"abstract":"&lt;div&gt;&lt;div&gt;Let &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Int&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; denote the set of nonempty left weak Bruhat intervals in the symmetric group &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;. We investigate the equivalence relation &lt;figure&gt;&lt;img&gt;&lt;/figure&gt; on &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;Int&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;figure&gt;&lt;img&gt;&lt;/figure&gt; if and only if there exists a descent-preserving poset isomorphism between &lt;em&gt;I&lt;/em&gt; and &lt;em&gt;J&lt;/em&gt;. For each equivalence class &lt;em&gt;C&lt;/em&gt; of &lt;figure&gt;&lt;img&gt;&lt;/figure&gt;, a partial order ⪯ is defined by &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;mi&gt;σ&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;ρ&lt;/mi&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;L&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;⪯&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;σ&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;ρ&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;L&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; if and only if &lt;span&gt;&lt;math&gt;&lt;mi&gt;σ&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;⪯&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;R&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;σ&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;′&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/math&gt;&lt;/span&gt;. Kim–Lee–Oh (2024) showed that the poset &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mo&gt;⪯&lt;/mo&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; is isomorphic to a right weak Bruhat interval.&lt;/div&gt;&lt;div&gt;In this paper, we focus on lower and upper descent weak Bruhat intervals, specifically those of the form &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;σ&lt;/mi&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;L&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; or &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;mi&gt;σ&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;w&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;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;L&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;w&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; is the longest element in the parabolic subgroup &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; of &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;, generated by &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;s&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; for a subset &lt;span&gt;&lt;math&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;⊆&lt;/mo&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, and &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;w&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;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; is the longest element among the minimal-length representatives of left &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;[&lt;/mo&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;]&lt;/mo&gt;&lt;mo&gt;∖&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;-cosets in &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;. We begin by providing a poset-theoretic characterization of the equivalence relation &lt;figure&gt;&lt;img&gt;&lt;/figure&gt;. Using","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"169 ","pages":"Article 102910"},"PeriodicalIF":1.0,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144088875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A result for hemi-bundled cross-intersecting families 半捆绑交叉族的结果
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-05-19 DOI: 10.1016/j.aam.2025.102912
Yongjiang Wu, Lihua Feng, Yongtao Li
Two families F and G are called cross-intersecting if for every FF and GG, the intersection FG is non-empty. It is significant to determine the maximum sum of sizes of cross-intersecting families under the additional assumption that one of the two families is intersecting. Such a pair of families is said to be hemi-bundled. In particular, Frankl (2016) proved that for k1,t0 and n2k+t, if F([n]k+t) and G([n]k) are cross-intersecting families, in which F is non-empty and (t+1)-intersecting, then |F|+|G|(nk)(nktk)+1. This bound is achieved when F consists of a single set. In this paper, we generalize this result under the constraint |F|r for every rnkt+1. Moreover, we investigate the stability results of Katona's theorem for non-uniform families with the s-union property. Our result extends the stabilities established by Frankl (2017) and Li and Wu (2024). As applications, we revisit a recent result of Frankl and Wang (2024) as well as a result of Kupavskii (2018). Furthermore, we determine the extremal families in these two results.
如果对于每一个F∈F和G∈G,交集F∩G是非空的,那么两个族F和G被称为交叉交集。在两个族中有一个族相交的附加假设下,确定相交族的最大大小和是有意义的。这样的一对家庭被称为半捆绑。特别是Frankl(2016)证明了k≥1、t≥0、n≥2k+t时,如果F ([n]k+t)和G ([n]k)为交叉的家族,其中F为非空且(t+1)相交,则|F|+|G|≤(nk)−(n−k−tk)+1。当F由一个集合构成时,这个边界就实现了。本文在约束|F|≥r下,对每一个r≤n−k−t+1,推广了这一结果。此外,我们研究了具有s并性质的非一致族的卡托纳定理的稳定性结果。我们的结果扩展了Frankl(2017)和Li和Wu(2024)建立的稳定性。作为应用,我们回顾了Frankl和Wang(2024)的最新结果以及Kupavskii(2018)的结果。进一步,我们确定了这两个结果的极值族。
{"title":"A result for hemi-bundled cross-intersecting families","authors":"Yongjiang Wu,&nbsp;Lihua Feng,&nbsp;Yongtao Li","doi":"10.1016/j.aam.2025.102912","DOIUrl":"10.1016/j.aam.2025.102912","url":null,"abstract":"<div><div>Two families <span><math><mi>F</mi></math></span> and <span><math><mi>G</mi></math></span> are called cross-intersecting if for every <span><math><mi>F</mi><mo>∈</mo><mi>F</mi></math></span> and <span><math><mi>G</mi><mo>∈</mo><mi>G</mi></math></span>, the intersection <span><math><mi>F</mi><mo>∩</mo><mi>G</mi></math></span> is non-empty. It is significant to determine the maximum sum of sizes of cross-intersecting families under the additional assumption that one of the two families is intersecting. Such a pair of families is said to be hemi-bundled. In particular, Frankl (2016) proved that for <span><math><mi>k</mi><mo>≥</mo><mn>1</mn><mo>,</mo><mi>t</mi><mo>≥</mo><mn>0</mn></math></span> and <span><math><mi>n</mi><mo>≥</mo><mn>2</mn><mi>k</mi><mo>+</mo><mi>t</mi></math></span>, if <span><math><mi>F</mi><mo>⊆</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mtd></mtr><mtr><mtd><mrow><mi>k</mi><mo>+</mo><mi>t</mi></mrow></mtd></mtr></mtable><mo>)</mo></mrow></math></span> and <span><math><mi>G</mi><mo>⊆</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mo>[</mo><mi>n</mi><mo>]</mo></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow></math></span> are cross-intersecting families, in which <span><math><mi>F</mi></math></span> is non-empty and <span><math><mo>(</mo><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo></math></span>-intersecting, then <span><math><mo>|</mo><mi>F</mi><mo>|</mo><mo>+</mo><mo>|</mo><mi>G</mi><mo>|</mo><mo>≤</mo><mrow><mo>(</mo><mtable><mtr><mtd><mi>n</mi></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow><mo>−</mo><mrow><mo>(</mo><mtable><mtr><mtd><mrow><mi>n</mi><mo>−</mo><mi>k</mi><mo>−</mo><mi>t</mi></mrow></mtd></mtr><mtr><mtd><mi>k</mi></mtd></mtr></mtable><mo>)</mo></mrow><mo>+</mo><mn>1</mn></math></span>. This bound is achieved when <span><math><mi>F</mi></math></span> consists of a single set. In this paper, we generalize this result under the constraint <span><math><mo>|</mo><mi>F</mi><mo>|</mo><mo>≥</mo><mi>r</mi></math></span> for every <span><math><mi>r</mi><mo>≤</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>−</mo><mi>t</mi><mo>+</mo><mn>1</mn></math></span>. Moreover, we investigate the stability results of Katona's theorem for non-uniform families with the <em>s</em>-union property. Our result extends the stabilities established by Frankl (2017) and Li and Wu (2024). As applications, we revisit a recent result of Frankl and Wang (2024) as well as a result of Kupavskii (2018). Furthermore, we determine the extremal families in these two results.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"169 ","pages":"Article 102912"},"PeriodicalIF":1.0,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dissections of lacunary eta quotients and identically vanishing coefficients 空穴eta商和同消系数的剖分
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-30 DOI: 10.1016/j.aam.2025.102902
Tim Huber , James McLaughlin , Dongxi Ye
For any function A(q)=n=0anqn defineA(0):={nN:an=0}. Now suppose C(q) and D(q) are two functions whose m-dissections are given byC(q)=c0G0(qm)+c1qG1(qm)++cm1qm1Gm1(qm),D(q)=d0G0(qm)+d1qG1(qm)++dm1qm1Gm1(qm). If it is the case that ci=0di=0, i=0,1,,m1, then we say that C(
对于任意函数A(q)=∑n=0∞anqn defineA(0):={n∈n:an=0}。现在假设C(q)和D(q)是两个函数,它们的m-剖分由C(q)=c0G0(qm)+c1qG1(qm)+…+cm−1qm−1Gm−1(qm),D(q)=d0G0(qm)+d1qG1(qm)+…+dm−1qm−1Gm−1(qm)给出。如果ci=0 = di=0, i=0,1,…,m−1,那么我们说C(q)和D(q)有相似的m-截面,然后很明显C(0)=D(0),在这种情况下我们说C(q)和D(q)有相同的消失系数。本文提出了一些新的特殊eta商的4-剖分。这些与已知的2-和3-剖分结合使用,证明了许多关于各种eta商的相同系数消失的结果,这些结果是在实验中发现的,并在本文作者的另一篇论文中得到了部分证明。类似的论证允许为许多对无eta商C(q)和D(q)证明C(0)⫋D(0)形式的许多结果。
{"title":"Dissections of lacunary eta quotients and identically vanishing coefficients","authors":"Tim Huber ,&nbsp;James McLaughlin ,&nbsp;Dongxi Ye","doi":"10.1016/j.aam.2025.102902","DOIUrl":"10.1016/j.aam.2025.102902","url":null,"abstract":"<div><div>For any function <span><math><mi>A</mi><mo>(</mo><mi>q</mi><mo>)</mo><mo>=</mo><msubsup><mrow><mo>∑</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn></mrow><mrow><mo>∞</mo></mrow></msubsup><msub><mrow><mi>a</mi></mrow><mrow><mi>n</mi></mrow></msub><msup><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msup></math></span> define<span><span><span><math><msub><mrow><mi>A</mi></mrow><mrow><mo>(</mo><mn>0</mn><mo>)</mo></mrow></msub><mo>:</mo><mo>=</mo><mo>{</mo><mi>n</mi><mo>∈</mo><mi>N</mi><mo>:</mo><msub><mrow><mi>a</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>=</mo><mn>0</mn><mo>}</mo><mo>.</mo></math></span></span></span> Now suppose <span><math><mi>C</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span> and <span><math><mi>D</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span> are two functions whose <em>m</em>-dissections are given by<span><span><span><math><mi>C</mi><mo>(</mo><mi>q</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>0</mn></mrow></msub><msub><mrow><mi>G</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>(</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo><mo>+</mo><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub><mi>q</mi><msub><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo><mo>+</mo><mo>…</mo><mo>+</mo><msub><mrow><mi>c</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msub><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msup><msub><mrow><mi>G</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msub><mo>(</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo><mo>,</mo></math></span></span></span><span><span><span><math><mi>D</mi><mo>(</mo><mi>q</mi><mo>)</mo><mo>=</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>0</mn></mrow></msub><msub><mrow><mi>G</mi></mrow><mrow><mn>0</mn></mrow></msub><mo>(</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo><mo>+</mo><msub><mrow><mi>d</mi></mrow><mrow><mn>1</mn></mrow></msub><mi>q</mi><msub><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>(</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo><mo>+</mo><mo>…</mo><mo>+</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msub><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msup><msub><mrow><mi>G</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msub><mo>(</mo><msup><mrow><mi>q</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo><mo>.</mo></math></span></span></span> If it is the case that <span><math><msub><mrow><mi>c</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>=</mo><mn>0</mn><mo>⟺</mo><msub><mrow><mi>d</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>=</mo><mn>0</mn></math></span>, <span><math><mi>i</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>m</mi><mo>−</mo><mn>1</mn></math></span>, then we say that <span><math><mi>C</mi><mo>(</mo><mi","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102902"},"PeriodicalIF":1.0,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143888196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Influence of the automorphism group of a graph on its PageRank scores of vertices 图的自同构群对顶点PageRank分数的影响
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-22 DOI: 10.1016/j.aam.2025.102900
Dein Wong , Qi Zhou , Xinlei Wang
Google's success derives in large part from its PageRank algorithm, which assign a score to every web page according to its importance. Recently, G. Modjtaba et al. (2021) [19] proved that similar vertices in a graph have the same PageRank score and they proposed a conjecture, suspecting that two graphs are completely non-Co-PR if they are non-Co-PR graphs. The investigation of this paper mainly concerns the influence of the automorphism group of a graph on its PageRank scores of vertices. The main results of this article are as follows.
  • 1.
    Based on matrix analysis, two conditions on what kinds of vertices have the same PageRank score are obtained.
  • 2.
    Four techniques for constructing Co-PR graphs are established.
  • 3.
    A non-regular connected graph of order n, with 1n as PR scores of most of its vertices, is constructed, which provides a negative answer to Modjtaba's conjecture above.
b谷歌的成功在很大程度上得益于其PageRank算法,该算法根据每个网页的重要性给其打分。最近,G. Modjtaba等人(2021)[19]证明了图中相似的顶点具有相同的PageRank得分,并提出了一个猜想,如果两个图是非co - pr图,则怀疑它们是完全非co - pr图。本文主要研究图的自同构群对其顶点PageRank分数的影响。本文的主要研究结果如下:基于矩阵分析,得到了哪种顶点具有相同PageRank分数的两个条件。建立了四种构建Co-PR图的技术。构造了一个n阶的非正则连通图,其中大部分顶点的PR值为1n,给出了上述Modjtaba猜想的否定答案。
{"title":"Influence of the automorphism group of a graph on its PageRank scores of vertices","authors":"Dein Wong ,&nbsp;Qi Zhou ,&nbsp;Xinlei Wang","doi":"10.1016/j.aam.2025.102900","DOIUrl":"10.1016/j.aam.2025.102900","url":null,"abstract":"<div><div>Google's success derives in large part from its PageRank algorithm, which assign a score to every web page according to its importance. Recently, G. Modjtaba et al. (2021) <span><span>[19]</span></span> proved that similar vertices in a graph have the same PageRank score and they proposed a conjecture, suspecting that two graphs are completely non-Co-PR if they are non-Co-PR graphs. The investigation of this paper mainly concerns the influence of the automorphism group of a graph on its PageRank scores of vertices. The main results of this article are as follows.<ul><li><span>1.</span><span><div>Based on matrix analysis, two conditions on what kinds of vertices have the same PageRank score are obtained.</div></span></li><li><span>2.</span><span><div>Four techniques for constructing Co-PR graphs are established.</div></span></li><li><span>3.</span><span><div>A non-regular connected graph of order <em>n</em>, with <span><math><mfrac><mrow><mn>1</mn></mrow><mrow><mi>n</mi></mrow></mfrac></math></span> as PR scores of most of its vertices, is constructed, which provides a negative answer to Modjtaba's conjecture above.</div></span></li></ul></div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102900"},"PeriodicalIF":1.0,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143855383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Counting flows of b-compatible graphs 计算 b 兼容图的流量
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-14 DOI: 10.1016/j.aam.2025.102901
Houshan Fu , Xiangyu Ren , Suijie Wang
<div><div>Kochol introduced the assigning polynomial <span><math><mi>F</mi><mo>(</mo><mi>G</mi><mo>,</mo><mi>α</mi><mo>;</mo><mi>k</mi><mo>)</mo></math></span> to count nowhere-zero <span><math><mo>(</mo><mi>A</mi><mo>,</mo><mi>b</mi><mo>)</mo></math></span>-flows of a graph <em>G</em>, where <em>A</em> is a finite Abelian group and <em>α</em> is a <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math></span>-assigning from a family <span><math><mi>Λ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span> of certain nonempty vertex subsets of <em>G</em> to <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math></span>. We introduce the concepts of <em>b</em>-compatible graph and <em>b</em>-compatible broken bond to give an explicit formula for the assigning polynomials and to examine their coefficients. More specifically, for a function <span><math><mi>b</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mi>A</mi></math></span>, let <span><math><msub><mrow><mi>α</mi></mrow><mrow><mi>G</mi><mo>,</mo><mi>b</mi></mrow></msub></math></span> be a <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math></span>-assigning of <em>G</em> such that for each <span><math><mi>X</mi><mo>∈</mo><mi>Λ</mi><mo>(</mo><mi>G</mi><mo>)</mo></math></span>, <span><math><msub><mrow><mi>α</mi></mrow><mrow><mi>G</mi><mo>,</mo><mi>b</mi></mrow></msub><mo>(</mo><mi>X</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span> if and only if <span><math><msub><mrow><mo>∑</mo></mrow><mrow><mi>v</mi><mo>∈</mo><mi>X</mi></mrow></msub><mi>b</mi><mo>(</mo><mi>v</mi><mo>)</mo><mo>=</mo><mn>0</mn></math></span>. We show that for any <span><math><mo>{</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>}</mo></math></span>-assigning <em>α</em> of <em>G</em>, if there exists a function <span><math><mi>b</mi><mo>:</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>→</mo><mi>A</mi></math></span> such that <em>G</em> is <em>b</em>-compatible and <span><math><mi>α</mi><mo>=</mo><msub><mrow><mi>α</mi></mrow><mrow><mi>G</mi><mo>,</mo><mi>b</mi></mrow></msub></math></span>, then the assigning polynomial <span><math><mi>F</mi><mo>(</mo><mi>G</mi><mo>,</mo><mi>α</mi><mo>;</mo><mi>k</mi><mo>)</mo></math></span> has the <em>b</em>-compatible spanning subgraph expansion<span><span><span><math><mi>F</mi><mo>(</mo><mi>G</mi><mo>,</mo><mi>α</mi><mo>;</mo><mi>k</mi><mo>)</mo><mo>=</mo><munder><mo>∑</mo><mrow><mtable><mtr><mtd><mi>S</mi><mo>⊆</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>,</mo></mtd></mtr><mtr><mtd><mi>G</mi><mo>−</mo><mi>S</mi><mrow><mtext> is</mtext><mspace></mspace><mtext>b</mtext><mtext>-compatible</mtext></mrow></mtd></mtr></mtable></mrow></munder><msup><mrow><mo>(</mo><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>|</mo><mi>S</mi><mo>|</mo></mrow></msup><msup><mrow><mi>k</mi></mrow><mrow><mi>m</mi><mo>(</mo><mi>G</mi><mo>−</mo><mi>S</mi><mo>)</mo></mrow></msup><mo>,</mo></math></span></span></span> and is the following form<span><span><span><math><mi>F</mi>
Kochol引入赋值多项式F(G,α;k)来计算图G的无零(A,b)-流,其中A是有限阿贝尔群,α是A{0,1}-从G的某些非空顶点子集的族Λ(G)中赋值到{0,1}。我们引入了b相容图和b相容断键的概念,给出了赋值多项式的显式公式,并检验了它们的系数。更具体地说,对于函数b:V(G)→a,设αG,b为a {0,1}- G的赋值使得对于每个X∈Λ(G), αG,b(X)=0当且仅当∑V∈Xb(V)=0。证明了对于G的任意{0,1}-赋值α,若存在函数b:V(G)→a,使得G是b相容且α=αG,b,则赋值多项式F(G,α;k)具有b相容的生成子图展开式F(G,α;k)=∑S≥≥E(G),G−S≥≥|S≥|km(G−S),其形式为F(G,α;k)=∑i=0m(G)(−1)iai(G,α)km(G)−i。其中每个ai(G,α)是E(G)的子集S有i条边使得G−S与b相容且S不包含与b相容的断键对于E(G)的总阶的个数。应用计数解释,我们还得到了赋值多项式的无符号系数的统一比较关系。即对任何{0,1}-assigningsα,α’G的,如果存在函数b: V (G)→A和b的:V (G)→这样G b-compatible和b的兼容,α=αG b,α=αG b和α(X)≤α的所有X (X)∈Λ(G), thenai (G,α)≤ai (G,α')= 0,1,…,m (G)。
{"title":"Counting flows of b-compatible graphs","authors":"Houshan Fu ,&nbsp;Xiangyu Ren ,&nbsp;Suijie Wang","doi":"10.1016/j.aam.2025.102901","DOIUrl":"10.1016/j.aam.2025.102901","url":null,"abstract":"&lt;div&gt;&lt;div&gt;Kochol introduced the assigning polynomial &lt;span&gt;&lt;math&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; to count nowhere-zero &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-flows of a graph &lt;em&gt;G&lt;/em&gt;, where &lt;em&gt;A&lt;/em&gt; is a finite Abelian group and &lt;em&gt;α&lt;/em&gt; is a &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-assigning from a family &lt;span&gt;&lt;math&gt;&lt;mi&gt;Λ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; of certain nonempty vertex subsets of &lt;em&gt;G&lt;/em&gt; to &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;. We introduce the concepts of &lt;em&gt;b&lt;/em&gt;-compatible graph and &lt;em&gt;b&lt;/em&gt;-compatible broken bond to give an explicit formula for the assigning polynomials and to examine their coefficients. More specifically, for a function &lt;span&gt;&lt;math&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;→&lt;/mo&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;, let &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; be a &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-assigning of &lt;em&gt;G&lt;/em&gt; such that for each &lt;span&gt;&lt;math&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;Λ&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt; if and only if &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;∈&lt;/mo&gt;&lt;mi&gt;X&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;. We show that for any &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;}&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-assigning &lt;em&gt;α&lt;/em&gt; of &lt;em&gt;G&lt;/em&gt;, if there exists a function &lt;span&gt;&lt;math&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;mo&gt;:&lt;/mo&gt;&lt;mi&gt;V&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;→&lt;/mo&gt;&lt;mi&gt;A&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt; such that &lt;em&gt;G&lt;/em&gt; is &lt;em&gt;b&lt;/em&gt;-compatible and &lt;span&gt;&lt;math&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;b&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt;, then the assigning polynomial &lt;span&gt;&lt;math&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; has the &lt;em&gt;b&lt;/em&gt;-compatible spanning subgraph expansion&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;math&gt;&lt;mi&gt;F&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;α&lt;/mi&gt;&lt;mo&gt;;&lt;/mo&gt;&lt;mi&gt;k&lt;/mi&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;mtable&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;⊆&lt;/mo&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;mtr&gt;&lt;mtd&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mrow&gt;&lt;mtext&gt; is&lt;/mtext&gt;&lt;mspace&gt;&lt;/mspace&gt;&lt;mtext&gt;b&lt;/mtext&gt;&lt;mtext&gt;-compatible&lt;/mtext&gt;&lt;/mrow&gt;&lt;/mtd&gt;&lt;/mtr&gt;&lt;/mtable&gt;&lt;/mrow&gt;&lt;/munder&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;k&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mi&gt;S&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt; and is the following form&lt;span&gt;&lt;span&gt;&lt;span&gt;&lt;math&gt;&lt;mi&gt;F&lt;/mi&gt;","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102901"},"PeriodicalIF":1.0,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143826047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The maximum number of cycles in a triangular-grid billiards system with a given perimeter 给定周长的三角形网格台球系统的最大循环数
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-14 DOI: 10.1016/j.aam.2025.102888
Honglin Zhu
Given a grid polygon P in a grid of equilateral triangles, Defant and Jiradilok considered a billiards system where beams of light bounce around inside P. We study the relationship between the perimeter perim(P) of P and the number of different trajectories cyc(P) that the billiards system has. Resolving a conjecture of Defant and Jiradilok, we prove the sharp inequality cyc(P)(perim(P)+2)/4 and characterize the equality cases.
给定等边三角形网格中的一个网格多边形P, Defant和Jiradilok考虑了一个台球系统,其中光束在P内反弹。我们研究了P的周长(P)与台球系统中不同轨迹周期(P)的数量之间的关系。解决了Defant和Jiradilok的一个猜想,证明了尖锐不等式cyc(P)≤(perim(P)+2)/4,并刻画了相等情况。
{"title":"The maximum number of cycles in a triangular-grid billiards system with a given perimeter","authors":"Honglin Zhu","doi":"10.1016/j.aam.2025.102888","DOIUrl":"10.1016/j.aam.2025.102888","url":null,"abstract":"<div><div>Given a grid polygon <em>P</em> in a grid of equilateral triangles, Defant and Jiradilok considered a billiards system where beams of light bounce around inside <em>P</em>. We study the relationship between the perimeter <span><math><mi>perim</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> of <em>P</em> and the number of different trajectories <span><math><mi>cyc</mi><mo>(</mo><mi>P</mi><mo>)</mo></math></span> that the billiards system has. Resolving a conjecture of Defant and Jiradilok, we prove the sharp inequality <span><math><mi>cyc</mi><mo>(</mo><mi>P</mi><mo>)</mo><mo>≤</mo><mo>(</mo><mi>perim</mi><mo>(</mo><mi>P</mi><mo>)</mo><mo>+</mo><mn>2</mn><mo>)</mo><mo>/</mo><mn>4</mn></math></span> and characterize the equality cases.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102888"},"PeriodicalIF":1.0,"publicationDate":"2025-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143826046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Colored q-Stirling and q-Lah numbers: A new view continued 有色q-Stirling数和q-Lah数:一个新的观点继续
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-10 DOI: 10.1016/j.aam.2025.102889
Sen-Peng Eu , Louis Kao , Juei-Yin Lin
Cai and Readdy proposed a new framework for studying the q-analogue f(q) of a combinatorial structure S. Specifically, the aim is to identify two statistics over S and a proper subset S of S such that f(q) represents the q-(1+q)-expansion over S, and to explore the poset and topological interpretations of this expansion. Cai and Readdy provided comprehensive profiles for classical Stirling numbers of both kinds within this framework. In this work, we extend Cai and Readdy's results to colored q-Stirling numbers of both kinds, as well as colored q-Lah numbers. We also briefly discuss q-Stirling and q-Lah numbers of type D.
蔡和瑞迪提出了一个研究组合结构 S 的 q-analogue f(q) 的新框架。具体来说,其目的是找出 S 上的两个统计量和 S 的一个适当子集 S′,从而使 f(q) 代表 S′上的 q-(1+q)- 展开,并探索这种展开的正集和拓扑解释。Cai 和 Readdy 在此框架内提供了两种经典斯特林数的全面剖面图。在这项工作中,我们将蔡和雷迪的结果扩展到两种彩色 q-Stirling 数以及彩色 q-Lah 数。我们还简要讨论了 D 型的 q-Stirling 和 q-Lah 数。
{"title":"Colored q-Stirling and q-Lah numbers: A new view continued","authors":"Sen-Peng Eu ,&nbsp;Louis Kao ,&nbsp;Juei-Yin Lin","doi":"10.1016/j.aam.2025.102889","DOIUrl":"10.1016/j.aam.2025.102889","url":null,"abstract":"<div><div>Cai and Readdy proposed a new framework for studying the <em>q</em>-analogue <span><math><mi>f</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span> of a combinatorial structure <em>S</em>. Specifically, the aim is to identify two statistics over <em>S</em> and a proper subset <span><math><msup><mrow><mi>S</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span> of <em>S</em> such that <span><math><mi>f</mi><mo>(</mo><mi>q</mi><mo>)</mo></math></span> represents the <em>q</em>-<span><math><mo>(</mo><mn>1</mn><mo>+</mo><mi>q</mi><mo>)</mo></math></span>-expansion over <span><math><msup><mrow><mi>S</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span>, and to explore the poset and topological interpretations of this expansion. Cai and Readdy provided comprehensive profiles for classical Stirling numbers of both kinds within this framework. In this work, we extend Cai and Readdy's results to colored <em>q</em>-Stirling numbers of both kinds, as well as colored <em>q</em>-Lah numbers. We also briefly discuss <em>q</em>-Stirling and <em>q</em>-Lah numbers of type <em>D</em>.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102889"},"PeriodicalIF":1.0,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143808186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dependency equilibria: Boundary cases and their real algebraic geometry 相依平衡:边界情况及其实代数几何
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-09 DOI: 10.1016/j.aam.2025.102890
Irem Portakal , Daniel Windisch
This paper is a significant step forward in understanding dependency equilibria within the framework of real algebraic geometry encompassing both pure and mixed equilibria. In alignment with Spohn's original definition of dependency equilibria, we propose two alternative definitions, allowing for an algebro-geometric comprehensive study of all dependency equilibria. We give a sufficient condition for the existence of a pure dependency equilibrium and show that every Nash equilibrium lies on the Spohn variety, the algebraic model for dependency equilibria. For generic games, the set of real points of the Spohn variety is Zariski dense. Furthermore, every Nash equilibrium in this case is a dependency equilibrium. Finally, we present a detailed analysis of the geometric structure of dependency equilibria for (2×2)-games.
本文在理解纯均衡和混合均衡的实际代数几何框架内的依赖均衡方面迈出了重要的一步。根据Spohn对依赖均衡的原始定义,我们提出了两个替代定义,允许对所有依赖均衡进行代数-几何综合研究。给出了纯依赖均衡存在的充分条件,并证明了每一个纳什均衡都存在于依赖均衡的代数模型——Spohn变量上。对于一般游戏,Spohn变量的实点集合是Zariski密集的。此外,在这种情况下,每个纳什均衡都是依赖均衡。最后,我们对(2×2)-博弈的依赖均衡的几何结构进行了详细分析。
{"title":"Dependency equilibria: Boundary cases and their real algebraic geometry","authors":"Irem Portakal ,&nbsp;Daniel Windisch","doi":"10.1016/j.aam.2025.102890","DOIUrl":"10.1016/j.aam.2025.102890","url":null,"abstract":"<div><div>This paper is a significant step forward in understanding dependency equilibria within the framework of real algebraic geometry encompassing both pure and mixed equilibria. In alignment with Spohn's original definition of dependency equilibria, we propose two alternative definitions, allowing for an algebro-geometric comprehensive study of all dependency equilibria. We give a sufficient condition for the existence of a pure dependency equilibrium and show that every Nash equilibrium lies on the Spohn variety, the algebraic model for dependency equilibria. For generic games, the set of real points of the Spohn variety is Zariski dense. Furthermore, every Nash equilibrium in this case is a dependency equilibrium. Finally, we present a detailed analysis of the geometric structure of dependency equilibria for <span><math><mo>(</mo><mn>2</mn><mo>×</mo><mn>2</mn><mo>)</mo></math></span>-games.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102890"},"PeriodicalIF":1.0,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143808185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Boolean, free, and classical cumulants as tree enumerations 作为树枚举的布尔、自由和经典累积量
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-08 DOI: 10.1016/j.aam.2025.102899
Colin Defant, Mitchell Lee
Defant found that the relationship between a sequence of (univariate) classical cumulants and the corresponding sequence of (univariate) free cumulants can be described combinatorially in terms of families of binary plane trees called troupes. Using a generalization of troupes that we call weighted troupes, we generalize this result to allow for multivariate cumulants. Our result also gives a combinatorial description of the corresponding Boolean cumulants. This allows us to answer a question of Defant regarding his troupe transform. We also provide explicit distributions whose cumulants correspond to some specific weighted troupes.
Defant发现(单变量)经典累积量序列与相应的(单变量)自由累积量序列之间的关系可以用称为群的二叉平面树族来组合描述。使用我们称为加权群的群的泛化,我们将这个结果推广到允许多元累积量。我们的结果也给出了相应布尔累积量的组合描述。这让我们可以回答Defant关于他的剧团转变的问题。我们还提供了显式分布,其累积量对应于一些特定的加权组。
{"title":"Boolean, free, and classical cumulants as tree enumerations","authors":"Colin Defant,&nbsp;Mitchell Lee","doi":"10.1016/j.aam.2025.102899","DOIUrl":"10.1016/j.aam.2025.102899","url":null,"abstract":"<div><div>Defant found that the relationship between a sequence of (univariate) classical cumulants and the corresponding sequence of (univariate) free cumulants can be described combinatorially in terms of families of binary plane trees called <em>troupes</em>. Using a generalization of troupes that we call <em>weighted troupes</em>, we generalize this result to allow for multivariate cumulants. Our result also gives a combinatorial description of the corresponding Boolean cumulants. This allows us to answer a question of Defant regarding his <em>troupe transform</em>. We also provide explicit distributions whose cumulants correspond to some specific weighted troupes.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102899"},"PeriodicalIF":1.0,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143792352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Advances in Applied Mathematics
全部 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