Results 241 to 250 of about 97,370 (265)
Some of the next articles are maybe not open access.
Computation with permutation groups
Proceedings of the second ACM symposium on Symbolic and algebraic manipulation - SYMSAC '71, 1971The purpose of this paper is to provide an introduction to some computational techniques which have proved useful in the study of large permutation groups. In particular they have been used to study the Suzuki simple group of degree 1782 and order 448,345,497,600 and the simple group G2(5) of order 5,859,000,000 in a representation of degree 3906. Many
openaire +1 more source
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
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
A compact representation for permutation groups
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982Summary: A data structure is presented which enables an arbitrary permutation group of degree n to be represented in \(O(n^ 2)\) space. An algorithm is provided which, given a permutation group specified in the usual way as a set of generators, constructs the proposed representation in time \(O(n^ 5)\).
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 ...
openaire +2 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 ...
openaire +2 more sources
Permutation Jensen–Shannon divergence for Random Permutation Set
Engineering Applications of Artificial Intelligence, 2023Yong Deng, Kang Hao Cheong
exaly