On the number of words with restrictions on the number of symbols

preprint2022arXivOpen access

Abstract

We show that, in an alphabet of nn symbols, the number of words of length nn whose number of different symbols is away from (1−1/e)n(1-1/e)n, which is the value expected by the Poisson distribution, has exponential decay in nn. We use Laplace's method for sums and known bounds of Stirling numbers of the second kind. We express our result in terms of inequalities.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.