Results 231 to 240 of about 97,370 (265)
Transcriptional correlates of structure-function coupling plasticity in trigeminal neuralgia: unveiling the synaptic and metabolic associations. [PDF]
J Headache PainZhang J +8 more
europepmc +1 more source
Age-related dopaminergic integrity in the SNpc and VTA: morphometric and volumetric findings in marmoset (<i>Callithrix jacchus</i>). [PDF]
Front NeuroanatAzambuja MMO +7 more
europepmc +1 more source
Marrying for power: Gendered alliances in mafias. [PDF]
PLoS OneCatino M, Aziani A, Rocchi S.
europepmc +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
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
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
On the diameter of permutation groups
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83, 1983Computer Science ...
James R. Driscoll, Merrick L. Furst
openaire +1 more source
Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, 1987
We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a ...
László Babai +2 more
openaire +1 more source
We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a ...
László Babai +2 more
openaire +1 more source
Binary Relations and Permutation Groups
Mathematical Logic Quarterly, 1995AbstractWe discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed
Hajnal Andréka +2 more
openaire +2 more sources