Related papers: Random generation with cycle type restrictions

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the…

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

In this note we give an alternative proof of a theorem of Linnell and Warhurst that the number of generators d(G) of a polycyclic group G is at most d(\hat G), where d(\hat G) is the number of generators of the profinite completion of G.…

Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…

We study an interesting family of cooperating coroutines, which is able to generate all patterns of bits that satisfy certain fairly general ordering constraints, changing only one bit at a time. (More precisely, the directed graph of…

We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact…

Orientably-regular maps are highly symmetric embeddings of graphs in oriented surfaces. Among them, chiral maps are those which fail to be isomorphic to their mirror images. We prove that, as $n\to\infty$, chirality is generic for…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we…

In this note, we develop a novel algorithm for generating random numbers from a distribution with a probability density function proportional to $\sin^k(x)$, $x \in (0,\pi)$ and $k \geq 1$. Our algorithm is highly efficient and is based on…

In this paper, we continue the study of the generator graph of a group. In 2023, Tacbobo [9] defined the generator graph of a nontrivial group to be the graph whose vertices are the elements of the group, with two vertices being adjacent if…

Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in…

For a finite group $G$, let $K(G)$ denote the field generated over $\mathbb{Q}$ by its character values. For $n>24$, G. R. Robinson and J. G. Thompson proved that $$K(A_n)=\mathbb{Q}\left (\{ \sqrt{p^*} \ : \ p\leq n \ {\text{ an odd prime…

In this note, we study a class of random subsets of positive integers induced by Bernoulli random variables. We obtain sufficient conditions such that the random set is almost surely lacunary, does not have bounded gaps and contains…

The spectral test of random number generators (R.R. Coveyou and R.D. McPherson, 1967) is generalized. The sequence of random numbers is analyzed explicitly, not just via their n-tupel distributions. We find that the mixed multiplicative…

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

Let the random variable $X\, :=\, e(\mathcal{H}[B])$ count the number of edges of a hypergraph $\mathcal{H}$ induced by a random $m$ element subset $B$ of its vertex set. Focussing on the case that $\mathcal{H}$ satisfies some regularity…

An alternating permutation of length $n$ is a permutation $\pi=\pi_1 \pi_2 ... \pi_n$ such that $\pi_1 < \pi_2 > \pi_3 < \pi_4 > ...$. Let $A_n$ denote set of alternating permutations of ${1,2,..., n}$, and let $A_n(\sigma)$ be set of…

Let $S_{n}$ denote the set of permutations of $[n]=\{1,2,\dots, n\}$. For each integer $k\geq 1$, let $S_{n,k}$ be the set of all permutations of $[n]$ with exactly $k$ disjoint cycles. A subset $H\subseteq S_{n,k}$ is to be a matching if…