Results 261 to 270 of about 339,574 (318)
Metabolic dynamics and stage-specific biomarkers in chronic HBV infection: a metabolomics study. [PDF]
Liu L, Zhu Z, Jin W, Su X, Deng Z, Li C.
europepmc +1 more source
FastCCC: a permutation-free framework for scalable, robust, and reference-based cell-cell communication analysis in single cell transcriptomics studies. [PDF]
Hou S, Ma W, Zhou X.
europepmc +1 more source
Musical Training and Perceptual History Shape Alpha Dynamics in Audiovisual Speech Integration. [PDF]
Lee J, Han JH, Lee HJ.
europepmc +1 more source
A design of multiple color image encryption scheme based on finite algebraic structures. [PDF]
Qayyum T, Shah T, Khan I, Popa IL.
europepmc +1 more source
Recognizing Cartesian decompositions for transitive permutation groups
Cheryl E. Praeger +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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

