86 search results - page 5 / 18 » Combinatorics of generalized q-Euler numbers |
COMBINATORICS
2006
13 years 7 months ago
2006
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
COMBINATORICS
2004
13 years 7 months ago
2004
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
COMBINATORICS
2006
13 years 7 months ago
2006
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
COMBINATORICS
2002
13 years 7 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
COMBINATORICS
1999
13 years 7 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...