English
Related papers

Related papers: Dixon's asymptotic without CFSG

200 papers

Using the annealed approach we investigate the asymptotic behavior of the survival probability of a critical multitype branching process evolving in i.i.d. random environment. We show under rather general assumptions on the form of the…

Probability · Mathematics 2016-12-12 Vladimir A. Vatutin , Elena E. Dyakonova

In this note, we study the notion of random Dehn function and compute an asymptotic upper bound for finitely presented acylindrically hyperbolic groups whose Dehn function is at most polynomial. By showing that in these cases, if the group…

Group Theory · Mathematics 2025-08-22 Jerónimo García-Mejía , Antoine Goldsborough

We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time $\theta$. This limit is increasing in…

Probability · Mathematics 2007-05-23 Romain Abraham , Jean-François Delmas

Given a finite-range random walk on a finitely generated free group , what is the asymptotic behaviour, as the number of steps goes to infinity, of the sequence of probabilities that the random walk is at a given element of the group? In…

Probability · Mathematics 2025-07-22 Guillaume Chevalier

Let n points be chosen randomly and independently in the unit disk. "Sylvester's question" concerns the probability p_n that they are the vertices of a convex n-sided polygon. Here we establish the link with another problem. We show that…

Statistical Mechanics · Physics 2010-08-26 H. J. Hilhorst , P. Calka , G. Schehr

Let $\mu_1, \mu_2$ be probability measures on $\mathrm{Diff}^1_+(S^1)$ satisfying a suitable moment condition and such that their supports genererate discrete groups acting proximally on $S^1$. Let $(f^n_\omega)_{n \in \mathbb{N}},…

Group Theory · Mathematics 2025-02-18 Martín Gilabert Vio

Asymptotic factorizations for the small-ball probability (SmBP) of a Hilbert valued random element $X$ are rigorously established and discussed. In particular, given the first $d$ principal components (PCs) and as the radius $\varepsilon$…

Probability · Mathematics 2016-03-30 Enea Bongiorno , Aldo Goia

We consider a random walk in random environment in the low disorder regime on $\mathbb Z^d$. That is, the probability that the random walk jumps from a site $x$ to a nearest neighboring site $x+e$ is given by $p(e)+\epsilon \xi(x,e)$, where…

Probability · Mathematics 2015-11-11 David Campos , Alejandro F. Ramirez

A transformation monoid on a set Omega is called synchronizing if it contains an element of rank 1 (that is, mapping the whole of Omega to a single point). In this paper, I tackle the question: given n and k, what is the probability that…

Rings and Algebras · Mathematics 2011-08-22 Peter J. Cameron

Let $\Lambda = \mathrm{SL}_2(\Bbb Z)$ be the modular group and let $c_n(\Lambda)$ be the number of congruence subgroups of $\Lambda$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log c_n(\Lambda)}{(\log n)^2/\log\log…

Group Theory · Mathematics 2009-11-10 D. Goldfeld , A. Lubotzky , N. Nikolov , L. Pyber

The purpose of this paper is to prove that if $G$ is a transitive permutation group of degree $n\geq 2$, then $G$ can be generated by $\lfloor cn/\sqrt{\log{n}}\rfloor$ elements, where $c:=\sqrt{3}/2$. Owing to the transitive group…

Group Theory · Mathematics 2021-02-22 Gareth Tracey

In 2004, Frieze, Krivelevich and Martin [17] established the emergence of a giant component in random subgraphs of pseudo-random graphs. We study several typical properties of the giant component, most notably its expansion characteristics.…

Combinatorics · Mathematics 2022-05-11 Sahar Diskin , Michael Krivelevich

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

Combinatorics · Mathematics 2016-02-24 Kevin Henriot

Given a group G denote with exp(G) its exponent, which is the least common multiple of the order of its elements. In this paper we solve the problem of finding the finite simple groups having a proper subgroup with the same exponent. For…

Group Theory · Mathematics 2015-12-16 A. Pachera

Presenting a finite group by a free product of finite cyclic groups the Hopf formula for the Schur multiplier affords also a covering group, and this has minimal exponent provided that the order of the generators is preserved. This…

Group Theory · Mathematics 2021-12-08 Nicola Sambonet

We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…

General Mathematics · Mathematics 2021-11-09 Madieyna Diouf

We establish the short-time asymptotic behaviour of the Markovian semigroups associated with strongly local Dirichlet forms under very general hypotheses. Our results apply to a wide class of strongly elliptic, subelliptic and degenerate…

Analysis of PDEs · Mathematics 2014-01-03 A. F. M. ter Elst , Derek W. Robinson , Adam Sikora

We consider a one-dimensional random walk $S_n$ with i.i.d. increments with zero mean and finite variance. We study the asymptotic expansion for the tail distribution $\mathbf P(\tau_x>n)$ of the first passage times…

Probability · Mathematics 2024-01-19 Denis Denisov , Alexander Tarasov , Vitali Wachtel

We consider the positive divisors of a natural number that do not exceed its square root, to which we refer as the {\it small divisors\/} of the natural number. We determine the asymptotic behavior of the arithmetic function that adds the…

Number Theory · Mathematics 2019-10-28 Douglas E. Iannucci

One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 log n$-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 log n. The explicit…

Computational Complexity · Computer Science 2012-10-17 Marius Zimand
‹ Prev 1 8 9 10 Next ›