English
Related papers

Related papers: Asymptotic probability of irreducibles II: sequenc…

200 papers

In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…

Combinatorics · Mathematics 2026-05-26 Thierry Monteil , Khaydar Nurligareev

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

Combinatorics · Mathematics 2024-01-02 Thierry Monteil , Khaydar Nurligareev

We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irreducible. In both cases, we provide a combinatorial…

Combinatorics · Mathematics 2022-05-16 Thierry Monteil , Khaydar Nurligareev

In this paper we study the asymptotic of multiplicities of irreducible representations in large tensor products of finite dimensional representations of simple Lie algebras and their statistics with respect to Plancherel and character…

Representation Theory · Mathematics 2019-10-23 Olga Postnova , Nicolai Reshetikhin

We study pairs and m--tuples of compositions of a positive integer n with parts restricted to a subset P of positive integers. We obtain some exact enumeration results for the number of tuples of such compositions having the same number of…

Combinatorics · Mathematics 2015-12-09 Cyril Banderier , Pawel Hitczenko

Let $K$ be a number field with ring of integers $\mathbb{Z}_K$. We prove two asymptotic formulas connected with the distribution of irreducible elements in $\mathbb{Z}_K$. First, we estimate the maximum number of nonassociated irreducibles…

Number Theory · Mathematics 2016-10-27 Paul Pollack , Lee Troupe

We derive an asymptotic expansion for the distribution of a compound sum of independent random variables, all having the same light-tailed subexponential distribution. The examples of a Poisson and geometric number of summands serve as an…

Probability · Mathematics 2007-05-23 Ph . Barbe , W. P. McCormick , C. Zhang

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

Combinatorics · Mathematics 2008-04-01 Martin Klazar

The convolution of indicators of two conjugacy classes on the symmetric group S_q is usually a complicated linear combination of indicators of many conjugacy classes. Similarly, a product of the moments of the Jucys--Murphy element involves…

Combinatorics · Mathematics 2007-05-23 Piotr Sniady

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the…

Number Theory · Mathematics 2008-11-26 Xiang-dong Hou , Gary L. Mullen

Given a sequence of integers $a_j, j\ge 1,$ a multiset is a combinatorial object composed of unordered components, such that there are exactly $a_j$ one-component multisets of size $j.$ When $a_j\asymp j^{r-1} y^j$ for some $r>0$, $y\geq…

Combinatorics · Mathematics 2007-06-13 Boris L. Granovsky , Dudley Stark

Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…

Combinatorics · Mathematics 2025-08-28 Carine Pivoteau , Bruno Salvy

We establish some asymptotic expansions for infinite weighted convolutions of distributions having light subexponential tails. Examples are presented, some showing that in order to obtain an expansion with two significant terms, one needs…

Probability · Mathematics 2007-06-13 Ph. Barbe , W. P. McCormick

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

We introduce a new representation for the rescaled Appell polynomials and use it to obtain asymptotic expansions to arbitrary order. This representation consists of a finite sum and an integral over a universal contour (i.e. independent of…

Classical Analysis and ODEs · Mathematics 2019-11-19 J. Fernando Barbero G , Jesús Salas , Eduardo J. S. Villaseñor

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

Number Theory · Mathematics 2019-08-21 Stella Brassesco , Arnaud Meyroneinc

Given a principal bundle with a connection, we look for an asymptotic expansion of the holonomy of a loop in terms of its length. This length is defined relative to some Riemannian or sub-Riemannian structure. We are able to give an…

Differential Geometry · Mathematics 2017-01-11 Erlend Grong , Pierre Pansu

This paper is part of series on self-contained papers in which a large part, if not the full extent, of the asymptotic limit theory of summands of independent random variables is exposed. Each paper of the series may be taken as review…

Probability · Mathematics 2021-08-24 Aladji Babacar Niang , Gane Samb Lo , Moumouni Diallo

This paper describes an estimator of the additive components of a nonparametric additive model with a known link function. When the additive components are twice continuously differentiable, the estimator is asymptotically normally…

Statistics Theory · Mathematics 2007-06-13 Joel L. Horowitz , Enno Mammen

We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…

Combinatorics · Mathematics 2024-12-02 Sergey Dovgal , Khaydar Nurligareev
‹ Prev 1 2 3 10 Next ›