English
Related papers

Related papers: Elements with r-th roots in finite groups

200 papers

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

Combinatorics · Mathematics 2018-10-16 Colin McDiarmid , David Penman , Vasileios Iliopoulos

A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…

Commutative Algebra · Mathematics 2021-03-30 V. A. Bovdi , L. A. Kurdachenko

We show that for any $n\geq 2$, two elements selected uniformly at random from a \emph{symmetrized} Euclidean ball of radius $X$ in $\textrm{SL}_n(\mathbb Z)$ will generate a thin free group with probability tending to $1$ as $X\rightarrow…

Group Theory · Mathematics 2015-06-08 Elena Fuchs , Igor Rivin

The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…

Machine Learning · Computer Science 2022-01-25 Yuta Nakahara , Shota Saito , Akira Kamatsuka , Toshiyasu Matsushima

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

Group Theory · Mathematics 2025-01-30 Gideon Amir , Guy Blachar , Subhajit Ghosh , Uzi Vishne

With high probability, among $O(\log n)$ independent randomly selected elements from a finite $n$-dimensional classical group, some pair of elements power to a $2$-element generating set for a naturally embedded classical subgroup of…

Group Theory · Mathematics 2026-04-07 S. P. Glasby , Alice C. Niemeyer , Cheryl E. Praeger

We construct a family of finitely generated infinite periodic groups. The basic example is a 2-group, called the tetrahedron group. We generalize the construction by suggesting a family of infinite finitely generated dice groups. We provide…

Group Theory · Mathematics 2025-04-02 Victor Petrogradsky

It is known that all but finitely many leaves of a measured foliated 2-complex of thin type are quasi-isometric to an infinite tree with at most two topological ends. We show that if the foliation is cooriented, and the associated R-tree is…

Geometric Topology · Mathematics 2015-09-01 Ivan Dynnikov , Alexandra Skripchenko

Let $o(G)$ be the average order of a finite group $G$. We show that if $o(G)<c$, where $c\in \lbrace \frac{13}{6}, \frac{11}{4}\rbrace$, then $G$ is an elementary abelian 2-group or a solvable group, respectively. Also, we prove that the…

Group Theory · Mathematics 2022-11-01 Mihai-Silviu Lazorec , Marius Tărnăuceanu

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

Discrete Mathematics · Computer Science 2013-11-05 Ming-Deh Huang , Anand Kumar Narayanan

The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…

Logic · Mathematics 2013-05-01 Uri Andrews , Isaac Goldbring , H. Jerome Keisler

The commuting probability of a finite ring $R$, denoted by $\Pr(R)$, is the probability that any two randomly chosen elements of $R$ commute. In this paper, we obtain several bounds for $\Pr(R)$ through a generalization of $\Pr(R)$.…

Rings and Algebras · Mathematics 2015-10-29 Jutirekha Dutta , Dhiren Kumar Basnet , Rajat Kanti Nath

Let G be a connected real Lie group of dimension n. Then there exists a relatively compact open neighbourhood W of e in G such that for n+1 randomly chosen elements g_0,..,g_n the generated subgroup will be dense in G with probability one.

Group Theory · Mathematics 2007-05-23 Joerg Winkelmann

For any irreducible character $\chi$ of a finite group $G$, let $\theta(\chi)$ denote the proportion of elements $g\in G$ for which $\chi(g)$ is either zero or a root of unity. Then for any $L\in[1/2,1]$ and any $\epsilon>0$, there exists…

Representation Theory · Mathematics 2025-07-22 Alexander R. Miller

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

Group Theory · Mathematics 2017-05-17 Michael W. Davis , Matthew Kahle

We examine the issue of stability of probability in reasoning about complex systems with uncertainty in structure. Normally, propositions are viewed as probability functions on an abstract random graph where it is implicitly assumed that…

Artificial Intelligence · Computer Science 2017-12-14 Subhash Kak

The concept of arithmetic root systems is introduced. It is shown that there is a one-to-one correspondence between arithmetic root systems and Nichols algebras of diagonal type having a finite set of (restricted) Poincare'-Birkhoff-Witt…

Quantum Algebra · Mathematics 2016-09-07 I. Heckenberger

We construct families of finitely presented groups exhibiting new divergence behavior; we obtain divergence functions of the form $r^\alpha$ for a dense set of exponents $\alpha \in [2,\infty)$ and $r^n\log(r)$ for integers $n \geq 2$. The…

Group Theory · Mathematics 2020-11-02 Noel Brady , Hung Cong Tran

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

Number Theory · Mathematics 2021-12-22 Roy Shmueli

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

Combinatorics · Mathematics 2007-05-23 Rod Canfield , Sylvie Corteel , Pawel Hitczenko