Search results for "Permutations"
showing 4 items of 14 documents
Gray code for Cayley permutations
2003
A length-n Cayley permutation p of a total ordered set S is a length-n sequence of elements from S, subject to the condition that if an element x appears in p then all elements y < x also appear in p . In this paper, we give a Gray code list for the set of length-n Cayley permutations. Two successive permutations in this list differ at most in two positions.
Etudes d'objets combinatoires : applications à la bio-informatique
2011
This thesis considers classes of combinatorial objects that model data in bioinformatics. We have studied two methods of mutation of genes within the genome : duplication and inversion. At first,we study the problem of the whole mirror duplication-random lossmodel in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this method after p duplications from the identity is the class of permutations avoiding alternating permutations of length 2p + 1.We also enumerate the number of duplications that are necessary and sufficient to obtain any permutation of length n from the identity. We also suggest two efficient algorithms to reconstruct two different …
Permutations of zero-sumsets in a finite vector space
2020
Abstract In this paper, we consider a finite-dimensional vector space 𝒫 {{\mathcal{P}}} over the Galois field GF ( p ) {\operatorname{GF}(p)} , with p being an odd prime, and the family ℬ k x {{\mathcal{B}}_{k}^{x}} of all k-sets of elements of 𝒫 {\mathcal{P}} summing up to a given element x. The main result of the paper is the characterization, for x = 0 {x=0} , of the permutations of 𝒫 {\mathcal{P}} inducing permutations of ℬ k 0 {{\mathcal{B}}_{k}^{0}} as the invertible linear mappings of the vector space 𝒫 {\mathcal{P}} if p does not divide k, and as the invertible affinities of the affine space 𝒫 {\mathcal{P}} if p divides k. The same question is answered also in the case where …
Subgroups of SF(ω) and the relation of almost containedness
2016
The relations of almost containedness and orthogonality in the lattice of groups of finitary permutations are studied in the paper. We define six cardinal numbers naturally corresponding to these relations by the standard scheme of P(ω)P(ω). We obtain some consistency results concerning these numbers and some versions of the Ramsey theorem.