Results 221 to 230 of about 278,863 (274)
Some of the next articles are maybe not open access.
Communications in Algebra, 2004
Abstract In this paper an algorithm is produced, which, given a permutation group G of degree n > 3, outputs a generating set for G with at most n/2 elements.
A. Lucchini, F. Menegazzo, MORIGI, MARTA
openaire +1 more source
Abstract In this paper an algorithm is produced, which, given a permutation group G of degree n > 3, outputs a generating set for G with at most n/2 elements.
A. Lucchini, F. Menegazzo, MORIGI, MARTA
openaire +1 more source
Algebra Universalis, 2001
For a finite algebra \({\mathcal A}=(A,F)\), the unary part of the clone of \({\mathcal A}\) is a transformation monoid on the set \(A\). In the lattice of clones on \(A\), the collection of clones whose unary part is \(M\), forms an interval. It has long been known that if \(| A|\geq 3\) and \(M\) consists of all the constant operations and the ...
Kearnes, Keith A., Szendrei, Ágnes
openaire +1 more source
For a finite algebra \({\mathcal A}=(A,F)\), the unary part of the clone of \({\mathcal A}\) is a transformation monoid on the set \(A\). In the lattice of clones on \(A\), the collection of clones whose unary part is \(M\), forms an interval. It has long been known that if \(| A|\geq 3\) and \(M\) consists of all the constant operations and the ...
Kearnes, Keith A., Szendrei, Ágnes
openaire +1 more source
1994
Abstract This is a long chapter on permutation groups of finite Morley rank. The reader will find numerous challenging open problems. We start with a generalization of Clifford’s Theorem to the context of groups of finite Morley rank. Our proof follows the standard proof and we do not claim any originality.
Alexandre Borovik, Ali Nesin
openaire +2 more sources
Abstract This is a long chapter on permutation groups of finite Morley rank. The reader will find numerous challenging open problems. We start with a generalization of Clifford’s Theorem to the context of groups of finite Morley rank. Our proof follows the standard proof and we do not claim any originality.
Alexandre Borovik, Ali Nesin
openaire +2 more sources
Bulletin of the London Mathematical Society, 1996
An infinite permutation group is cofinitary if any non-identity element fixes only finitely many points. This paper presents a survey of such groups. The paper has four parts. The first develops some basic theory, concerning groups with finite orbits, topology, maximality, and normal subgroups.
openaire +2 more sources
An infinite permutation group is cofinitary if any non-identity element fixes only finitely many points. This paper presents a survey of such groups. The paper has four parts. The first develops some basic theory, concerning groups with finite orbits, topology, maximality, and normal subgroups.
openaire +2 more sources
Oberwolfach Reports, 2008
The workshop Permutation groups organised by Robert Guralnick (Southern California), Cheryl Praeger (Western Australia), Jan Saxl (Cambridge) and Katrin Tent (Bielefeld) was held August 5th–11th, 2007.
Robert M. Guralnick +3 more
openaire +2 more sources
The workshop Permutation groups organised by Robert Guralnick (Southern California), Cheryl Praeger (Western Australia), Jan Saxl (Cambridge) and Katrin Tent (Bielefeld) was held August 5th–11th, 2007.
Robert M. Guralnick +3 more
openaire +2 more sources
2007
Abstract. The theory of permutation groups is essentially the theory of symmetry for mathematical and physical systems, and therefore has major impact in diverse areas of mathematics. Recent significant advances in permutation groups have contributed to, and benefited from, many areas, leading to a more powerful permutation group theory including ...
+4 more sources
Abstract. The theory of permutation groups is essentially the theory of symmetry for mathematical and physical systems, and therefore has major impact in diverse areas of mathematics. Recent significant advances in permutation groups have contributed to, and benefited from, many areas, leading to a more powerful permutation group theory including ...
+4 more sources
Permutation Involvement and Groups
The Quarterly Journal of Mathematics, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Atkinson, M. D., Beals, Robert
openaire +1 more source
GENERATING TRANSITIVE PERMUTATION GROUPS
The Quarterly Journal of Mathematics, 1988The following theorem is proved. There is a constant c such that for each positive integer d (\(\geq 2)\), each nilpotent transitive group of degree d can be generated by [cd(log d)\({}^{-1/2}]\) elements. Moreover for each prime p there is a positive constant \(c_ p\) such that whenever d is a power of p there is a transitive p-group of degree d which
Kovács, L. G., Newman, M. F.
openaire +1 more source