Computing the period of an Ehrhart quasi-polynomial.
Computing tournament sequence numbers efficiently with matrix techniques.
Congruence properties for a class of arithmetical functions.
Congruences for Stirling numbers and Eulerian numbers
Congruences pour les nombres de Genocchi de 2e espèce
Consecutive patterns: from permutations to column-convex polyominoes and back.
Continued fractions and Catalan problems.
Converting between generalized Bell, Lah, Stirling, and Tanh numbers.
Correction to "The bias of three pseudo-random shuffles", Volume 22, 2/3 (1981), p. 268-292.
Corrigendum: A note on self-conjugate -color partitions.
Counting 1324, 4231-avoiding permutations.
Counting 1324-avoiding permutations.
Counting biorders.
Counting colorings on varieties.
We present a combinatorial mechanism for counting certain objects associated to a variety over a finite field. The basic example is that of counting conjugacy classes of the general linear group. We discuss how the method applies to counting these and also to counting unipotent matrices and pairs of commuting matrices.[Proceedings of the Primeras Jornadas de Teoría de Números (Vilanova i la Geltrú (Barcelona), 30 June - 2 July 2005)].
Counting -polytopes with vertices.
Counting defective parking functions.
Counting horizontally convex polyominoes.
Counting lattice paths by Narayana polynomials.
Counting Maximal Distance-Independent Sets in Grid Graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied
Counting multiderangements by excedances.