相关论文: A property of alternating groups
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…
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…
We determine the eigenvalues with multiplicity of each element of an alternating group in any irreducible representation. This is equivalent to determining the decomposition of cyclic representations of alternating groups into irreducibles.…
Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…
We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…
For a fixed prime $p$, we consider a filtration of the commuting complex of elements of order $p$ in the symmetric group $\mathfrak{S}_n$. The filtration is obtained by imposing successively relaxed bounds on the number of disjoint…
In order to induce a family of mixing patterns of leptons which accommodate the experimental data with a simple mathematical construct, we construct a novel object from the hybrid of two elements of a finite group with a parameter $\theta$.…
A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…
We consider the problem of counting commuting r-tuples of elements of the symmetric group S_n, i.e. computing |Hom(Z^r,S_n)|. The cases r=1,2 are well-known; a product formula for the case r=3 was conjectured by Adams-Watters and later…
Motivated by a recent conjecture of Zabrocki, Wallach described the alternants in the super-coinvariant algebra of the symmetric group in one set of commuting and one set of anti-commuting variables under the diagonal action. We give a…
We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group {\Sigma}, together with a shift map {\sigma}_x. This is a finite dynamical system, introduced by D.Silver and S. Williams.…
Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…
N.Wallach has considered an element of the group algebra of the symmetric group S_n which is the sum of an n-cycle, an (n-1)-cycle,...,a 2-cycle and the identity. He showed that multiplication by this element has eigenvalues…
An important problem from invariant theory is to describe the subspace of a tensor power of a representation invariant under the action of the group. According to Weyl's classic, the first main (later: 'fundamental') theorem of invariant…
Let $V^{\otimes n}$ be the $n$-fold tensor product of a vector space $V.$ Following I. Schur we consider the action of the symmetric group $S_n$ on $V^{\otimes n}$ by permuting coordinates. In the `super' ($\Bbb Z_2$ graded) case…
An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…
There is an infinitely generated free subgroup of the smooth knot concordance group with the property that no nontrivial element in this subgroup can be represented by an alternating knot. This subgroup has the further property that every…
A well-known theorem of Wedderburn asserts that a finite division ring is commutative. In a division ring the group of invertible elements is as large as possible. Here we will be particularly interested in the case where this group is as…
Let $G$ be a subgroup of the symmetric group $S_n$. If the proportion of fixed-point-free elements in $G$ (or a coset) equals the proportion of fixed-point-free elements in $S_n$, then $G=S_n$. The analogue for $A_n$ holds if $n \ge 7$. We…
It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…