Results 231 to 240 of about 14,426,649 (305)

Permutation Groups

Group Theory for Physicists, 2011
Alan Camina, Barry Lewis
semanticscholar   +3 more sources

Solving the Single-Row Facility Layout Problem by K-Medoids Memetic Permutation Group

IEEE Transactions on Evolutionary Computation, 2023
The single-row facility layout problem (SRFLP) is concerned with arranging facilities along a straight line so as to minimize the sum of the products of the flow costs and distances among all facility pairs.
Lixin Tang, Zuo-cheng Li, Jin-Kao Hao
semanticscholar   +1 more source

Generating Permutation Groups

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

Collapsing permutation groups

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

p-Permutation equivalences between blocks of group algebras

Journal of Algebra, 2020
We extend the notion of a {$p$-permutation equivalence} between two $p$-blocks $A$ and $B$ of finite groups $G$ and $H$, from the definition in [Boltje-Xu 2008] to a virtual $p$-permutation bimodule whose components have twisted diagonal vertices.
Robert Boltje, Philipp Perepelitsky
semanticscholar   +1 more source

Application of Permutation Group Theory in Reversible Logic Synthesis

International Workshop on Reversible Computation, 2015
The paper discusses various applications of permutation group theory in the synthesis of reversible logic circuits consisting of Toffoli gates with negative control lines.
D. Zakablukov
semanticscholar   +1 more source

Permutation groups

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

Cofinitary Permutation Groups

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

Permutation groups

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, Cheryl E. Praeger, Jan Saxl, Katrin Tent   +3 more
openaire   +2 more sources