发布求助
文献互助 智能选刊 最新文献

Annals of Combinatorics最新文献

筛选
英文 中文
Zeta Functions of Geometrically Finite Graphs of Groups 几何有限群图的Zeta函数
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-05-07 DOI: 10.1007/s00026-025-00759-w
Soonki Hong, Sanghoon Kwon
{"title":"Zeta Functions of Geometrically Finite Graphs of Groups","authors":"Soonki Hong,&nbsp;Sanghoon Kwon","doi":"10.1007/s00026-025-00759-w","DOIUrl":"10.1007/s00026-025-00759-w","url":null,"abstract":"<div><p>In this paper, we explore the properties of zeta functions associated with infinite graphs of groups that arise as quotients of cuspidal tree lattices, including all non-uniform arithmetic quotients of the tree of rank-one Lie groups over local fields. Through various examples, we illustrate pairs of non-isomorphic cuspidal tree lattices with the same Ihara zeta function. In addition, we analyze the spectral behavior of a sequence of graphs of groups whose pole-free regions of zeta functions converge towards 0, which also presents an example of arbitrary small exponential error term in counting geodesic formula.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 4","pages":"995 - 1018"},"PeriodicalIF":0.7,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145435829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Equitable and List Equitable Colorings of Planar Graphs Without 5-Cycles 无5环平面图的公平着色与列表公平着色
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-04-30 DOI: 10.1007/s00026-025-00748-z
Aijun Dong, Wenwen Zhang
{"title":"Equitable and List Equitable Colorings of Planar Graphs Without 5-Cycles","authors":"Aijun Dong,&nbsp;Wenwen Zhang","doi":"10.1007/s00026-025-00748-z","DOIUrl":"10.1007/s00026-025-00748-z","url":null,"abstract":"<div><p>A graph <i>G</i> is <i>k</i> list equitably colorable, if for any given <i>k</i>-uniform list assignment <i>L</i>, <i>G</i> is <i>L</i>-colorable and each color appears on at most <span>(lceil frac{|V(G)|}{k}rceil )</span> vertices. Kostochka et al. conjectured that if <i>G</i> is a connected graph with maximum degree at least 3, then <i>G</i> is <span>(Delta (G))</span> list equitably colorable, unless <i>G</i> is a complete graph or is <span>(K_{k,k})</span> for some odd <i>k</i>. An equitable <i>k</i>-coloring <i>c</i> of <i>G</i> is a mapping <i>c</i> from <i>V</i>(<i>G</i>) to <span>([k]={1,2,ldots ,k})</span> such that <span>(c(u)ne c(v))</span> for each <span>(uvin E(G))</span>, and for each <span>(k_i)</span>, <span>(k_j in [k])</span>, <span>(||{v|c(v)=k_i}|-|{w|c(w)=k_j}||le 1)</span>. Chen et al. conjectured that each connected graph with maximum degree <span>(Delta )</span> that is different from the complete graph <span>(K_{Delta +1})</span>, the complete bipartite graph <span>(K_{Delta , Delta })</span> and an odd cycle admits an equitable coloring with <span>(Delta )</span> colors. In this paper, we prove that if <i>G</i> is a planar graph without 5-cycles, then <i>G</i> is <i>k</i> list equitably colorable and equitably <i>k</i>-colorable where <span>(kge max {Delta (G),7})</span>.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 3","pages":"637 - 656"},"PeriodicalIF":0.7,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145037110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Moments of Colored Permutation Statistics on Conjugacy Classes 共轭类上有色置换统计量的矩
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-04-21 DOI: 10.1007/s00026-025-00757-y
Jesse Campion Loth, Michael Levet, Kevin Liu, Sheila Sundaram, Mei Yin
{"title":"Moments of Colored Permutation Statistics on Conjugacy Classes","authors":"Jesse Campion Loth,&nbsp;Michael Levet,&nbsp;Kevin Liu,&nbsp;Sheila Sundaram,&nbsp;Mei Yin","doi":"10.1007/s00026-025-00757-y","DOIUrl":"10.1007/s00026-025-00757-y","url":null,"abstract":"<div><p>In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups <span>({mathfrak {S}}_{n,r}=mathbb {Z}_rwr {mathfrak {S}}_n)</span>. We first show that any fixed moment of a statistic coincides on all conjugacy classes where all cycles have sufficiently long length. Additionally, for permutation statistics that can be realized via a process we call order-invariant extension, these moments are polynomials in <i>n</i>. Finally, for the descent statistic on the hyperoctahedral group <span>(B_ncong {mathfrak {S}}_{n,2})</span>, we show that its distribution on conjugacy classes without short cycles satisfies a central limit theorem. Our results build on and generalize previous work of Fulman (J Comb Theory Ser A, 1998), Hamaker and Rhoades (arXiv, 2022), and Campion Loth et al. (arXiv, 2023). In particular, our techniques utilize the latter combinatorial framework.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 4","pages":"1109 - 1153"},"PeriodicalIF":0.7,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145435940","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
One-element Extensions of Hyperplane Arrangements 超平面排列的单元素扩展
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-04-12 DOI: 10.1007/s00026-025-00756-z
Hang Cai, Houshan Fu, Suijie Wang
{"title":"One-element Extensions of Hyperplane Arrangements","authors":"Hang Cai,&nbsp;Houshan Fu,&nbsp;Suijie Wang","doi":"10.1007/s00026-025-00756-z","DOIUrl":"10.1007/s00026-025-00756-z","url":null,"abstract":"<div><p>Let <span>({mathcal {A}})</span> be a hyperplane arrangement in the <i>d</i>-dimensional vector space <span>({mathbb {F}}^d)</span>. We study one-element extensions <span>({mathcal {A}}+H_{varvec{alpha },a})</span> of <span>({mathcal {A}})</span> for all <span>((varvec{alpha },a)in {mathbb {F}}^{d+1})</span>. Their intersection semi-lattices <span>(L({mathcal {A}}+H_{varvec{alpha },a}))</span> and other combinatorial invariants, including Whitney polynomials, characteristic polynomials, Whitney numbers and face numbers, can be classified by the intersection lattice of the induced adjoint arrangement of <span>({mathcal {A}})</span>. As a byproduct, we further establish order-preserving relations on these combinatorial invariants and obtain a decomposition formula for the characteristic polynomials <span>(chi ({mathcal {A}}+H_{varvec{alpha },a},t))</span>.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 4","pages":"955 - 978"},"PeriodicalIF":0.7,"publicationDate":"2025-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145435936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Perfect Matching Complexes of Polygonal Line Tilings 多边形线条平铺的完美匹配复合体
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-04-05 DOI: 10.1007/s00026-025-00755-0
Himanshu Chandrakar, Anurag Singh
{"title":"Perfect Matching Complexes of Polygonal Line Tilings","authors":"Himanshu Chandrakar,&nbsp;Anurag Singh","doi":"10.1007/s00026-025-00755-0","DOIUrl":"10.1007/s00026-025-00755-0","url":null,"abstract":"<div><p>The <i>perfect matching complex</i> of a simple graph <i>G</i> is a simplicial complex having facets (maximal faces) as the <i>perfect matchings</i> of <i>G</i>. This article discusses the perfect matching complex of polygonal line tilings and the <span>(left( 2 times nright) )</span>-grid graph in particular. We use tools from discrete Morse theory to show that the perfect matching complex of any polygonal line tiling is either contractible or homotopy equivalent to a wedge of spheres. While proving our results, we also characterize all the matchings of <span>(left( 2 times nright) )</span>-grid graph that cannot be extended to form a perfect matching.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 4","pages":"1211 - 1233"},"PeriodicalIF":0.7,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145435938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Genus Polynomials of Cubic Graphs with Non-real Roots 非实根三次图的属多项式
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-04-03 DOI: 10.1007/s00026-025-00754-1
MacKenzie Carr, Varpreet Dhaliwal, Bojan Mohar
{"title":"Genus Polynomials of Cubic Graphs with Non-real Roots","authors":"MacKenzie Carr,&nbsp;Varpreet Dhaliwal,&nbsp;Bojan Mohar","doi":"10.1007/s00026-025-00754-1","DOIUrl":"10.1007/s00026-025-00754-1","url":null,"abstract":"<div><p>Given a graph <i>G</i>, its genus polynomial is <span>(Gamma _G(x) = sum _{kge 0} g_k(G)x^k)</span>, where <span>(g_k(G))</span> is the number of two-cell embeddings of <i>G</i> in an orientable surface of genus <i>k</i>. The Log-Concavity Genus Distribution (LCGD) Conjecture states that the genus polynomial of every graph is log-concave. It was further conjectured by Stahl that the genus polynomial of every graph has only real roots, however, this was later disproved. We identify several examples of cubic graphs whose genus polynomials, in addition to having at least one non-real root, have a quadratic factor that is non-log-concave when factored over the real numbers.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 3","pages":"885 - 892"},"PeriodicalIF":0.7,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145037260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mixing on Generalized Associahedra 广义结合面上的混合
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-03-18 DOI: 10.1007/s00026-025-00750-5
William Chang, Colin Defant, Daniel Frishberg
{"title":"Mixing on Generalized Associahedra","authors":"William Chang,&nbsp;Colin Defant,&nbsp;Daniel Frishberg","doi":"10.1007/s00026-025-00750-5","DOIUrl":"10.1007/s00026-025-00750-5","url":null,"abstract":"<div><p>Eppstein and Frishberg recently proved that the mixing time for the simple random walk on the 1-skeleton of the associahedron is <span>(O(n^3log ^3 n))</span>. We obtain similar rapid mixing results for the simple random walks on the 1-skeleta of the type-<i>B</i> and type-<i>D</i> associahedra. We adapt Eppstein and Frishberg’s technique to obtain the same bound of <span>(O(n^3log ^3 n))</span> in type <i>B</i> and a bound of <span>(O(n^{13} log ^2 n))</span> in type <i>D</i>; in the process, we establish an expansion bound that is tight up to logarithmic factors in type <i>B</i>.\u0000</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 3","pages":"921 - 943"},"PeriodicalIF":0.7,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145037443","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Correction to: Positivity Among P-Partition Generating Functions 对p -分区生成函数间正性的修正
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-03-14 DOI: 10.1007/s00026-025-00744-3
Nathan R. T. Lesnevich, Peter R. W. McNamara
{"title":"Correction to: Positivity Among P-Partition Generating Functions","authors":"Nathan R. T. Lesnevich,&nbsp;Peter R. W. McNamara","doi":"10.1007/s00026-025-00744-3","DOIUrl":"10.1007/s00026-025-00744-3","url":null,"abstract":"<div><p>We correct a theorem on caterpillar posets in Lesnevich and McNamara (Ann Comb 26(1):171–204, 2022). In strengthening the hypotheses on the caterpillar posets we consider, we are also able to strengthen the conclusion on the types of positivity that result.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 3","pages":"947 - 953"},"PeriodicalIF":0.7,"publicationDate":"2025-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-025-00744-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145037375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimum Quantum Degrees with Maya Diagrams 最小量子度与玛雅图表
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-03-06 DOI: 10.1007/s00026-025-00749-y
Ryan M. Shifler
{"title":"Minimum Quantum Degrees with Maya Diagrams","authors":"Ryan M. Shifler","doi":"10.1007/s00026-025-00749-y","DOIUrl":"10.1007/s00026-025-00749-y","url":null,"abstract":"<div><p>We use Maya diagrams to refine the criterion by Fulton and Woodward for the smallest powers of the quantum parameter <i>q</i> that occur in a product of Schubert classes in the (small) quantum cohomology of partial flags. Our approach using Maya diagrams yields a combinatorial proof that the minimal quantum degrees are unique for partial flags. Furthermore, visual combinatorial rules are given to perform precise calculations.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 2","pages":"395 - 413"},"PeriodicalIF":0.7,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145162467","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Combinatorial Interpretation of the Series for Rogers–Ramanujan–Gordon Identities when (k=3) Rogers-Ramanujan-Gordon恒等式级数的组合解释 (k=3)
IF 0.7 4区 数学
Annals of Combinatorics Pub Date : 2025-02-26 DOI: 10.1007/s00026-025-00745-2
Yalçın Can Kılıç
{"title":"A Combinatorial Interpretation of the Series for Rogers–Ramanujan–Gordon Identities when (k=3)","authors":"Yalçın Can Kılıç","doi":"10.1007/s00026-025-00745-2","DOIUrl":"10.1007/s00026-025-00745-2","url":null,"abstract":"<div><p>In this paper, we give a new combinatorial interpretation for the Rogers–Ramanujan–Gordon partitions for <span>(k=3)</span>. Our interpretation is given by base partition and moves ideas. We conclude the paper with some research questions related to the generalization of this approach.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":"29 4","pages":"979 - 994"},"PeriodicalIF":0.7,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145435733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书