Power permutationsThreshold implementationWe describe a method to decompose any power permutation, as a sequence of power permutations of lower algebraic degree. As a result we obtain decompositions of the inversion in GF(2 n ) for small n from 3 up to 16, as well as for the APN functions,...
A Reversible Logical Circuit Synthesis Algorithm Based on Decomposition of Cycle Representations of PermutationsCircuit synthesisReversible computingCycle representations of permutationsReversible logicA reversible function is isomorphic to a permutatidoi:10.1007/s10773-018-3768-5Zhu, Wei...
Power permutationsThreshold implementationWe describe a method to decompose any power permutation, as a sequence of power permutations of lower algebraic degree. As a result we obtain decompositions of the inversion in GF(2(n)) for small n from 3 up to 16, as well as for the APN functions,...
Paul, Simpler linear-time modular decompo- sition via recursive factorizing permutations. Manuscript on ArXiv: 0710.3901, 2008.Tedder M., Corneil D. , Habib M., Paul C. ,Simpler linear-time modular decomposition via recursive factorizing permutations, 35th International Colloquium on Automata, Lan...
(NDBs) to decide whether the NOT gate should be added to decrease the Hamming distance of the input and output vectors; the second part was based on the idea of exploring properties of the cycle representation of permutations, decomposed the cycles to make the permutation closer to the ...
Raffinot, "Computing common intervals of k permutations, with applications to modular decomposition of graphs," SIAM J Discrete Math, vol. 22, pp. 1022-39, 2008.A. Bergeron, C. Chauve, F. De Montgolfier, and M. Raffinot, "Computing common intervals of k permutations, with applications to...
We show that, for $321$-avoiding permutations, the set of left-to-right maxima has the same distribution when the block number is assumed to be $k$ as when the last descent of the inverse is assumed to be at position $n - k$. This result is analogous to the Foata-Sch"utzenberger...
Rubio, I.M., Corrada-Bravo, C.J.: Cyclic decomposition of permutations of finite fields obtained using monomials. In: Poli, A., Stichtenoth, H. (eds.) Proceedings of \(\mathbb{F}_{q}\) 7. Lecture Notes in Computer Science, vol. 2948, pp. 254–261. Springer, Berlin (2004)Co...
Block decomposition of permutations and Schur-positivitydoi:10.1007/S10801-017-0788-9Ron M. AdinEli BagnoYuval RoichmanSpringer US
Kokosin´ski Z.: On generation of permutations through decomposition of symmetric groups into cosets, BIT 30 (1990) 583-591Kokosiński, Z.: On generation of permutations through decomposition of symmetric groups into cosets. BIT 30 (1990) 583–591...