Alphabetic points in compositions and words

IF 0.3 Q4 MATHEMATICS, APPLIED Discrete Mathematics and Applications Pub Date : 2021-08-01 DOI:10.1515/dma-2021-0021
M. Archibald, A. Blecher, A. Knopfmacher
{"title":"Alphabetic points in compositions and words","authors":"M. Archibald, A. Blecher, A. Knopfmacher","doi":"10.1515/dma-2021-0021","DOIUrl":null,"url":null,"abstract":"Abstract We use generating functions to account for alphabetic points (or the lack thereof) in compositions and words. An alphabetic point is a value j such that all the values to its left are not larger than j and all the values to its right are not smaller than j. We also provide the asymptotics for compositions and words which have no alphabetic points, as the size tends to infinity. This is achieved by the construction of upper and lower bounds which converge to each other, and in the latter case by probabilistic arguments.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2021-0021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 3

Abstract

Abstract We use generating functions to account for alphabetic points (or the lack thereof) in compositions and words. An alphabetic point is a value j such that all the values to its left are not larger than j and all the values to its right are not smaller than j. We also provide the asymptotics for compositions and words which have no alphabetic points, as the size tends to infinity. This is achieved by the construction of upper and lower bounds which converge to each other, and in the latter case by probabilistic arguments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
作文和单词中的字母点
我们使用生成函数来解释作文和单词中的字母点(或缺少字母点)。字母点是一个值j,使得它左边的所有值都不大于j,它右边的所有值都不小于j。我们还提供了没有字母点的组合和单词的渐近性,因为大小趋于无穷大。这是通过构造彼此收敛的上界和下界来实现的,在后一种情况下通过概率论证来实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.60
自引率
20.00%
发文量
29
期刊介绍: The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
期刊最新文献
Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model Propagation criterion for monotone Boolean functions with least vector support set of 1 or 2 elements On the complexity of implementation of a system of three monomials of two variables by composition circuits Inverse homomorphisms of finite groups On the approximation of high-order binary Markov chains by parsimonious models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1