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 sever ...
Conference paper

Asymptotics of several-partition Hurwitz numbers

Marc Sage (1)
(1) Laboratoire d'Informatique Gaspard-Monge
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2010
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Proceedings
DOI
10.46298/dmtcs.2958
License
https://about.hal.science/hal-authorisation-v1
Indicators
548
Views
921
Downloads

Asymptotics of several-partition Hurwitz numbers

Marc Sage (1)
(1) Laboratoire d'Informatique Gaspard-Monge
Abstract
English
We derive in this paper the asymptotics of several-partition Hurwitz numbers, relying on a theorem of Kazarian for the one-partition case and on an induction carried on by Zvonkine. Essentially, the asymptotics for several partitions is the same as the one-partition asymptotics obtained by concatenating the partitions.
French
Dans cet article, nous donnons l'asymptotique générale des nombres de Hurwitz à plusieurs partitions, s'appuyant sur un théorème de Kazarian pour le cas d'une partition et s'inspirant d'une récurrence menée par Zvonkine. En substance, l'asymptotique pour plusieurs partitions est la même que celle à une partition obtenue en concaténant les partitions.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Hurwitz numbers
  • asymptotics
  • many partitions
  • transitive factorisations
Preview
Loading PDF preview...