Results 11 to 20 of about 382,738 (264)
Interlocked Permutations [PDF]
SIAM Journal on Discrete Mathematics, 2019 The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.
Cohen, Gérard +2 more
openaire +4 more sources
Palindromic Permutations And Generalized Smarandache Palindromic Permutations
, 2006 The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups S_n of degree n. It is shown that in S_n, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S_2 and S_3).
Jaiyeola, Temitope Gbolahan
openaire +6 more sources
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
Snow Leopard Permutations and Their Even and Odd Threads [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Caffrey, Egge, Michel, Rubin and Ver Steegh recently introduced snow leopard permutations, which are the anti-Baxter permutations that are compatible with the doubly alternating Baxter permutations. Among other things, they showed that these permutations
Eric S. Egge, Kailee Rubin
doaj +1 more source
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
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 tableaux and permutation patterns
Journal of Combinatorial Theory, Series A, 2007 Clarification of proofs (thanks to referees); report on progress on our open problems by Burstein, Corteel, Eriksen, Reifegerste, and Viennot. 25 pages, 7 figures.
Steingrímsson, Einar +1 more
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
Permutation Classes of Polynomial Growth [PDF]
, 2007 A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations.
M. D. Atkinson +5 more
core +4 more sources