Results 21 to 30 of about 206,672 (309)
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
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 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.
Einar Steingrímsson, Lauren K. Williams
openaire +2 more sources
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
Magic Square and Arrangement of Consecutive Integers That Avoids k-Term Arithmetic Progressions
Mathematics, 2021 In 1977, Davis et al. proposed a method to generate an arrangement of [n]={1,2,…,n} that avoids three-term monotone arithmetic progressions. Consequently, this arrangement avoids k-term monotone arithmetic progressions in [n] for k≥3.
Kai An Sim, Kok Bin Wong
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 +3 more sources
New Hopf Structures on Binary Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +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 +1 more source