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. Locally Restricted C ...
Conference paper

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness

Edward Bender (1), Rodney Canfield (2), Zhicheng Gao (3)
(1) Department of Mathematics [San Francisco]
(2) Department of Computer Science [Athens GA]
(3) School of Mathematics and Statistics [Ottawa]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2011
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)
Proceedings
DOI
10.46298/dmtcs.2997
License
https://about.hal.science/hal-authorisation-v1
Natural Sciences and Engineering Research Council of Canada
Indicators
687
Views
567
Downloads

Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness

Edward Bender (1), Rodney Canfield (2), Zhicheng Gao (3)
(1) Department of Mathematics [San Francisco]
(2) Department of Computer Science [Athens GA]
(3) School of Mathematics and Statistics [Ottawa]
Abstract
We define the notion of $t$-free for locally restricted compositions, which means roughly that if such a composition contains a part $c_i$ and nearby parts are at least $t$ smaller, then $c_i$ can be replaced by any larger part. Two well-known examples are Carlitz and alternating compositions. We show that large parts have asymptotically geometric distributions. This leads to asymptotically independent Poisson variables for numbers of various large parts. Based on this we obtain asymptotic formulas for the probability of being gap free and for the expected values of the largest part and number distinct parts, all accurate to $o(1)$.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • restricted compositions
  • largest part
  • distinct parts
  • gaps
Cited by

Source: OpenCitations

  • Part Sizes of Smooth Supercritical Compositional Structures

    Combinatorics Probability Computing

    Authors : EDWARD A. BENDER, ZHICHENG GAO ORCID

    Journal reference : Volume 23, 2014, pp. 686-716

    DOI : 10.1017/s0963548314000315
  • Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis

    SIAM Journal on Discrete Mathematics

    Authors : Clemens Heuberger ORCID, Daniel Krenn ORCID, Stephan Wagner ORCID

    Journal reference : Volume 29, 2015, pp. 1600-1653

    DOI : 10.1137/15m1017107
  • Locally restricted compositions over a finite group

    European Journal of Combinatorics

    Authors : Zhicheng Gao ORCID, Andrew MacFie

    Journal reference : Volume 97, 2021, pp. 103386

    DOI : 10.1016/j.ejc.2021.103386
Preview
Loading PDF preview...