Related papers: Asymptotic normality arising in Baxter permutation…
Using a modified version of Schauder's fixed point theorem, measures of non-compactness and classical techniques, we provide new general results on the asymptotic behavior and the non-oscillation of second order scalar nonlinear…
We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…
Two well-known polytopes whose vertices are indexed by permutations in the symmetric group $\mathfrak{S}_n$ are the permutohedron $P_n$ and the Birkhoff polytope $B_n$. We consider polytopes $P_n(\Pi)$ and $B_n(\Pi)$, whose vertices…
We consider the asymptotic behaviour of positive solutions u of the conformal scalar curvature equation, \Delta u + n(n-2)/4 u^{(n+2)(n-2) = 0, in the neighbourhood of isolated singularities in the standard Euclidean ball. Although…
Approximate Bayesian computation allows for statistical analysis in models with intractable likelihoods. In this paper we consider the asymptotic behaviour of the posterior distribution obtained by this method. We give general results on…
We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…
An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…
To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…
Phylogenetic networks provide a more general description of evolutionary relationships than rooted phylogenetic trees. One way to produce a phylogenetic network is to randomly place $k$ arcs between the edges of a rooted binary phylogenetic…
In this thesis the properties of two kinds of non-uniform random recursive trees are studied. In the first model weights are assigned to each node, thus altering the attachment probabilities. We will call these trees weighted recursive…
A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…
Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…
We define and study a combinatorial Hopf algebra dRec with basis elements indexed by diagonal rectangulations of a square. This Hopf algebra provides an intrinsic combinatorial realization of the Hopf algebra tBax of twisted Baxter…
A sharp asymptotic formula for the number of strongly connected digraphs on $n$ labelled vertices with $m$ arcs, under a condition $m-n\to\infty$, $m=O(n)$, is obtained; this solves a problem posed by Wright back in $1977$. Our formula is a…
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…
We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…
Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic behavior of rooted stack-triangulations with $2n$ faces under…
We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…
We develop a new asymptotic method for the analysis of matrix Riemann-Hilbert problems. Our method is a generalization of the steepest descent method first proposed by Deift and Zhou; however our method systematically handles jump matrices…
We consider the asymptotic behavior of solutions of the difference equations of the form $x(n+1)=Ax(n) + \sum_{k=0}^n B(n-k)x(k) + y(n)$ in a Banach space $\X$, where $n=0,1,2,...$; $A,B(n)$ are linear bounded operator in $\X$. Our method…