卡勒多项式

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2024-07-24 DOI:10.1016/j.disc.2024.114177

Giulio Cerbai, Anders Claesson

{"title":"卡勒多项式","authors":"Giulio Cerbai, Anders Claesson","doi":"10.1016/j.disc.2024.114177","DOIUrl":null,"url":null,"abstract":"<div><p>The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by linking Caylerian polynomials to Burge words and Burge matrices. The <em>γ</em>-nonnegativity of the two-sided Eulerian polynomials is reformulated in terms of Burge structures. Finally, Cayley permutations with a prescribed ascent set are shown to be counted by Burge matrices with fixed row sums.</p></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"347 12","pages":"Article 114177"},"PeriodicalIF":0.7000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Caylerian polynomials\",\"authors\":\"Giulio Cerbai, Anders Claesson\",\"doi\":\"10.1016/j.disc.2024.114177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by linking Caylerian polynomials to Burge words and Burge matrices. The <em>γ</em>-nonnegativity of the two-sided Eulerian polynomials is reformulated in terms of Burge structures. Finally, Cayley permutations with a prescribed ascent set are shown to be counted by Burge matrices with fixed row sums.</p></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"347 12\",\"pages\":\"Article 114177\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X2400308X\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X2400308X","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

欧拉多项式根据降序的数量枚举排列。我们开始研究 Cayley 排列的降序多项式，我们称之为 Caylerian 多项式。通过将 Caylerian 多项式与 Burge 词和 Burge 矩阵联系起来，一些经典结果得到了推广。两边欧拉多项式的γ非负性用伯格结构重新表述。最后，证明了具有规定上升集的 Cayley 置换可以用具有固定行和的 Burge 矩阵来计算。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Caylerian polynomials

The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by linking Caylerian polynomials to Burge words and Burge matrices. The γ-nonnegativity of the two-sided Eulerian polynomials is reformulated in terms of Burge structures. Finally, Cayley permutations with a prescribed ascent set are shown to be counted by Burge matrices with fixed row sums.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.