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

引用次数: 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.

查看原文本刊更多论文

作文和单词中的字母点

我们使用生成函数来解释作文和单词中的字母点(或缺少字母点)。字母点是一个值j，使得它左边的所有值都不大于j，它右边的所有值都不小于j。我们还提供了没有字母点的组合和单词的渐近性，因为大小趋于无穷大。这是通过构造彼此收敛的上界和下界来实现的，在后一种情况下通过概率论证来实现。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Mathematics and Applications MATHEMATICS, APPLIED-

CiteScore

0.60

自引率

20.00%

发文量

期刊介绍： 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.