Asymptotic probability of irreducibles II: sequence

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Monteil, Thierry, Nurligareev, Khaydar
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912736152125440
author Monteil, Thierry
Nurligareev, Khaydar
author_facet Monteil, Thierry
Nurligareev, Khaydar
contents This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms of combinatorial construction SEQ, labeled or unlabeled. We show that for rapidly growing (i.e. gargantuan) combinatorial classes, the coefficients that appear in this expansion are integers and can be interpreted as linear combinations of the counting sequences of three closely related combinatorial classes. We apply this general asymptotic result to labeled and unlabeled (multi-)tournaments, as well as to (multi-)permutations and (multi-)matchings. We also explore the limits of our approach with respect to other combinatorial constructions.
format Preprint
id arxiv_https___arxiv_org_abs_2511_23296
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Asymptotic probability of irreducibles II: sequence
Monteil, Thierry
Nurligareev, Khaydar
Combinatorics
05C30, 05C20, 05C80, 05A10, 05A15, 05A16, 60C05, 60F99, 68Q87
G.2.1; G.2.2; G.3
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms of combinatorial construction SEQ, labeled or unlabeled. We show that for rapidly growing (i.e. gargantuan) combinatorial classes, the coefficients that appear in this expansion are integers and can be interpreted as linear combinations of the counting sequences of three closely related combinatorial classes. We apply this general asymptotic result to labeled and unlabeled (multi-)tournaments, as well as to (multi-)permutations and (multi-)matchings. We also explore the limits of our approach with respect to other combinatorial constructions.
title Asymptotic probability of irreducibles II: sequence
topic Combinatorics
05C30, 05C20, 05C80, 05A10, 05A15, 05A16, 60C05, 60F99, 68Q87
G.2.1; G.2.2; G.3
url https://arxiv.org/abs/2511.23296