首页 > 最新文献

Advances in Applied Mathematics最新文献

英文 中文
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
The extra basis in noncommuting variables 非交换变量的额外基
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-04 DOI: 10.1016/j.aam.2025.102887
Farid Aliniaeifard, Stephanie van Willigenburg
We answer a question of Bergeron, Hohlweg, Rosas, and Zabrocki from 2006 to give a combinatorial description for the coproduct of the x-basis in the Hopf algebra of symmetric functions in noncommuting variables, NCSym, which arises in the theory of Grothendieck bialgebras. We achieve this by applying the theory of Hopf monoids and the Fock functor. We also determine combinatorial expansions of this basis in terms of the monomial and power sum symmetric functions in NCSym, and by taking the commutative image of the x-basis we discover a new multiplicative basis for the algebra of symmetric functions.
我们回答了Bergeron, Hohlweg, Rosas, and Zabrocki从2006年提出的一个问题,给出了非交换变量NCSym对称函数的Hopf代数中x基的余积的组合描述,该问题出现在Grothendieck双代数理论中。我们利用Hopf半群理论和Fock函子实现了这一点。我们还用NCSym中的单项式和幂和对称函数确定了该基的组合展开式,并通过取x基的交换像发现了对称函数代数的一种新的乘法基。
{"title":"The extra basis in noncommuting variables","authors":"Farid Aliniaeifard,&nbsp;Stephanie van Willigenburg","doi":"10.1016/j.aam.2025.102887","DOIUrl":"10.1016/j.aam.2025.102887","url":null,"abstract":"<div><div>We answer a question of Bergeron, Hohlweg, Rosas, and Zabrocki from 2006 to give a combinatorial description for the coproduct of the <em>x</em>-basis in the Hopf algebra of symmetric functions in noncommuting variables, NCSym, which arises in the theory of Grothendieck bialgebras. We achieve this by applying the theory of Hopf monoids and the Fock functor. We also determine combinatorial expansions of this basis in terms of the monomial and power sum symmetric functions in NCSym, and by taking the commutative image of the <em>x</em>-basis we discover a new multiplicative basis for the algebra of symmetric functions.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"168 ","pages":"Article 102887"},"PeriodicalIF":1.0,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143767926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A composition method for neat formulas of chromatic symmetric functions 色对称函数整洁公式的合成方法
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-04-01 DOI: 10.1016/j.aam.2025.102886
David G.L. Wang , James Z.F. Zhou
We develop a composition method to unearth positive eI-expansions of chromatic symmetric functions XG, where the subscript I stands for compositions rather than integer partitions. Using this method, we derive positive and neat eI-expansions for the chromatic symmetric functions of tadpoles, barbells and generalized bulls, and establish the e-positivity of hats. We also obtain a compact ribbon Schur analog for the chromatic symmetric function of cycles.
我们开发了一种复合方法来揭示色对称函数XG的正ei -展开式,其中下标I代表复合而不是整数分割。利用该方法,我们得到了蝌蚪、杠铃和广义公牛的色对称函数的正的、整齐的e-展开式,并建立了帽子的e-正性。我们还得到了环的色对称函数的紧带状舒尔模拟。
{"title":"A composition method for neat formulas of chromatic symmetric functions","authors":"David G.L. Wang ,&nbsp;James Z.F. Zhou","doi":"10.1016/j.aam.2025.102886","DOIUrl":"10.1016/j.aam.2025.102886","url":null,"abstract":"<div><div>We develop a composition method to unearth positive <span><math><msub><mrow><mi>e</mi></mrow><mrow><mi>I</mi></mrow></msub></math></span>-expansions of chromatic symmetric functions <span><math><msub><mrow><mi>X</mi></mrow><mrow><mi>G</mi></mrow></msub></math></span>, where the subscript <em>I</em> stands for compositions rather than integer partitions. Using this method, we derive positive and neat <span><math><msub><mrow><mi>e</mi></mrow><mrow><mi>I</mi></mrow></msub></math></span>-expansions for the chromatic symmetric functions of tadpoles, barbells and generalized bulls, and establish the <em>e</em>-positivity of hats. We also obtain a compact ribbon Schur analog for the chromatic symmetric function of cycles.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"167 ","pages":"Article 102886"},"PeriodicalIF":1.0,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143739432","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
Poisson approximation for large permutation groups 大置换群的泊松近似
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-03-28 DOI: 10.1016/j.aam.2025.102883
Persi Diaconis , Nathan Tung
Let Gk,n be a group of permutations of kn objects which permutes things independently in disjoint blocks of size k and then permutes the blocks. We investigate the probabilistic and enumerative aspects of random elements of Gk,n. This includes novel limit theorems for cycles of various lengths, number of cycles, and inversions. The limits include compound Poisson distributions with interesting dependence structure.
设Gk n为kn个物体的排列组合,这些物体在大小为k的不相交的块中独立排列,然后对这些块进行排列。我们研究了Gk,n的随机元素的概率和枚举方面。这包括新的极限定理的各种长度的循环,循环数,和反转。极限包括具有有趣的依赖结构的复合泊松分布。
{"title":"Poisson approximation for large permutation groups","authors":"Persi Diaconis ,&nbsp;Nathan Tung","doi":"10.1016/j.aam.2025.102883","DOIUrl":"10.1016/j.aam.2025.102883","url":null,"abstract":"<div><div>Let <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span> be a group of permutations of <em>kn</em> objects which permutes things independently in disjoint blocks of size <em>k</em> and then permutes the blocks. We investigate the probabilistic and enumerative aspects of random elements of <span><math><msub><mrow><mi>G</mi></mrow><mrow><mi>k</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span>. This includes novel limit theorems for cycles of various lengths, number of cycles, and inversions. The limits include compound Poisson distributions with interesting dependence structure.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"167 ","pages":"Article 102883"},"PeriodicalIF":1.0,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143714822","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
Truncated theta series from the Bailey lattice 从贝利格中截断的级数
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-03-26 DOI: 10.1016/j.aam.2025.102884
Xiangyu Ding, Lisa Hui Sun
In 2012, Andrews and Merca obtained a truncated version of Euler's pentagonal number theorem and showed the nonnegativity related to partition functions. Meanwhile, Andrews and Merca, Guo and Zeng independently conjectured that the truncated Jacobi triple product series has nonnegative coefficients, which has been confirmed analytically and also combinatorially. In 2022, Merca proposed a stronger version for this conjecture. In this paper, by applying Agarwal, Andrews and Bressoud's identity derived from the Bailey lattice, we obtain a truncated version for the Jacobi triple product series with odd basis, which reduces to the Andrews–Gordon identity as a special instance. As consequences, we obtain new truncated forms for Euler's pentagonal number theorem, Gauss' theta series on triangular numbers and square numbers, which lead to inequalities for certain partition functions. Moreover, by considering a truncated theta series involving -regular partitions, we confirm a conjecture proposed by Ballantine and Merca about 6-regular partitions and show that Merca's stronger conjecture on truncated Jacobi triple product series holds when R=3S for S1.
2012年,Andrews和Merca得到了欧拉五边形数定理的删节版,并证明了与配分函数相关的非负性。同时,Andrews和Merca, Guo和Zeng各自推测截断的Jacobi三重积级数具有非负系数,并通过解析和组合得到了证实。2022年,Merca提出了一个更强大的版本。本文应用由Bailey格导出的Agarwal、Andrews和Bressoud恒等式,得到了具有奇基的Jacobi三重积级数的截断形式,并作为特例简化为Andrews - gordon恒等式。由此,我们得到了欧拉五边形数定理、高斯关于三角数和平方数的θ级数的新的截断形式,这些截断形式导致了某些配分函数的不等式。此外,通过考虑一个截断的、包含有l -正则分割的θ级数,我们证实了Ballantine和Merca关于6-正则分割的猜想,并证明了当S≥1时R=3S时,Merca关于截断的Jacobi三重积级数的强猜想成立。
{"title":"Truncated theta series from the Bailey lattice","authors":"Xiangyu Ding,&nbsp;Lisa Hui Sun","doi":"10.1016/j.aam.2025.102884","DOIUrl":"10.1016/j.aam.2025.102884","url":null,"abstract":"<div><div>In 2012, Andrews and Merca obtained a truncated version of Euler's pentagonal number theorem and showed the nonnegativity related to partition functions. Meanwhile, Andrews and Merca, Guo and Zeng independently conjectured that the truncated Jacobi triple product series has nonnegative coefficients, which has been confirmed analytically and also combinatorially. In 2022, Merca proposed a stronger version for this conjecture. In this paper, by applying Agarwal, Andrews and Bressoud's identity derived from the Bailey lattice, we obtain a truncated version for the Jacobi triple product series with odd basis, which reduces to the Andrews–Gordon identity as a special instance. As consequences, we obtain new truncated forms for Euler's pentagonal number theorem, Gauss' theta series on triangular numbers and square numbers, which lead to inequalities for certain partition functions. Moreover, by considering a truncated theta series involving <em>ℓ</em>-regular partitions, we confirm a conjecture proposed by Ballantine and Merca about 6-regular partitions and show that Merca's stronger conjecture on truncated Jacobi triple product series holds when <span><math><mi>R</mi><mo>=</mo><mn>3</mn><mi>S</mi></math></span> for <span><math><mi>S</mi><mo>≥</mo><mn>1</mn></math></span>.</div></div>","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"167 ","pages":"Article 102884"},"PeriodicalIF":1.0,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143704752","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
Further results on r-Euler-Mahonian statistics r-Euler-Mahonian统计的进一步结果
IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Pub Date : 2025-03-20 DOI: 10.1016/j.aam.2025.102882
Kaimei Huang, Sherry H.F. Yan
<div><div>As natural generalizations of the descent number (<span><math><mi>des</mi></math></span>) and the major index (<span><math><mi>maj</mi></math></span>), Rawlings introduced the notions of the <em>r</em>-descent number (<span><math><mi>r</mi><mrow><mi>des</mi></mrow></math></span>) and the <em>r</em>-major index (<span><math><mi>r</mi><mrow><mi>maj</mi></mrow></math></span>) for a given positive integer <em>r</em>. A pair <span><math><mo>(</mo><msub><mrow><mi>st</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>st</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span> of permutation statistics is said to be <em>r</em>-Euler-Mahonian if <span><math><mo>(</mo><mrow><mi>s</mi><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow><mo>,</mo><mrow><mi>s</mi><msub><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msub></mrow><mo>)</mo></math></span> and <span><math><mo>(</mo><mi>r</mi><mrow><mi>des</mi></mrow><mo>,</mo><mi>r</mi><mrow><mi>maj</mi></mrow><mo>)</mo></math></span> are equidistributed over the set <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> of all permutations of <span><math><mo>{</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>n</mi><mo>}</mo></math></span>. The main objective of this paper is to confirm a recent conjecture posed by Liu which asserts that <span><math><mo>(</mo><mi>g</mi><msub><mrow><mi>exc</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>,</mo><mi>g</mi><msub><mrow><mi>den</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>)</mo></math></span> is <span><math><mo>(</mo><mi>g</mi><mo>+</mo><mi>ℓ</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span>-Euler-Mahonian for all positive integers <em>g</em> and <em>ℓ</em>, where <span><math><mi>g</mi><msub><mrow><mi>exc</mi></mrow><mrow><mi>ℓ</mi></mrow></msub></math></span> denotes the <em>g</em>-gap <em>ℓ</em>-level excedance number and <span><math><mi>g</mi><msub><mrow><mi>den</mi></mrow><mrow><mi>ℓ</mi></mrow></msub></math></span> denotes the <em>g</em>-gap <em>ℓ</em>-level Denert's statistic. This is accomplished via a bijective proof of the equidistribution of <span><math><mo>(</mo><mi>g</mi><msub><mrow><mi>exc</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>,</mo><mi>g</mi><msub><mrow><mi>den</mi></mrow><mrow><mi>ℓ</mi></mrow></msub><mo>)</mo></math></span> and <span><math><mo>(</mo><mi>r</mi><mrow><mi>des</mi></mrow><mo>,</mo><mi>r</mi><mrow><mi>maj</mi></mrow><mo>)</mo></math></span> where <span><math><mi>r</mi><mo>=</mo><mi>g</mi><mo>+</mo><mi>ℓ</mi><mo>−</mo><mn>1</mn></math></span>. Setting <span><math><mi>g</mi><mo>=</mo><mi>ℓ</mi><mo>=</mo><mn>1</mn></math></span>, our result recovers the equidistribution of <span><math><mo>(</mo><mrow><mi>des</mi></mrow><mo>,</mo><mrow><mi>maj</mi></mrow><mo>)</mo></math></span> and <span><math><mo>(</mo><mrow><mi>exc</mi></mrow><mo>,</mo><mrow><mi>den</mi></mrow><mo>)</mo></math></span>, which was first conjectured by Denert and proved by Foata
作为下降数(des)和主索引(maj)的自然推广,Rawlings引入了给定正整数r的r-下降数(rdes)和r-主索引(rmaj)的概念。如果(st1,st2)和(rdes,rmaj)在{1,2,…,n}的所有排列的集合Sn上是均匀分布的,那么一对(st1,st2)排列统计量就是r- euler - mahonian。本文的主要目的是证实Liu最近提出的一个猜想,即对于所有正整数g和r, (gexc r,gden r)是(g+ r−1)-Euler-Mahonian,其中gexc r表示g-gap r -level的超越数,gden r表示g-gap r -level的Denert's统计量。这是通过客观证明(gexc r,gden r)和(rdes,rmaj)的均匀分布来实现的,其中r=g+ r−1。设g= r =1,我们的结果恢复了(des,maj)和(exc,den)的均匀分布,这是由Denert首先推测并由Foata和Zeilberger证明的。我们的第二个主要结果与(geexc r,gdeng+ r)的类似结果有关,该结果表明(geexc r,gdeng+ r)对于所有正整数g和r都是(g+ r−1)-欧拉-马霍尼量。
{"title":"Further results on r-Euler-Mahonian statistics","authors":"Kaimei Huang,&nbsp;Sherry H.F. Yan","doi":"10.1016/j.aam.2025.102882","DOIUrl":"10.1016/j.aam.2025.102882","url":null,"abstract":"&lt;div&gt;&lt;div&gt;As natural generalizations of the descent number (&lt;span&gt;&lt;math&gt;&lt;mi&gt;des&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;) and the major index (&lt;span&gt;&lt;math&gt;&lt;mi&gt;maj&lt;/mi&gt;&lt;/math&gt;&lt;/span&gt;), Rawlings introduced the notions of the &lt;em&gt;r&lt;/em&gt;-descent number (&lt;span&gt;&lt;math&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;mrow&gt;&lt;mi&gt;des&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;) and the &lt;em&gt;r&lt;/em&gt;-major index (&lt;span&gt;&lt;math&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;mrow&gt;&lt;mi&gt;maj&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;) for a given positive integer &lt;em&gt;r&lt;/em&gt;. A pair &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;st&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;st&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;/math&gt;&lt;/span&gt; of permutation statistics is said to be &lt;em&gt;r&lt;/em&gt;-Euler-Mahonian if &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;s&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;t&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;mo&gt;,&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;s&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;t&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;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;mrow&gt;&lt;mi&gt;des&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;mrow&gt;&lt;mi&gt;maj&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; are equidistributed over the set &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; of all permutations of &lt;span&gt;&lt;math&gt;&lt;mo&gt;{&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;mo&gt;,&lt;/mo&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;/math&gt;&lt;/span&gt;. The main objective of this paper is to confirm a recent conjecture posed by Liu which asserts that &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;g&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;exc&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;ℓ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;g&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;den&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;ℓ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; is &lt;span&gt;&lt;math&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;mn&gt;1&lt;/mn&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;-Euler-Mahonian for all positive integers &lt;em&gt;g&lt;/em&gt; and &lt;em&gt;ℓ&lt;/em&gt;, where &lt;span&gt;&lt;math&gt;&lt;mi&gt;g&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;exc&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;ℓ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; denotes the &lt;em&gt;g&lt;/em&gt;-gap &lt;em&gt;ℓ&lt;/em&gt;-level excedance number and &lt;span&gt;&lt;math&gt;&lt;mi&gt;g&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;den&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;ℓ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; denotes the &lt;em&gt;g&lt;/em&gt;-gap &lt;em&gt;ℓ&lt;/em&gt;-level Denert's statistic. This is accomplished via a bijective proof of the equidistribution of &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;g&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;exc&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;ℓ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;g&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;den&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;ℓ&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;mrow&gt;&lt;mi&gt;des&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mi&gt;r&lt;/mi&gt;&lt;mrow&gt;&lt;mi&gt;maj&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; where &lt;span&gt;&lt;math&gt;&lt;mi&gt;r&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;mn&gt;1&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;. Setting &lt;span&gt;&lt;math&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;mn&gt;1&lt;/mn&gt;&lt;/math&gt;&lt;/span&gt;, our result recovers the equidistribution of &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;des&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;maj&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;exc&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;,&lt;/mo&gt;&lt;mrow&gt;&lt;mi&gt;den&lt;/mi&gt;&lt;/mrow&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/math&gt;&lt;/span&gt;, which was first conjectured by Denert and proved by Foata ","PeriodicalId":50877,"journal":{"name":"Advances in Applied Mathematics","volume":"167 ","pages":"Article 102882"},"PeriodicalIF":1.0,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143686514","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