Results 11 to 20 of about 738,621 (286)
GENERATING INFINITE SYMMETRIC GROUPS [PDF]
Let S=Sym( ) be the group of all permutations of an infinite set . Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a positive integer n such that every element of S may be written as a group word, respectively a monoid word, of length \leq n in ...
George M. Bergman, M. Bergman
openaire +6 more sources
Symmetric presentations of Coxeter groups [PDF]
AbstractWe apply the techniques of symmetric generation to establish the standard presentations of the finite simply laced irreducible finite Coxeter groups, that is, the Coxeter groups of typesAn,DnandEn, and show that these are naturally arrived at purely through consideration of certain natural actions of symmetric groups.
Ben Fairbairn +7 more
openaire +4 more sources
Symmetric groups and conjugacy classes [PDF]
Let S_n be the symmetric group on n-letters. Fix n>5. Given any nontrivial $ , \in S_n$, we prove that the product $ ^{S_n} ^{S_n}$ of the conjugacy classes $ ^{S_n}$ and $ ^{S_n}$ is never a conjugacy class. Furthermore, if n is not even and $n$ is not a multiple of three, then $ ^{S_n} ^{S_n}$ is the union of at least three distinct ...
Adan-Bante, Edith, Verrill, Helena
openaire +6 more sources
Symmetric difference in abelian groups [PDF]
A groupoid 21 = ζA; *> is called a left (resp. right) difference group if there is a binary operation + in A such that the system is an abelian group and x*y — —x + y (resp. x * y = x ~ y). A symmetric difference group is a groupoid satisfying all the identities common to both left and right difference groups.
Grätzer, G., Padmanabhan, R.
openaire +2 more sources
Mesomorphic Behavior of Symmetric Azomethine Dimers Containing Different Chromophore Groups
A series of new azomethine dimers was synthesized by the condensation reaction of flexible bis-benzaldehydes with four aromatic amines containing phenyl, naphthyl, anthracene and pyrene groups.
Elena Perju, Luminita Marin
doaj +1 more source
An algorithm for generating permutation algebras using soft spaces
Soft set theory has recently gained significance for finding rational and logical solutions to various real-life problems, which involve uncertainty, impreciseness and vagueness.
Shuker Mahmood Khalil +1 more
doaj +1 more source
Permutation codes over Sylow 2-subgroups $Syl_2(S_{2^n})$ of symmetric groups $S_{2^n}$
The permutation code (or the code) is well known object of research starting from 1970s. The code and its properties is used in different algorithmic domains such as error-correction, computer search, etc.
V.A. Olshevska
doaj +1 more source
Invariants in Non-Commutative Variables of the Symmetric and Hyperoctahedral Groups [PDF]
We consider the graded Hopf algebra $NCSym$ of symmetric functions with non-commutative variables, which is analogous to the algebra $Sym$ of the ordinary symmetric functions in commutative variables.
Anouk Bergeron-Brlek
doaj +1 more source
The object of the study is the processes of building groups of symmetric double-operand operations of cryptographic coding of information. The subject of the study are features of the implementation of a generalized method of synthesis groups of ...
Nataliia Lada, Yuliia Rudnytska
doaj +1 more source
Factorization of groups involving symmetric and alternating groups
We obtain the structure of finite groups of the form G=AB where B is a group isomorphic to the symmetric group on n letters Sn, n≥5 and A is a group isomorphic to the alternating group on 6 letters.
M. R. Darafsheh, G. R. Rezaeezadeh
doaj +1 more source

