English
Related papers

Related papers: Regular sets and counting in free groups

200 papers

In this paper we study satisfiability of random equations in an infinite finitely generated nilpotent group G. We show that the set SAT(G,k) of all equations in k > 1 variables over G which are satisfiable in G has an intermediate…

Group Theory · Mathematics 2011-06-10 Robert Gilman , Alexei Myasnikov , Vitalii Romankov

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

Combinatorics · Mathematics 2007-11-21 Jacob Steinhardt

We introduce Cayley posets as posets arising naturally from pairs $S<T$ of semigroups, much in the same way that Cayley graph arises from a (semi)group and a subset. We show that Cayley posets are a common generalization of several known…

Combinatorics · Mathematics 2019-08-27 Ignacio García-Marco , Kolja Knauer , Guillaume Mercui-Voyant

We consider the random Cayley graphs of a sequence of finite nilpotent groups of diverging sizes $G=G(n)$, whose ranks and nilpotency classes are uniformly bounded. For some $k=k(n)$ such that $1\ll\log k \ll \log |G|$, we pick a random set…

Probability · Mathematics 2024-03-20 Jonathan Hermon , Xiangying Huang

Consider the random Cayley graph of a finite group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll k \lesssim \log |G|$. The results of this article supplement those in the three main papers on random Cayley…

Probability · Mathematics 2021-02-05 Jonathan Hermon , Sam Olesker-Taylor

The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent…

Combinatorics · Mathematics 2023-09-28 Michael Krivelevich , Tamás Mészáros , Peleg Michaeli , Clara Shikhelman

We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same…

Group Theory · Mathematics 2018-03-19 Sean Cleary , Murray Elder , Andrew Rechnitzer , Jennifer Taback

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

Group Theory · Mathematics 2023-11-15 Frédérique Bassino , Cyril Nicaud , Pascal Weil

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

Group Theory · Mathematics 2007-05-23 Alexandre V. Borovik , Alexei G. Myasnikov , Vladimir Shpilrain

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Number Theory · Mathematics 2019-10-25 Kathrin Bringmann , Chris Jennings-Shaffer , Karl Mahlburg

We study the asymptotic behavior of the free cumulants (in the sense of free probability theory of Voiculescu) of Jucys--Murphy elements--or equivalently--of the transition measure associated with a Young diagram. We express these cumulants…

Combinatorics · Mathematics 2007-05-23 Piotr Sniady

We estimate the number of graphical regular representations (GRRs) of a given group with large enough order. As a consequence, we show that almost all finite Cayley graphs have full automorphism groups 'as small as possible'. This confirms…

Combinatorics · Mathematics 2023-08-01 Binzhou Xia , Shasha Zheng

Preferential attachment is a widely adopted paradigm for understanding the dynamics of social networks. Formal statistical inference,for instance GLM techniques, and model verification methods will require knowing test statistics are…

Probability · Mathematics 2015-04-29 Sidney Resnick , Gennady Samorodnitsky

In this paper we introduce and study the concept of normality degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be normal. Explicit formulas are obtained for some particular classes of…

Group Theory · Mathematics 2013-12-06 Marius Tarnauceanu

In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…

Statistics Theory · Mathematics 2012-11-26 Stefano Favaro , Antonio Lijoi , Igor Prünster

In this preprint we derive explicit estimates for the asymptotics of the first-passage function for a specific class of random walks on free groups and use them to prove the singularity of the hitting measure for a similarly defined class…

Probability · Mathematics 2023-01-24 Petr Kosenko

We give sufficient conditions for the asymptotic normality of linear combinations of order statistics (L-statistics) in the case of simple random samples without replacement. In the first case, restrictions are imposed on the weights of…

Statistics Theory · Mathematics 2012-04-11 Andrius Čiginas

Suppose we are given the free product V of a finite family of finite or countable sets. We consider a transient random walk on the free product arising naturally from a convex combination of random walks on the free factors. We prove the…

Probability · Mathematics 2015-03-17 Lorenz A. Gilch

We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…

Geometric Topology · Mathematics 2025-12-01 Sophie Wright

Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Emphasis is on the case of the fundamental group of a closed surface, for the usual system of generators.