相关论文: A property of alternating groups

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…

By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group…

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

E. Artin described all irreducible representations of the braid group B_k to the symmetric group S(k). We strengthen some of his results and, moreover, exhibit a complete picture of homomorphisms of B_k to S(n) for n<2k+1. We show that the…

Let m and n be any integers with n>m>=2. Using just the entropy function it is possible to define a partial order on S_mn (the symmetric group on mn letters) modulo a subgroup isomorphic to S_m x S_n. We explore this partial order in the…

We define the e\~ne product for the multiplicative group of polynomials and formal power series with coefficients on a commutative ring and unitary constant coefficient. This defines a commutative ring structure where multiplication is the…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…

In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word $x\in A^N,$ over a non empty finite alphabet $A,$ contains at least $n+1$ distinct factors of each length $n.$ They further showed…

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…

For most classical and similitude groups, we show that each element can be written as a product of two transformations that a) preserve or almost preserve the underlying form and b) whose squares are certain scalar maps. This generalizes…

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

Easy quantum groups are compact matrix quantum groups, whose intertwiner spaces are given by the combinatorics of categories of partitions. This class contains the symmetric group and the orthogonal group as well as Wang's quantum…

Let $R$ be a ring and let $n\ge 2$. We discuss the question of whether every element in the matrix ring $M_n(R)$ is a product of (additive) commutators $[x,y]=xy-yx$, for $x,y\in M_n(R)$. An example showing that this does not always hold,…

The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic…

We extend to alternating groups $A_n$ several results about symmetric groups asserting that under various conditions on a conjugacy class, or more generally, a normal subset, $C$ of $S_n$, we have $C^2 \supseteq A_n\setminus\{1\}$

It is described the group of arrowy permutations (that is extension of symmetric group) and the consequent process of generation of GL(n) and some its subgroups by this combinatoric group and its subgroups.

A synaptic algebra is a common generalization of several ordered algebraic structures based on algebras of self-adjoint operators, including the self-adjoint part of an AW*-algebra. In this paper we prove that a synaptic algebra A has the…