张量词（循环）中的降序和级别总数

IF 17.7 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY Accounts of Chemical Research Pub Date : 2024-04-04 DOI:10.47443/dml.2023.218

S. Fried, Toufik Mansour

{"title":"张量词（循环）中的降序和级别总数","authors":"S. Fried, Toufik Mansour","doi":"10.47443/dml.2023.218","DOIUrl":null,"url":null,"abstract":"We obtain an explicit formula for the total number of descents and levels in (cyclic) tensor words of arbitrary dimension. We also determine the maximal number of cyclic descents in cyclic tensor words. Furthermore, we establish a lower bound and an upper bound on the maximal number of descents in tensor words","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":"20 8","pages":""},"PeriodicalIF":17.7000,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The total number of descents and levels in (cyclic) tensor words\",\"authors\":\"S. Fried, Toufik Mansour\",\"doi\":\"10.47443/dml.2023.218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We obtain an explicit formula for the total number of descents and levels in (cyclic) tensor words of arbitrary dimension. We also determine the maximal number of cyclic descents in cyclic tensor words. Furthermore, we establish a lower bound and an upper bound on the maximal number of descents in tensor words\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":\"20 8\",\"pages\":\"\"},\"PeriodicalIF\":17.7000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.218\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.218","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

摘要

我们得到了任意维数的（循环）张量词的降序和级数总数的明确公式。我们还确定了循环张量词中循环级数的最大值。此外，我们还确定了张量词中最大降级数的下限和上限

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The total number of descents and levels in (cyclic) tensor words

We obtain an explicit formula for the total number of descents and levels in (cyclic) tensor words of arbitrary dimension. We also determine the maximal number of cyclic descents in cyclic tensor words. Furthermore, we establish a lower bound and an upper bound on the maximal number of descents in tensor words

求助全文

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

来源期刊

Accounts of Chemical Research 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.