The Dumont Ansatz for the Eulerian Polynomials, Peak Polynomials and Derivative Polynomials

IF 0.6 4区 数学 Q4 MATHEMATICS, APPLIED
William Y. C. Chen, Amy M. Fu
{"title":"The Dumont Ansatz for the Eulerian Polynomials, Peak Polynomials and Derivative Polynomials","authors":"William Y. C. Chen,&nbsp;Amy M. Fu","doi":"10.1007/s00026-022-00609-z","DOIUrl":null,"url":null,"abstract":"<div><p>We observe that three context-free grammars of Dumont can be brought to a common ground, via the idea of transformations of grammars, proposed by Ma–Ma–Yeh. Then we develop a unified perspective to investigate several combinatorial objects in connection with the bivariate Eulerian polynomials. We call this approach the Dumont ansatz. As applications, we provide grammatical treatments, in the spirit of the symbolic method, of relations on the Springer numbers, the Euler numbers, the three kinds of peak polynomials, an identity of Petersen, and the two kinds of derivative polynomials, introduced by Knuth–Buckholtz and Carlitz–Scoville, and later by Hoffman in a broader context. We obtain a convolution formula on the left peak polynomials, leading to the Gessel formula. In this framework, we come to the combinatorial interpretations of the derivative polynomials due to Josuat-Vergès.</p></div>","PeriodicalId":50769,"journal":{"name":"Annals of Combinatorics","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2022-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00026-022-00609-z","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 3

Abstract

We observe that three context-free grammars of Dumont can be brought to a common ground, via the idea of transformations of grammars, proposed by Ma–Ma–Yeh. Then we develop a unified perspective to investigate several combinatorial objects in connection with the bivariate Eulerian polynomials. We call this approach the Dumont ansatz. As applications, we provide grammatical treatments, in the spirit of the symbolic method, of relations on the Springer numbers, the Euler numbers, the three kinds of peak polynomials, an identity of Petersen, and the two kinds of derivative polynomials, introduced by Knuth–Buckholtz and Carlitz–Scoville, and later by Hoffman in a broader context. We obtain a convolution formula on the left peak polynomials, leading to the Gessel formula. In this framework, we come to the combinatorial interpretations of the derivative polynomials due to Josuat-Vergès.

Abstract Image

Eulerian多项式、Peak多项式和导数多项式的Dumont-Ansatz
我们观察到,通过马提出的语法转换思想,Dumont的三种上下文无关语法可以达成共识。然后,我们发展了一个统一的视角来研究与二元欧拉多项式有关的几个组合对象。我们称这种方法为杜蒙仿制品。作为应用,我们本着符号方法的精神,对Springer数、Euler数、三种峰值多项式、Petersen恒等式和两种导数多项式上的关系进行了语法处理,这些关系由Knuth–Buckholtz和Carlitz–Scoville介绍,后来由Hoffman在更广泛的背景下介绍。我们得到了左峰多项式的卷积公式,得到了Gessel公式。在这个框架中,我们得出了Josuat-Vergès对导数多项式的组合解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Annals of Combinatorics
Annals of Combinatorics 数学-应用数学
CiteScore
1.00
自引率
0.00%
发文量
56
审稿时长
>12 weeks
期刊介绍: Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. Special regard will be given to new developments and topics of current interest to the community represented by our editorial board. The scope of Annals of Combinatorics is covered by the following three tracks: Algebraic Combinatorics: Enumerative combinatorics, symmetric functions, Schubert calculus / Combinatorial Hopf algebras, cluster algebras, Lie algebras, root systems, Coxeter groups / Discrete geometry, tropical geometry / Discrete dynamical systems / Posets and lattices Analytic and Algorithmic Combinatorics: Asymptotic analysis of counting sequences / Bijective combinatorics / Univariate and multivariable singularity analysis / Combinatorics and differential equations / Resolution of hard combinatorial problems by making essential use of computers / Advanced methods for evaluating counting sequences or combinatorial constants / Complexity and decidability aspects of combinatorial sequences / Combinatorial aspects of the analysis of algorithms Graphs and Matroids: Structural graph theory, graph minors, graph sparsity, decompositions and colorings / Planar graphs and topological graph theory, geometric representations of graphs / Directed graphs, posets / Metric graph theory / Spectral and algebraic graph theory / Random graphs, extremal graph theory / Matroids, oriented matroids, matroid minors / Algorithmic approaches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信