相关论文: A property of alternating groups

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

There were defined by R. Shwartz OGS for non-abelian groups, as an interesting generalization of the basis of finite abelian groups. The definition of OGS states that that every element of a group has a unique presentation as a product of…

For a fixed positive integer $k$, any element $g$ of the permutation group $S_{k}$ acts on the tensor product vertex operator algebra $V^{\otimes k}$ in the obvious way. In this paper, we determine the $S$-matrix of $\left(V^{\otimes…

We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…

We focus upon the relationship between Hamiltonian cycle products and efficient vectors for a reciprocal matrix $A$, to more deeply understand the latter. This facilitates a new description of the set of efficient vectors (as a union of…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

Let $ (\rho, V) $ be an irreducible representation of the symmetric group $ S_n$ (or the alternating group $ A_n$), and let $ g $ be a permutation on $n$ letters with each of its cycle lengths divides the length of its largest cycle. We…

We give a geometric proof of a well known theorem that describes splittings of a free group as an amalgamated product or HNN extension over the integers. The argument generalizes to give a similar description of splittings of a virtually…

We establish that any even permutation from A_n moving at least [3n/4] + o(n) points is the commutator of a generating pair of A_n and a generating pair of S_n. From this we deduce an exponential lower bound on the number of systems of…

In this note, we construct a 2-basic set of the alternating group \A_n. To do this, we construct a 2-basic set of the symmetric group \sym_n with an additional property, such that its restriction to \A_n is a 2-basic set. We adapt here a…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

A classification of the ways in which an element of a free group can be expressed as a product of commutators or as a product of squares is given. This is then applied to some particular classes of elements. Finally, a question about…

Let R be a commutative ring and let n,m be two positive integers. The symmetric group on n letters acts diagonally on the ring of polynomials in nxm variables with coefficients in R. The subrings of invariants for this action is called the…

We present various results on multiplying cycles in the symmetric group. Our first result is a generalisation of the following theorem of Boccara (1980): the number of ways of writing an odd permutation in the symmetric group on $n$ symbols…

For an associative algebra $A$ a skew-symmetric sum of $n!$ products of $n$ elements of $A$ in all possible order is called $n$-commutator. We consider $A$ as $n$-ary algebra under $n$-commutator. We prove that it has an identity of…

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…

Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…