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.
An involution principle-free bijective proof of Stanley's hook-content formula.
An optimal matching problem
Given two measured spaces and , and a third space , given two functions and , we study the problem of finding two maps and such that the images and coincide, and the integral is maximal. We give condition on and for which there is a unique solution.
An optimal matching problem
Given two measured spaces and , and a third space Z, given two functions u(x,z) and v(x,z), we study the problem of finding two maps and such that the images and coincide, and the integral is maximal. We give condition on u and v for which there is a unique solution.
Analogues of up-down permutations for colored permutations.
Analysis of an algorithm to construct Fibonacci partitions
Analysis of an asymmetric leader election algorithm.
Analysis of straightening formula.
Animals and 2-Motzkin paths.
Another interpretation of the number of derangements. (Une autre interprétation du nombre des dérangements.)
Antichains of multisets.
Antimorphisms of partially ordered sets
Applications of the Finite State Automata for Counting Restricted Permutations and Variations
Approximate counting : an alternative approach
Area distribution and scaling function for punctured polygons.
Arithmetic properties of Bell numbers to a composite modulus I
Around The Nuber Of Chains In Partitive Sets