Annals of Combinatorics最新文献

筛选
英文 中文
Combinatorics of Euclidean Spaces over Finite Fields 有限域上的欧几里得空间组合学
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-09-20 DOI: 10.1007/s00026-023-00661-3
Semin Yoo
{"title":"Combinatorics of Euclidean Spaces over Finite Fields","authors":"Semin Yoo","doi":"10.1007/s00026-023-00661-3","DOIUrl":"10.1007/s00026-023-00661-3","url":null,"abstract":"<div><p>The <i>q</i>-binomial coefficients are <i>q</i>-analogues of the binomial coefficients, counting the number of <i>k</i>-dimensional subspaces in the <i>n</i>-dimensional vector space <span>({mathbb {F}}^n_q)</span> over <span>({mathbb {F}}_{q}.)</span> In this paper, we define a Euclidean analogue of <i>q</i>-binomial coefficients as the number of <i>k</i>-dimensional subspaces which have an orthonormal basis in the quadratic space <span>(({mathbb {F}}_{q}^{n},x_{1}^{2}+x_{2}^{2}+cdots +x_{n}^{2}).)</span> We prove its various combinatorial properties compared with those of <i>q</i>-binomial coefficients. In addition, we formulate the number of subspaces of other quadratic types and study some related properties.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136263998","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
Combinatorics of Exterior Peaks on Pattern-Avoiding Symmetric Transversals 规避模式的对称横截面上的外峰组合学
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-09-15 DOI: 10.1007/s00026-023-00664-0
Robin D. P. Zhou, Sherry H. F. Yan
{"title":"Combinatorics of Exterior Peaks on Pattern-Avoiding Symmetric Transversals","authors":"Robin D. P. Zhou,&nbsp;Sherry H. F. Yan","doi":"10.1007/s00026-023-00664-0","DOIUrl":"10.1007/s00026-023-00664-0","url":null,"abstract":"<div><p>Let <span>(mathcal{S}mathcal{T}_{lambda }(tau ))</span> denote the set of symmetric transversals of a self-conjugate Young diagram <span>(lambda )</span> which avoid the permutation pattern <span>(tau )</span>. Given two permutations <span>(tau = tau _1tau _2ldots tau _n )</span> of <span>({1,2,ldots ,n})</span> and <span>(sigma =sigma _1sigma _2ldots sigma _m )</span> of <span>({1,2,ldots ,m})</span>, the <i>direct sum</i> of <span>(tau )</span> and <span>(sigma )</span>, denoted by <span>(tau oplus sigma )</span>, is the permutation <span>(tau _1tau _2ldots tau _n (sigma _1+n)(sigma _2+n)ldots (sigma _m+n))</span>. We establish an exterior peak set preserving bijection between <span>(mathcal{S}mathcal{T}_{lambda }(321oplus tau ))</span> and <span>(mathcal{S}mathcal{T}_{lambda }(213oplus tau ))</span> for any pattern <span>(tau )</span> and any self-conjugate Young diagram <span>(lambda )</span>. Our result is a refinement of part of a result of Bousquet-Mélou–Steingrímsson for pattern-avoiding symmetric transversals. As applications, we derive several enumerative results concerning pattern-avoiding reverse alternating involutions, including two conjectured equalities posed by Barnabei–Bonetti–Castronuovo–Silimbani.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00026-023-00664-0.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135395375","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
Some Consequences of the Valley Delta Conjectures 山谷三角洲猜想的一些结果
4区 数学
Annals of Combinatorics Pub Date : 2023-09-11 DOI: 10.1007/s00026-023-00663-1
Michele D’Adderio, Alessandro Iraci
{"title":"Some Consequences of the Valley Delta Conjectures","authors":"Michele D’Adderio, Alessandro Iraci","doi":"10.1007/s00026-023-00663-1","DOIUrl":"https://doi.org/10.1007/s00026-023-00663-1","url":null,"abstract":"Abstract Haglund et al. (Trans Am Math Soc 370(6):4029–4057, 2018) introduced their Delta conjectures , which give two different combinatorial interpretations of the symmetric function $$Delta '_{e_{n-k-1}} e_n$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:msubsup> <mml:mi>Δ</mml:mi> <mml:msub> <mml:mi>e</mml:mi> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>-</mml:mo> <mml:mi>k</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msub> <mml:mo>′</mml:mo> </mml:msubsup> <mml:msub> <mml:mi>e</mml:mi> <mml:mi>n</mml:mi> </mml:msub> </mml:mrow> </mml:math> in terms of rise-decorated or valley-decorated labelled Dyck paths. While the rise version has been recently proved (D’Adderio and Mellit in Adv Math 402:108342, 2022; Blasiak et al. in A Proof of the Extended Delta Conjecture, arXiv:2102.08815 , 2021), not much is known about the valley version. In this work, we prove the Schröder case of the valley Delta conjecture, the Schröder case of its square version (Iraci and Wyngaerd in Ann Combin 25(1):195–227, 2021), and the Catalan case of its extended version (Qiu and Wilson in J Combin Theory Ser A 175:105271, 2020). Furthermore, assuming the symmetry of (a refinement of) the combinatorial side of the extended valley Delta conjecture, we deduce also the Catalan case of its square version (Iraci and Wyngaerd 2021).","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135981269","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 Conjectured Formula for the Rational (varvec{q},varvec{t})-Catalan Polynomial 有理$$varvec{q},varvec{t}$$-Catalan多项式的一个猜想公式
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-09-07 DOI: 10.1007/s00026-023-00662-2
Graham Hawkes
{"title":"A Conjectured Formula for the Rational (varvec{q},varvec{t})-Catalan Polynomial","authors":"Graham Hawkes","doi":"10.1007/s00026-023-00662-2","DOIUrl":"10.1007/s00026-023-00662-2","url":null,"abstract":"<div><p>We conjecture a formula for the rational <i>q</i>, <i>t</i>-Catalan polynomial <span>({mathcal {C}}_{r/s})</span> that is symmetric in <i>q</i> and <i>t</i> by definition. The conjecture posits that <span>({mathcal {C}}_{r/s})</span> can be written in terms of symmetric monomial strings indexed by maximal Dyck paths. We show that for any finite <span>(d^*)</span>, giving a combinatorial proof of our conjecture on the infinite set of functions <span>({ {mathcal {C}}_{r/s}^d: requiv 1 mod s, ,,, d le d^*})</span> is equivalent to a finite counting problem.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42268765","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
On Distance-Balanced Generalized Petersen Graphs 关于距离平衡广义Petersen图
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-08-17 DOI: 10.1007/s00026-023-00660-4
Gang Ma, Jianfeng Wang, Sandi Klavžar
{"title":"On Distance-Balanced Generalized Petersen Graphs","authors":"Gang Ma,&nbsp;Jianfeng Wang,&nbsp;Sandi Klavžar","doi":"10.1007/s00026-023-00660-4","DOIUrl":"10.1007/s00026-023-00660-4","url":null,"abstract":"<div><p>A connected graph <i>G</i> of diameter <span>(textrm{diam}(G) ge ell )</span> is <span>(ell )</span>-distance-balanced if <span>(|W_{xy}|=|W_{yx}|)</span> for every <span>(x,yin V(G))</span> with <span>(d_{G}(x,y)=ell )</span>, where <span>(W_{xy})</span> is the set of vertices of <i>G</i> that are closer to <i>x</i> than to <i>y</i>. We prove that the generalized Petersen graph <i>GP</i>(<i>n</i>, <i>k</i>) is <span>(textrm{diam}(GP(n,k)))</span>-distance-balanced provided that <i>n</i> is large enough relative to <i>k</i>. This partially solves a conjecture posed by Miklavič and Šparl (Discrete Appl Math 244:143–154, 2018). We also determine <span>(textrm{diam}(GP(n,k)))</span> when <i>n</i> is large enough relative to <i>k</i>.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47014638","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 Murnaghan–Nakayama Rule for Grothendieck Polynomials of Grassmannian Type Grassmann型Grothendieck多项式的Murnaghan–Nakayama规则
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-07-25 DOI: 10.1007/s00026-023-00659-x
Duc-Khanh Nguyen, Dang Tuan Hiep, Tran Ha Son, Do Le Hai Thuy
{"title":"A Murnaghan–Nakayama Rule for Grothendieck Polynomials of Grassmannian Type","authors":"Duc-Khanh Nguyen,&nbsp;Dang Tuan Hiep,&nbsp;Tran Ha Son,&nbsp;Do Le Hai Thuy","doi":"10.1007/s00026-023-00659-x","DOIUrl":"10.1007/s00026-023-00659-x","url":null,"abstract":"<div><p>We consider the Grothendieck polynomials appearing in the <i>K</i>-theory of Grassmannians, which are analogs of Schur polynomials. This paper aims to establish a version of the Murnaghan–Nakayama rule for Grothendieck polynomials of the Grassmannian type. This rule allows us to express the product of a Grothendieck polynomial with a power-sum symmetric polynomial into a linear combination of other Grothendieck polynomials.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44955454","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
Combinatorial Properties of Three Classical Truncated Theta Series Theorems 三个经典截断Theta级数定理的组合性质
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-07-03 DOI: 10.1007/s00026-023-00658-y
Andrew Y. Z. Wang, Ang Xiao
{"title":"Combinatorial Properties of Three Classical Truncated Theta Series Theorems","authors":"Andrew Y. Z. Wang,&nbsp;Ang Xiao","doi":"10.1007/s00026-023-00658-y","DOIUrl":"10.1007/s00026-023-00658-y","url":null,"abstract":"<div><p>In this paper, we focus on the truncations of three classical theta series of Euler and Gauss, and analyze their combinatorial properties which play a key role in proving these truncated identities. Several interesting partition identities are established bijectively.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45469629","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
On the Compatible Sets Expansion of the Tutte Polynomial 关于Tutte多项式的相容集展开
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-06-30 DOI: 10.1007/s00026-023-00657-z
Laura Pierson
{"title":"On the Compatible Sets Expansion of the Tutte Polynomial","authors":"Laura Pierson","doi":"10.1007/s00026-023-00657-z","DOIUrl":"10.1007/s00026-023-00657-z","url":null,"abstract":"<div><p>Kochol [6] gave a new expansion formula for the Tutte polynomial of a matroid using the notion of <i>compatible sets</i>, and asked how this expansion relates to the internal-external activities formula. Here, we provide an answer, which is obtained as a special case of a generalized version of the expansion formula to Las Vergnas’s trivariate Tutte polynomials of matroid perspectives [10]. The same generalization to matroid perspectives and bijection with activities have been independently proven by Kochol in [5] and [7] in parallel with this work, but using different methods. Kochol proves both results recursively using the contraction-deletion relations, whereas we give a more direct proof of the bijection and use that to deduce the compatible sets expansion formula from Las Vergnas’s activities expansion.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47885699","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
Asymptotics of Multivariate Sequences IV: Generating Functions with Poles on a Hyperplane Arrangement 多变量序列渐近论 IV:超平面排列上有极点的生成函数
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-06-13 DOI: 10.1007/s00026-023-00654-2
Yuliy Baryshnikov, Stephen Melczer, Robin Pemantle
{"title":"Asymptotics of Multivariate Sequences IV: Generating Functions with Poles on a Hyperplane Arrangement","authors":"Yuliy Baryshnikov,&nbsp;Stephen Melczer,&nbsp;Robin Pemantle","doi":"10.1007/s00026-023-00654-2","DOIUrl":"10.1007/s00026-023-00654-2","url":null,"abstract":"<div><p>Let <span>(F(z_1,dots ,z_d))</span> be the quotient of an analytic function with a product of linear functions. Working in the framework of analytic combinatorics in several variables, we compute asymptotic formulae for the Taylor coefficients of <i>F</i> using multivariate residues and saddle-point approximations. Because the singular set of <i>F</i> is the union of hyperplanes, we are able to make explicit the topological decompositions which arise in the multivariate singularity analysis. In addition to effective and explicit asymptotic results, we provide the first results on transitions between different asymptotic regimes, and provide the first software package to verify and compute asymptotics in non-smooth cases of analytic combinatorics in several variables. It is also our hope that this paper will serve as an entry to the more advanced corners of analytic combinatorics in several variables for combinatorialists.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136066722","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
The Space of Equidistant Phylogenetic Cactuses 等距系统发育仙人掌的空间
IF 0.6 4区 数学
Annals of Combinatorics Pub Date : 2023-06-09 DOI: 10.1007/s00026-023-00656-0
Katharina T. Huber, Vincent Moulton, Megan Owen, Andreas Spillner, Katherine St. John
{"title":"The Space of Equidistant Phylogenetic Cactuses","authors":"Katharina T. Huber,&nbsp;Vincent Moulton,&nbsp;Megan Owen,&nbsp;Andreas Spillner,&nbsp;Katherine St. John","doi":"10.1007/s00026-023-00656-0","DOIUrl":"10.1007/s00026-023-00656-0","url":null,"abstract":"<div><p>An <i>equidistant</i> <i>X</i>-<i>cactus</i> is a type of rooted, arc-weighted, directed acyclic graph with leaf set <i>X</i>, that is used in biology to represent the evolutionary history of a set <span>(X)</span> of species. In this paper, we introduce and investigate the space of equidistant <i>X</i>-cactuses. This space contains, as a subset, the space of ultrametric trees on <i>X</i> that was introduced by Gavryushkin and Drummond. We show that equidistant-cactus space is a CAT(0)-metric space which implies, for example, that there are unique geodesic paths between points. As a key step to proving this, we present a combinatorial result concerning <i>ranked</i> rooted <i>X</i>-cactuses. In particular, we show that such graphs can be encoded in terms of a pairwise compatibility condition arising from a poset of collections of pairs of subsets of <span>(X)</span> that satisfy certain set-theoretic properties. As a corollary, we also obtain an encoding of ranked, rooted <i>X</i>-trees in terms of partitions of <i>X</i>, which provides an alternative proof that the space of ultrametric trees on <i>X</i> is CAT(0). We expect that our results will provide the basis for novel ways to perform statistical analyses on collections of equidistant <i>X</i>-cactuses, as well as new directions for defining and understanding spaces of more general, arc-weighted phylogenetic networks.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10904525/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45787472","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
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学术文献互助群
群 号:481959085
Book学术官方微信