Results 51 to 60 of about 12,641,387 (374)

Permutation Randomization Methods for Testing Measurement Equivalence and Detecting Differential Item Functioning in Multiple-Group Confirmatory Factor Analysis

open access: yesPsychological methods, 2017
In multigroup factor analysis, different levels of measurement invariance are accepted as tenable when researchers observe a nonsignificant (&Dgr;)&khgr;2 test after imposing certain equality constraints across groups.
Terrence D. Jorgensen   +3 more
semanticscholar   +1 more source

Permutations destroying arithmetic progressions in finite cyclic groups [PDF]

open access: yes, 2015
A permutation \pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a,b,c) is a non-trivial 3-term AP in G, that is c-b=b-a and a,b,c are not all equal, then (\pi(a),\pi(b),\pi(c)) is not an AP.
Hegarty, Peter, Martinsson, Anders
core   +2 more sources

Permutation groups with restricted stabilizers [PDF]

open access: yesJournal of Algebra, 2022
19 pages; to appear in Journal of Algebra (special issue in memory of Jan Saxl)
Burness, Timothy C, Shalev, Aner
openaire   +5 more sources

On the lifting of the Dade group

open access: yes, 2018
For the group of endo-permutation modules of a finite \(p\)-group, there is a surjective reduction modulo \(p\) homomorphism from a complete discrete valuation ring of characteristic 0 to its residue field of characteristic \(p\).
Lassueur, Caroline, Thévenaz, Jacques
core   +1 more source

The decomposition of an arbitrary $2^w\times 2^w$ unitary matrix into signed permutation matrices

open access: yes, 2020
Birkhoff's theorem tells that any doubly stochastic matrix can be decomposed as a weighted sum of permutation matrices. A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.
De Baerdemacker, Stijn, De Vos, Alexis
core   +1 more source

Permutation polytopes and indecomposable elements in permutation groups

open access: yesJournal of Combinatorial Theory, Series A, 2006
18 pages. To appear in the Journal of Combinatorial Theory, Series A. A corollary about solvable primitive permutation groups has been added.
Robert M. Guralnick, David Perkinson
openaire   +3 more sources

Permutation polynomials and group permutation polynomials [PDF]

open access: yesBulletin of the Australian Mathematical Society, 2001
Permutation polynomials of the form xτf (x3) over a finite field give rise to group permutation polynomials. We give a group theoretic criterion and some other criteria in terms of symmetric functions and power functions.
June Bok Lee, Young Ho Park
openaire   +2 more sources

Dihedral Group in The Ancient Genetic

open access: yesJurnal Matematika Integratif, 2020
The standard genetic code consist of four nucleotide bases which encode genes to produce amino acids needed by living things. The addition of new base  (Dummy) causes a sequence of bases to become five nucleotide bases called ancient genetic codes.
Isah Aisah, Eddy Djauhari, Asep Singgih
doaj   +1 more source

Reduction of the Hall-Paige conjecture to sporadic simple groups [PDF]

open access: yes, 2009
A complete mapping of a group $G$ is a permutation $\phi:G\rightarrow G$ such that $g\mapsto g\phi(g)$ is also a permutation. Complete mappings of $G$ are equivalent to tranversals of the Cayley table of $G$, considered as a latin square.
Wilcox, Stewart
core   +2 more sources

Finite geometry and permutation groups: some polynomial links [PDF]

open access: yesRendiconti di Matematica e delle Sue Applicazioni, 2006
Any set of points in a finite projective space PG(n, q) defines a matroid which is representable over GF(q). The Tutte polynomial of the matroid is a two-variable polynomial which includes a lot of numerical information about the configuration of points.
Peter J. Cameron
doaj  

Home - About - Disclaimer - Privacy