On the number of words with restrictions on the number of symbols
From MaRDI portal
Publication:2078934
DOI10.1016/j.aam.2022.102321OpenAlexW3165840172MaRDI QIDQ2078934
Eda Cesaratto, Verónica Becher
Publication date: 4 March 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.12813
Poisson distributionStirling numbers of the second kindcombinatorics on wordsLaplace method for sums
Bell and Stirling numbers (11B73) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Combinatorial inequalities (05A20)
Cites Work
- Unnamed Item
- Unnamed Item
- Completely effective error bounds for Stirling numbers of the first and second kinds via Poisson approximation
- The discrete analogue of Laplace's method
- Stirling numbers of the second kind
- The number of increasing subsequences of the random permutation
- On the value set of small families of polynomials over a finite field. I
- Central and local limit theorems applied to asymptotic enumeration
- A Remark on Stirling's Formula
- Asymptotics of the Stirling numbers of the second kind revisited
- On stirling numbers of the second kind
This page was built for publication: On the number of words with restrictions on the number of symbols