Continued fractions and Catalan problems.
Contravariant functors on finite sets and Stirling numbers.
Converting between generalized Bell, Lah, Stirling, and Tanh numbers.
Convolutions related to q-deformed commutativity
Two important examples of q-deformed commutativity relations are: aa* - qa*a = 1, studied in particular by M. Bożejko and R. Speicher, and ab = qba, studied by T. H. Koornwinder and S. Majid. The second case includes the q-normality of operators, defined by S. Ôta (aa* = qa*a). These two frameworks give rise to different convolutions. In particular, in the second scheme, G. Carnovale and T. H. Koornwinder studied their q-convolution. In the present paper we consider another convolution of measures...
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.
Corrigendum to “Congruences for certain binomial sums”
Theorem 1 of J.-J. Lee, Congruences for certain binomial sums. Czech. Math. J. 63 (2013), 65–71, is incorrect as it stands. We correct this here. The final result is changed, but the essential idea of above mentioned paper remains valid.
Corrigendum to the paper "Generalized Eulerian numbers: combinatorial applications".
Counterexamples to the Neggers-Stanley conjecture.
Counting 1324, 4231-avoiding permutations.
Counting 1324-avoiding permutations.
Counting abelian squares.
Counting biorders.
Counting bordered partial words by critical positions.
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 fixed-height tatami tilings.
Counting graphs with different numbers of spanning trees through the counting of prime partitions
Let be the set of all integers such that there exists a connected graph on vertices with precisely spanning trees. It was shown by Sedláček that...
Counting horizontally convex polyominoes.