Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Probabilistic Analys ...
Article

Probabilistic Analysis of Carlitz Compositions

Guy Louchard (1) (2), Helmut Prodinger (3)
(1) Université libre de Bruxelles
(2) Université libre de Bruxelles = Free University of Brussels
(3) School of Mathematics [Johannesburg]
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2002
Last modified on
March 31, 2025
Volume 5
vol. 5
DOI
10.46298/dmtcs.302
License
https://about.hal.science/hal-authorisation-v1
Indicators
669
Views
700
Downloads

Probabilistic Analysis of Carlitz Compositions

Guy Louchard (1) (2), Helmut Prodinger (3)
(1) Université libre de Bruxelles
(2) Université libre de Bruxelles = Free University of Brussels
(3) School of Mathematics [Johannesburg]
Abstract
Using generating functions and limit theorems, we obtain a stochastic description of Carlitz compositions of large integer n (i.e. compositions two successive parts of which are different). We analyze: the number M of parts, the number of compositions T(m,n) with m parts, the distribution of the last part size, the correlation between two successive parts, leading to a Markov chain. We describe also the associated processes and the limiting trajectories, the width and thickness of a composition. We finally present a typical simulation. The limiting processes are characterized by Brownian Motion and some discrete distributions.
Keywords
English
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Italian
  • Carlitz compositions
Cited by

Source: OpenCitations

  • Tight Markov chains and random compositions

    arXiv (Cornell University)

    Authors : Boris Pittel ORCID

    Journal reference : Volume 40, 2012, pp.

    DOI : 10.1214/11-aop656
  • Longest run of equal parts in a random integer composition

    Discrete Mathematics

    Authors : Ayla Gafni ORCID

    Journal reference : Volume 338, 2014, pp. 236-247

    DOI : 10.1016/j.disc.2014.10.003
  • Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis

    Theoretical Computer Science

    Authors : Guy Louchard, Helmut Prodinger ORCID

    Journal reference : Volume 304, 2003, pp. 59-86

    DOI : 10.1016/s0304-3975(03)00051-3
  • q-Enumeration of words by their total variation

    Discrete Mathematics & Theoretical Computer Science

    Authors : Ligia Loreta Cristea ORCID, Helmut Prodinger ORCID

    Journal reference : Volume Vol. 12 no. 3, 2011, pp.

    DOI : 10.46298/dmtcs.477
Preview
Loading PDF preview...