Results 21 to 30 of about 115,299 (267)
Minimal Factorizations of Permutations into Star Transpositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form $(1 i)$. Our result generalizes earlier work of Pak ($\textit{Reduced decompositions of permutations in terms of star ...
J. Irving, A. Rattan
doaj +1 more source
Modified Growth Diagrams, Permutation Pivots, and the BWX Map $\phi^*$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 In their paper on Wilf-equivalence for singleton classes, Backelin, West, and Xin introduced a transformation $\phi^*$, defined by an iterative process and operating on (all) full rook placements on Ferrers boards. Bousquet-Mélou and Steingrimsson proved
Jonathan Bloom, Dan Saracino
doaj +1 more source
Ballot permutations and odd order permutations [PDF]
Discrete Mathematics, 2020 There was an error with an alternative formula for b(n,3) that was on page ...
openaire +3 more sources
eLife, 2016 Exploration of developmental mechanisms classically relies on analysis of pattern regularities. Whether disorders induced by biological noise may carry information on building principles of developmental systems is an important debated question. Here, we
Yassin Refahi +6 more
doaj +1 more source
Calculating Permutation Entropy without Permutations [PDF]
Complexity, 2020 A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the ...
openaire +4 more sources
The # product in combinatorial Hopf algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We show that the # product of binary trees introduced by Aval and Viennot (2008) is in fact defined at the level of the free associative algebra, and can be extended to most of the classical combinatorial Hopf algebras.
Jean-Christophe Aval +2 more
doaj +1 more source
Permutation and complete permutation polynomials
Finite Fields and Their Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonid A. Bassalygo, Victor A. Zinoviev
openaire +2 more sources
Discrete Mathematics & Theoretical Computer Science, 2011 In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux.
Jean-Christophe Aval +2 more
doaj +1 more source
A relation on 132-avoiding permutation patterns [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 A permutation $σ$ contains the permutation $τ$ if there is a subsequence of $σ$ order isomorphic to $τ$. A permutation $σ$ is $τ$-avoiding if it does not contain the permutation $τ$.
Natalie Aisbett
doaj +1 more source
Avoiding maximal parabolic subgroups of S_k [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions.
Toufik Mansour, Alek Vainshtein
doaj +1 more source