1 citations · 4 across the 11 of their papers we have counts for
11 papers · 1 filter
Asymptotic probability of irreducibles III: Anti-SEQ
Thierry Monteil, Khaydar Nurligareev
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 connec…
Brick Wall Excursions: Combinatorial Interpretation of Random Flight Moments
Sergey Kirgizov, Khaydar Nurligareev, Michael Wallner
We study the expected distance of short uniform random walks in arbitrary dimensions with unit steps in random directions. It is known that for dimensions and , all the…
The Distribution of the Deepest Leaves in Binary Trees
Olivier Bodini, Antoine Genitrini, Khaydar Nurligareev
We study the extreme local structure of plane binary trees through the limiting distribution of the number of leaves at maximum depth. For every , we determine the limiting…
Growing Binary Trees
Olivier Bodini, Antoine Genitrini, Khaydar Nurligareev
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction…
Asymptotic probability of irreducibles II: sequence
Thierry Monteil, Khaydar Nurligareev
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 irr…
Endhered patterns in matchings and RNA
Célia Biane, Greg Hampikian, Sergey Kirgizov +1
An endhered (end-adhered) pattern is a subset of arcs in matchings, such that the corresponding starting points are consecutive and the same holds for the ending points. Such patte…
Asymptotic probability for connectedness
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 int…
Asymptotics of self-overlapping permutations
Sergey Kirgizov, Khaydar Nurligareev
In this work, we study the concept of self-overlapping permutations, which is related to the larger study of consecutive patterns in permutations. We show that this concept admits…
Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
Sergey Dovgal, Khaydar Nurligareev
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…
Asymptotics for connected graphs and irreducible tournaments
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 irre…
Decompositions of functions defined on finite sets in
Khaydar Nurligareev, Ivan Reshetnikov
A finite subset is basic, if for any function there exists a collection of functions $f_1, \ldots, f_d \colon \mathbb{R} \to \m…