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

IF 1 Q1 MATHEMATICS Discrete Mathematics Letters 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":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"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\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47443/dml.2023.218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47443/dml.2023.218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","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

求助全文

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

来源期刊