Advanced determinant calculus.
Affine Weyl groups as infinite permutations.
Airy phenomena and analytic combinatorics of connected graphs.
Algorithmische Kombinatorik mit Kleinrechnern.
Almost product evaluation of Hankel determinants.
Alternating, pattern-avoiding permutations.
An analogue of covering space theory for ranked posets.
An application of Pólya’s enumeration theorem to partitions of subsets of positive integers
Let be a non-empty subset of positive integers. A partition of a positive integer into is a finite nondecreasing sequence of positive integers in with repetitions allowed such that . Here we apply Pólya’s enumeration theorem to find the number of partitions of into , and the number of distinct partitions of into . We also present recursive formulas for computing and .
An area-to-inv bijection between Dyck paths and 312-avoiding permutations.
An asymptotic expansion for the number of permutations with a certain number of inversions.
An enumeration theorem for rooted graphs
An estimate for Frobenius' Diophantine problem in three dimensions.
An Eulerian partner for inversions.
An explanatory bijection of some properties of bridges. (Une bijection explicative de plusieurs propriétés de ponts.)
An exploration of the permanent-determinant method.
An extension of the exponential formula in enumerative combinatorics.
An inductive proof of Whitney's Broken Circuit Theorem
We present a new proof of Whitney's broken circuit theorem based on induction on the number of edges and the deletion-contraction formula.
An infinite version of the Pólya enumeration theorem.
An introduction to -species.
An inverse matrix formula in the right-quantum algebra.