Related papers: Intersections of Sylow 2-subgroups in symmetric gr…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

Based on an explicit formula of the generating series for the $n$-point psi-class intersection numbers (cf. Bertola et. al. [4]), we give a novel proof of a conjecture of Delecroix et. al. [9] regarding the large genus uniform leading…

We extend to alternating groups $A_n$ several results about symmetric groups asserting that under various conditions on a conjugacy class, or more generally, a normal subset, $C$ of $S_n$, we have $C^2 \supseteq A_n\setminus\{1\}$

Let $\{X_i(t):\, t\in S\subset \R^d \}_{i=1,2,\ldots,n}$ be independent copies of a stationary centered Gaussian field with almost surely smooth sample paths. In this paper, we are interested in the conjunction probability defined as $\PP…

Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…

For the Chebyshev-Stirling numbers, a special case of the Jacobi-Stirling numbers, asymptotic formulae are derived in terms of a local central limit theorem. The underlying probabilistic approach also applies to the classical Stirling…

In this paper we consider finitary symmetric random walks on groups. We construct new possible asymptotics for the drift. We show that the drift can be very close to linear ant yet sublinear. We also give estimates for entropy growth of…

Given a set of independent Poisson random variables with common mean, we study the distribution of their maximum and obtain an accurate asymptotic formula to locate the most probable value of the maximum. We verify our analytic results with…

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…

We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…

We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for the correlation coefficient of degrees of…

We study the intersection of two independent renewal processes, $\rho=\tau\cap\sigma$. Assuming that $\mathbf{P}(\tau_1 = n ) = \varphi(n)\, n^{-(1+\alpha)}$ and $\mathbf{P}(\sigma_1 = n ) = \tilde\varphi(n)\, n^{-(1+ \tilde\alpha)} $ for…

Asymptotic syzygies of a normal crossing variety follow the same vanishing behavior as one of its smooth components, unless there is a cohomological obstruction arising from how the smooth components intersect each other. In that case, we…

Let $p$ be any prime. Let $P_n$ be a Sylow $p$-subgroup of the symmetric group $S_n$. Let $\phi$ and $\psi$ be linear characters of $P_n$ and let $N$ be the normaliser of $P_n$ in $S_n$. In this article we show that the inductions of $\phi$…

In this paper we study asymptotic behavior of regular subsets in a free group F of finite rank, compare their sizes at infinity, and develop techniques to compute the probabilities of sets relative to distributions on F that come naturally…

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…

We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to\infty$ and $m=O(n\log n)$ as $n\to\infty$. This is the entire range of $m$ not covered by…

We improve on recent estimates for the probability of generating the alternating and symmetric groups $\mathrm{Alt}(n)$ and $\mathrm{Sym}(n)$. In particular we find the sharp lower bound, if the probability is given by a quadratic in…

For a class of PT-symmetric operators with small random perturbations, the eigenvalues obey Weyl asymptotics with probability close to 1. Consequently, when the principal symbol is non-real, there are many non-real eigenvalues.