Filtrer vos résultats
- 22
- 4
- 17
- 5
- 4
- 15
- 14
- 1
- 1
- 1
- 3
- 2
- 1
- 2
- 2
- 1
- 1
- 2
- 4
- 1
- 2
- 1
- 1
- 26
- 16
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 26
- 6
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
26 résultats
|
|
|
triés par
|
|
|
Counting l-letter subwords in compositionsDiscrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.285--297. ⟨10.46298/dmtcs.376⟩
Article dans une revue
hal-00961119v1
|
||
Equivalence classes of permutations modulo excedancesJournal of Combinatorics, 2014, 5 (4), pp.453-469
Article dans une revue
hal-01134173v1
|
|||
|
|
Two by two squares in set partitions2016
Pré-publication, Document de travail
hal-01278973v1
|
||
|
|
Enumeration of permutations avoiding a triple of 4-letter patterns is all done2017
Pré-publication, Document de travail
hal-01586565v1
|
||
|
|
Equivalences for pattern avoiding involutions and classification20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Via del Mar, Chile. pp.181-188, ⟨10.46298/dmtcs.3637⟩
Communication dans un congrès
hal-01185172v1
|
||
|
|
On avoidance of patterns of the form σ-τ by words over a finite alphabetDiscrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no.2 (2), pp.181-202. ⟨10.46298/dmtcs.2140⟩
Article dans une revue
hal-01349055v1
|
||
|
|
Wilf classification of triples of 4-letter patterns IIDiscrete Mathematics and Theoretical Computer Science, 2017, Vol. 19 no. 1, pp.6. ⟨10.23638/DMTCS-19-1-6⟩
Article dans une revue
hal-01321517v3
|
||
Efficient generation of restricted growth wordsInformation Processing Letters, 2013, 113 (17), pp.613-616. ⟨10.1016/j.ipl.2013.05.008⟩
Article dans une revue
istex
hal-00829134v1
|
|||
|
|
Counting ordered patterns in words generated by morphismsLATA'2008: 2nd International Conference on Language and Automata Theory and Applications, Mar 2008, Tarragona, Spain. pp.287-298
Communication dans un congrès
lirmm-00408114v1
|
||
|
|
Congruence successions in compositionsDiscrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.327--338. ⟨10.46298/dmtcs.1252⟩
Article dans une revue
hal-01179220v1
|
||
Generating the Peano curve and counting occurrences of some patternsJournal of Automata Languages and Combinatorics, 2004
Article dans une revue
hal-01645132v1
|
|||
|
|
Two by two squares in set partitions2016
Pré-publication, Document de travail
hal-01276495v1
|
||
|
|
INVERSION SEQUENCES AVOIDING {120,210} AND ANOTHER PATTERN OF LENGTH THREE2023
Pré-publication, Document de travail
hal-04334085v1
|
||
|
|
Further enumeration results concerning a recent equivalence of restricted inversion sequencesDiscrete Mathematics and Theoretical Computer Science, 2022, vol. 24, no. 1, ⟨10.46298/dmtcs.8330⟩
Article dans une revue
hal-03295362v3
|
||
|
|
Enumeration of words by the sum of differences between adjacent lettersDiscrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 1 (1), pp.173--185. ⟨10.46298/dmtcs.467⟩
Article dans une revue
hal-00988177v1
|
||
|
|
Counting Ordered Patterns in Words Generated by MorphismsIntegers : Electronic Journal of Combinatorial Number Theory, 2008, 8, pp.28
Article dans une revue
lirmm-00382674v1
|
||
|
|
Counting occurrences of some subword patternsDiscrete Mathematics and Theoretical Computer Science, 2003, Vol. 6 no. 1 (1), pp.1-12. ⟨10.46298/dmtcs.320⟩
Article dans une revue
hal-00958999v1
|
||
Loop-free Gray code algorithm for e-restricted growth fonctionsInformation Processing Letters, 2011, 111 (11), pp.541-544. ⟨10.1016/j.ipl.2011.03.006⟩
Article dans une revue
istex
hal-00790765v1
|
|||
|
|
Compositions and samples of geometric random variables with constrained multiplicities22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. pp.449-460, ⟨10.46298/dmtcs.2885⟩
Communication dans un congrès
hal-01186314v1
|
||
|
|
Wilf classification of triples of 4-letter patterns IDiscrete Mathematics and Theoretical Computer Science, 2017, Vol. 19 no. 1, ⟨10.23638/DMTCS-19-1-5⟩
Article dans une revue
hal-01321512v3
|
||
|
|
Orders induced by segments in floorplan partitions and (2-14-3,3-41-2)-avoiding permutationsThe Electronic Journal of Combinatorics, 2013, 20 (2), pp.P35
Article dans une revue
hal-00534068v4
|
||
|
|
On an open problem of Green and Losonczy: exact enumeration of freely braided permutationsDiscrete Mathematics and Theoretical Computer Science, 2004, Vol. 6 no. 2 (2), pp.461-470. ⟨10.46298/dmtcs.327⟩
Article dans une revue
hal-00959020v1
|
||
|
|
Avoiding maximal parabolic subgroups of S_kDiscrete Mathematics and Theoretical Computer Science, 2000, Vol. 4 no. 1 (1), pp.81-90. ⟨10.46298/dmtcs.276⟩
Article dans une revue
hal-00958946v1
|
||
|
|
Counting descents, rises, and levels, with prescribed first element, in wordsDiscrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 3 (3), pp.1--22. ⟨10.46298/dmtcs.432⟩
Article dans une revue
hal-00972336v1
|
||
|
|
COUNTING 1 \times 2 RECTANGLES IN SET PARTITIONS2018
Pré-publication, Document de travail
hal-01946243v1
|
||
|
|
Record statistics in integer compositions21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.527-536, ⟨10.46298/dmtcs.2691⟩
Communication dans un congrès
hal-01185383v1
|