Let c(°) denote the number of cycles of a permutation ° of n letters, and let Tr(°)=n−c(°). A t-involution is a product of t disjoint transpositions. Let k>2, n>2t.Theorem. ° is the product of k t-involutions if and only if kt =Tr(°)+2r for some nonegative integer r. (For k=2 one more condition is needed; see [2].) As a corollary, the least power of a class of an involution with at least one fixed point that covers the alternating group is determined
It was conjectured that a permutation matrix with bandwidth b can be written as a product of no more...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractUsing the character theory of the symmetric group n, an explicit formula is derived for the ...
Let c(°) denote the number of cycles of a permutation ° of n letters, and let Tr(°)=n−c(°). A t-invo...
AbstractLet αϵGLn A be a matrix over a commutative ring A with 1 such that (det α)2 = 1. If α is cyc...
We investigate different types of permutation containment, principally by involutions. We give an ex...
AbstractWe consider the group SLnF of all n by n matrices with determinant 1 over a field. Let res A...
Let $G$ be isomorphic to $GL_n(q)$, $SL_n(q)$, $PGL_n(q)$ or $PSL_n(q)$, where $q=2^a$. If $t$ is an...
We enumerate and characterize some classes of alternating and reverse alternating involutions avoidi...
AbstractGiven a permutation σ on n letters, we determine for which values of the integers l1 and l2 ...
In [2] Ree proved a theorem about permutation groups by making use of a formula for the genus of Rie...
This paper studies the cycle indices of products of permutation groups. The main focus is on the pro...
An involution π is said to be τ-avoiding if it does not contain any subsequence having all the same ...
International audienceAn involution is a permutation such that its inverse is itself (i.e., cycle le...
The five Mathieu permutation groups M₁₁, M₁₂M₂₂,M₂₃ and M₂₄ are constructed and the involutions (ele...
It was conjectured that a permutation matrix with bandwidth b can be written as a product of no more...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractUsing the character theory of the symmetric group n, an explicit formula is derived for the ...
Let c(°) denote the number of cycles of a permutation ° of n letters, and let Tr(°)=n−c(°). A t-invo...
AbstractLet αϵGLn A be a matrix over a commutative ring A with 1 such that (det α)2 = 1. If α is cyc...
We investigate different types of permutation containment, principally by involutions. We give an ex...
AbstractWe consider the group SLnF of all n by n matrices with determinant 1 over a field. Let res A...
Let $G$ be isomorphic to $GL_n(q)$, $SL_n(q)$, $PGL_n(q)$ or $PSL_n(q)$, where $q=2^a$. If $t$ is an...
We enumerate and characterize some classes of alternating and reverse alternating involutions avoidi...
AbstractGiven a permutation σ on n letters, we determine for which values of the integers l1 and l2 ...
In [2] Ree proved a theorem about permutation groups by making use of a formula for the genus of Rie...
This paper studies the cycle indices of products of permutation groups. The main focus is on the pro...
An involution π is said to be τ-avoiding if it does not contain any subsequence having all the same ...
International audienceAn involution is a permutation such that its inverse is itself (i.e., cycle le...
The five Mathieu permutation groups M₁₁, M₁₂M₂₂,M₂₃ and M₂₄ are constructed and the involutions (ele...
It was conjectured that a permutation matrix with bandwidth b can be written as a product of no more...
AbstractA permutation of n objects is of cycle type (j1,…,jn) if it has jk, k=1,…,n, cycles of lengt...
AbstractUsing the character theory of the symmetric group n, an explicit formula is derived for the ...
DOI
Add to ORKG