Sciweavers

39 search results - page 1 / 8
» On the enumeration of d-minimal permutations
Sort
View
CPC
2008
86views more  CPC 2008»
13 years 3 months ago
Enumeration Schemes for Restricted Permutations
Abstract. Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply...
Vincent Vatter
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 2 months ago
On the enumeration of d-minimal permutations
We suggest an approach for the enumeration of minimal permutations having d descents which uses skew Young tableaux. We succeed in finding a general expression for the number of s...
Mathilde Bouvel, Luca Ferrari
JCT
2010
92views more  JCT 2010»
13 years 3 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
FFA
2006
120views more  FFA 2006»
13 years 5 months ago
Enumerating permutation polynomials over finite fields by degree II
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
Sergei Konyagin, Francesco Pappalardi