倒置序列中的字母点和记录

IF 1 Q1 MATHEMATICS

Discrete Mathematics Letters Pub Date : 2022-07-22 DOI:10.47443/dml.2022.061

A. Blecher, A. Knopfmacher, T. Mansour

{"title":"倒置序列中的字母点和记录","authors":"A. Blecher, A. Knopfmacher, T. Mansour","doi":"10.47443/dml.2022.061","DOIUrl":null,"url":null,"abstract":"An alphabetic point in an inversion sequence is a value j where all the values l to its left satisfy l ≤ j and all the values r to its right satisfy r ≥ j . We study alphabetic points and records in inversion sequences of permutations and obtain formulae for the total numbers of alphabetic points, weak records, and strict records.","PeriodicalId":36023,"journal":{"name":"Discrete Mathematics Letters","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Alphabetic Points and Records in Inversion Sequences\",\"authors\":\"A. Blecher, A. Knopfmacher, T. Mansour\",\"doi\":\"10.47443/dml.2022.061\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An alphabetic point in an inversion sequence is a value j where all the values l to its left satisfy l ≤ j and all the values r to its right satisfy r ≥ j . We study alphabetic points and records in inversion sequences of permutations and obtain formulae for the total numbers of alphabetic points, weak records, and strict records.\",\"PeriodicalId\":36023,\"journal\":{\"name\":\"Discrete Mathematics Letters\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-07-22\",\"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.2022.061\",\"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.2022.061","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

反转序列中的字母点是一个值j，其中其左边的所有值l满足l≤j，其右边的所有值r满足r≥j。我们研究了排列反转序列中的字母点和记录，得到了字母点总数、弱记录总数和严格记录总数的公式。

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

查看原文本刊更多论文

Alphabetic Points and Records in Inversion Sequences

An alphabetic point in an inversion sequence is a value j where all the values l to its left satisfy l ≤ j and all the values r to its right satisfy r ≥ j . We study alphabetic points and records in inversion sequences of permutations and obtain formulae for the total numbers of alphabetic points, weak records, and strict records.

求助全文

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

来源期刊

Discrete Mathematics Letters Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

12 weeks