Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

An asymptotic enumeration method

From MaRDI portal
Publication:5116669
Jump to:navigation, search

zbMATH Open1445.05013MaRDI QIDQ5116669FDOQ5116669


Authors: Eugenijus Manstavičius Edit this on Wikidata


Publication date: 18 August 2020





Recommendations

  • scientific article; zbMATH DE number 863491
  • scientific article; zbMATH DE number 4092465
  • On an asymptotic method in enumeration
  • Remarks on an asymptotic method in combinatorics
  • Some asymptotic results useful in enumeration problems


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Power series (including lacunary series) in one complex variable (30B10) Tauberian theorems (11M45)



Cited In (4)

  • Remarks on an asymptotic method in combinatorics
  • Construction of the beta distributions using the random permutation divisors
  • When do combinatorial structures obey the Poisson-Dirichlet law?
  • The Enumeration Methods of Redfield





This page was built for publication: An asymptotic enumeration method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116669)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5116669&oldid=19643487"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 13:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki