Permutation groups
Computing in permutation groups without memory
... Memoryless computation is a modern technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, ...
22
Permutation groups and transformation semigroups : results and problems
... a permutation group G and a single non-permutation ...on permutation groups and linear groups, and some comments about the impact on semigroups are ...
15
Splicing systems over permutation groups of length two
... permutation groups. In this paper, we define splicing systems over permutation groups and investigate the generative power of the languages ...
6
Computing in permutation groups without memory
... Memoryless computation is a new topic, which is arguably not well known so far. It significantly differs from the many branches of “traditional” theoretical computer science, its peculiar setup yielding new phenomena, ...
21
Symmetry classes of polynomials associated with the direct product of permutation groups
... The relative symmetric polynomials as a generalization of symmetric polynomials are introduced in [7]. In [1, 10, 11], the authors studied the space of relative symmetric polynomials (symmetry class of polynomials) with ...
7
Primitive permutation groups with a solvable subconstituent of degree 7
... primitive groups with a suborbit of length 4 were given by Quirin, Sims and Wang in [6, 7, ...primitive groups with a suborbit of length 5 in [6, ...primitive permutation groups having a ...
15
Topological Dynamics in Tandem with Permutation Groups
... The crux of the work here cruised on recurrence in [29]. A periodic point returns to itself every hour on the hour; but almost periodic point returns to a neighbourhood every hour within the hour. The recurrence was ...
5
The primitive soluble permutation groups of degree less than 256
... Permutation groups arose out of the study of roots of polynomials, but soon became objects of independent ...all permutation groups of a given ...intransitive groups of a given degree ...
179
Minimal generation of transitive permutation groups
... This thesis discusses upper bounds on the minimal number of elements d(G) re- quired to generate a finite group G. We derive explicit upper bounds for the function d on transitive and minimally transitive ...
110
Synchronizing permutation groups and graph endomorphisms
... synchronizing permutation groups and on graph endo- morphisms, motivated by the theorem of Cameron and ...synchronizing permutation groups, it tack- les various questions related to ...by ...
249
Modeling Quantum Behavior in the Framework of Permutation Groups
... Abstract. Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear ...
8
ON THE SIMPLICITY OF PERMUTATION GROUPS
... of groups has been used to explore some useful characteristics of finite groups in connection with permutation design and construction of lattices Praeger and Scheider(2002), as well as in the study ...
10
The primitive permutation groups of degree less than 4096
... primitive permutation groups has a long and rich ...primitive groups is in the work of Ruffini in 1799 where he divided non-cyclic permutation groups into intransitive, imprimitive and ...
23
Graphs of Permutation Groups
... In this paper we introduce and study permutation graphs of permutation groups. Basic, structural and specific properties of these graphs are investigated and characterized. Further, we obtain ...
6
Suborbital graphs of the groups Cn ,Dn and UP and graphs whose automorphism groups contain the permutation groups Cn and Dn
... Neumann (1977) extended the work of Higman and Sim’s (1967) to finite permutation groups, edge colored graphs and matrices. In this paper the author constructed the famous Petersen graph as a suborbital ...
130
Rank 3 permutation groups with a regular normal subgroup
... For the rest of this section H denotes an elementary abelian p-group of order pn, and simple basis quantities.. complex characters of H can be identified with.[r] ...
115
On a factorization of an iterated wreath product of permutation groups
... Z p for some prime p having some extra properties and giving a negative answer to some open problems, for instance a non-locally finite π-group factorized by locally finite subgroups or a group factorized by two locally ...
13
Conjugacy in finite state wreath powers of finite permutation groups
... the permutation group (G, A) is a subgroup of the symmetric group ...the groups act on the sets from the right and denote by a g the result of the action of a group element g on a point ...
12
The double transitivity of a class of permutation groups
... every abelian group of composite order which has at least one cyclic Sylow subgroup is a B-group.. generalized the Burnside result.[r] ...
46
Reducts of structures and maximal-closed permutation groups
... maximal-closed, and more generally whether Sym( N ) has any countable maximal- closed groups. However, both these questions are answered positively in [7], where it is shown that if H > PGL(n, F ) is closed (F ...
28