Search results for "combinatoric"

showing 10 items of 1776 documents

Random deletion-right insertion and pattern avoiding permutations

2015

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

Some unusual asymptotics for a variant of insertion sort

2015

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

Restricted Steinhaus-Johnson-Trotter list

2014

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two

2015

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

A new vincular pattern based Mahonian statistic on words

2013

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

Permutations avoiding generalized patterns modulo left-to-right maxima

2015

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]ComputingMilieux_MISCELLANEOUS
researchProduct

On parameterized complexity to determine b-chromatic and partial Grundy numbers

2014

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO][INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMilieux_MISCELLANEOUS
researchProduct

Gray code for compositions of n with parts 1 and p

2009

International audience

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]permutation avoiding pattern[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Fibonacci numbercomposition of an integerGray codeComputingMilieux_MISCELLANEOUS
researchProduct

ECO-generation for some restricted classes of compositions

2013

International audience; We study several restricted classes of compositions by giving one-to-one maps between them and different classes of restricted binary strings or pattern avoiding permutations. Inspired by the ECO method, new succession rules for these classes are presented. Finally, we obtain generating algorithms in Constant Amortized Time (CAT) for theses classes.

[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]succession ruleComposition of an integerECO method[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]lcsh:Electronic computers. Computer science[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]generating treepattern avoiding permutationlcsh:QA75.5-76.95
researchProduct

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 …

[SDV.SA]Life Sciences [q-bio]/Agricultural sciencesCompositions d’entiers[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation[SDV.SA] Life Sciences [q-bio]/Agricultural sciencesBioinformaticsDuplicationcompositions d'entiersCompositions of integersInversionDuplicationsPermutationsInversionsGray codes[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationCodes de Gray[ INFO.INFO-CY ] Computer Science [cs]/Computers and Society [cs.CY][INFO.INFO-CY] Computer Science [cs]/Computers and Society [cs.CY][INFO.INFO-CY]Computer Science [cs]/Computers and Society [cs.CY]CombinatoricsBio-informatiqueCombinatoire[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation[ SDV.SA ] Life Sciences [q-bio]/Agricultural sciences
researchProduct