相关论文: A property of alternating groups

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.

Given two elements $a$ and $b$ of a noncommutative ring, we express $\left( ba\right)^n$ as a "row vector times matrix times column vector" product, where the matrix is the $n$-th power of a matrix with entries…

We show that for all $n\leq X$ apart from $O(X\exp(-c(\log X)^{1/2}(\log \log X)^{1/2}))$ exceptions, the alternating group $A_n$ is invariably generated by two elements of prime order. This answers (in a quantitative form) a question of…

This is an expository work presenting in detail the proof of the structure theorem for divisible abelian groups. A divisible abelian group is an abelian group that satisfies nD=D for all natural n. The theorem states that any divisible…

We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…

A metacyclic group $H$ can be presented as $\langle \alpha,\beta\mid \alpha^{n}=1, \ \beta^{m}=\alpha^{t}, \ \beta\alpha\beta^{-1}=\alpha^{r}\rangle$ for some $n,m,t,r$. Each endomorphism $\sigma$ of $H$ is determined by…

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

Let $G$ be a finite $p$-group whose derived subgroup $G'$ can be generated by $2$ elements. If $G'$ is abelian, Guralnick proved that every element of $G'$ is a commutator. In this paper, we prove that the condition that $G'$ should be…

The first author proved in a previous paper that the n-fold bar construction for commutative algebras can be generalized to E_n-algebras, and that one can calculate E_n-homology with trivial coefficients via this iterated bar construction.…

In this paper we characterize the monoid congruences of commutative semigroups by the help of the notion of the separator of subsets of semigroups. We show that every monoid congruence of a commutative semigroup S can be constructed by the…

Adinkras are combinatorial objects developed to study supersymmetry representations. Gates et al. introduced the "gadget" as a function of pairs of adinkras, obtaining some mysterious results for $(n=4, k=1)$ adinkras with computer-aided…

The commuting graph of a finite non-commutative semigroup S, denoted by \Delta(S), is the simple graph whose vertices are the non-central elements of S and two distinct vertices x; y are adjacent if xy = yx. In the present paper, we study…

Let A be a quasi-finite R-algebra (i.e., a direct limit of module finite algebras) with identity. Let I_i, i=0,...,m, be two-sided ideals of A, \GL_n(A,I_i) the principal congruence subgroup of level I_i in GL_n(A) and E_n(A,I_i) be the…

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

Let $d\geq 2$ be an integer. In this paper we study arithmetic properties of the sequence $(H_d(n))_{n\in\N}$, where $H_{d}(n)$ is the number of permutations in $S_{n}$ being products of pairwise disjoint cycles of a fixed length $d$. In…

We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.

The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…

Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…

An m-endomorphism of a free semigroup is an endomorphism that sends every generator to a word of length at most m. Two m-endomorphisms are combinatorially equivalent if they are conjugate under an automorphism of the semigroup. In this…