Related papers: A note on the probability of generating alternatin…

We say that permutations $\pi_1,\dots, \pi_r \in \mathcal{S}_n$ invariably generate $\mathcal{S}_n$ if, no matter how one chooses conjugates $\pi'_1,\dots,\pi'_r$ of these permutations, $\pi'_1,\dots,\pi'_r$ generate $\mathcal{S}_n$. We…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let $A$ be an associative algebra over an order $R$ in an algebraic number field. We assume that $A$ is a free…

For a finite group $G$, let $m_I(G)$ denote the largest possible cardinality of a minimal invariable generating set of $G$. We prove an upper and a lower bound for $m_I(S_n)$, which show in particular that $m_I(S_n)$ is asymptotic to $n/2$…

The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…

An equivalent condition for the product of elements of an independent random sample on a compact algebraic group converging in distribution to some random variable as the sample size increases is obtained. Namely, a limit distribution…

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

Let $G$ be a finite simple group. In this paper we consider the existence of small subsets $A$ of $G$ with the property that, if $y \in G$ is chosen uniformly at random, then with high probability $y$ invariably generates $G$ together with…

We show that randomly choosing the matrices in a completely positive map from the unitary group gives a quantum expander. We consider Hermitian and non-Hermitian cases, and we provide asymptotically tight bounds in the Hermitian case on the…

We establish new Bonferroni-type lower bounds for the probability of a union of finitely many events where the selection of intersections in the estimates is determined by the clique complex of a chordal graph.

We obtain an asymptotic upper bound for the smallest number of generators for a finite direct sum of matrix algebras with entries in a finite field. This produces an upper bound for a similar quantity for integer matrix rings. We also…

In section 1 we give an improved lower bound on Hermite's constant $\delta_{2g}$ for symplectic lattices in even dimensions ($g=2n$) by applying a mean-value argument from the geometry of numbers to a subset of symmetric lattices. Here we…

We study the representation growth of alternating and symmetric groups in positive characteristic and restricted representation growth for the finite groups of Lie type. We show that the the number of representations of dimension at most n…

In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…

In this article we establish the asymptotic behavior of generating functions related to the exponential sum over finite fields of elementary symmetric functions and their perturbations. This asymptotic behavior allows us to calculate the…

Let $\mathrm{Mod}(S_g)$ be the mapping class group of the closed orientable surface of genus $g \geq 2$. In this article, we derive necessary and sufficient conditions under which two torsion elements in $\mathrm{Mod}(S_g)$ will have…

We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.

We prove that, for a primitive permutation group G acting on a set of size n, other than the alternating group, the probability that Aut(X,Y^G) = G for a random subset Y of X, tends to 1 as n tends to infinity. So the property of the title…

In this paper, we introduce a novel approach for generating random elements of a finite group given a set of generators of that. Our method draws upon combinatorial group theory and automata theory to achieve this objective. Furthermore, we…