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. Asymptotics of Decom ...
Conference paper

Asymptotics of Decomposable Combinatorial Structures of Alg-Log Type With Positive Log Exponent

Zhicheng Gao (1), David Laferrière (1), Daniel Panario (1)
(1) School of Mathematics and Statistics [Ottawa]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2009
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
Proceedings
DOI
10.46298/dmtcs.2798
License
https://about.hal.science/hal-authorisation-v1
Indicators
541
Views
456
Downloads

Asymptotics of Decomposable Combinatorial Structures of Alg-Log Type With Positive Log Exponent

Zhicheng Gao (1), David Laferrière (1), Daniel Panario (1)
(1) School of Mathematics and Statistics [Ottawa]
Abstract
We consider the multiset construction of decomposable structures with component generating function $C(z)$ of alg-log type, $\textit{i.e.}$, $C(z) = (1-z)^{-\alpha} (\log \frac{1}{ 1-z})^{\beta}$. We provide asymptotic results for the number of labeled objects of size $n$ in the case when $\alpha$ is positive and $\beta$ is positive and in the case $\alpha = 0$ and $\beta \geq 2$. The case $0<-\alpha <1$ and any $\beta$ and the case $\alpha > 0$ and $\beta = 0$ have been treated in previous papers. Our results extend previous work of Wright.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • decomposable structures
  • generating functions
  • alg-log type
  • analytic combinatorics
  • saddle point method
Preview
Loading PDF preview...