AbstractThe category of combinatorial species was introduced by Joyal, and has been studied extensively by him and others. This category is equipped with a derivative operation (endofunctor). This allows one to differentiate species in a manner similar to differentiating power series. We solve, completely, the family of differential equations Dky = Xn for species. For this, we use results on the conjugacy classes of sharply k-transitive groups. We provide, also, a new proof of a sharpened version of Zassenhaus' theorem on sharply 2-transitive groups of type I
AbstractWe consider systems of recursively defined combinatorial structures. We give algorithms chec...
In this paper, we present a bijective proof of the �-Mehler formula. The proof is in the same style ...
International audienceSpringer numbers are analogs of Euler numbers for the group of signed permutat...
AbstractThe category of combinatorial species was introduced by Joyal, and has been studied extensiv...
AbstractAs a direct consequence of the Kan Extension Theorem, the derivative functor, D, on (combina...
AbstractWe analyse the solution set of first-order initial value differential problems of the form d...
AbstractWe give combinatorial proofs of the primary results developed by Stanley for deriving enumer...
We give combinatorial proofs of the primary results developed by Stanley for deriving enumerative pr...
AbstractWe describe the close relationship between permutation groups and combinatorial species (int...
AbstractLet f = f(x) = x + a2x2 + … ∈ K[[x]] be a “normalized” power series over a (commutative) fie...
In this article, we study systems of $n \geq 1$, not necessarily linear, discrete differential equat...
AbstractLet ξ be a complex variable. We associate a polynomial in ξ, denoted (MN)ξ, to any two molec...
AbstractWe give a simple combinatorial proof a Langrange inversion theorem for species and derive fr...
AbstractWe introduce two new binary operations on combinatorial species; the arithmetic product and ...
AbstractWe show, in this paper, how algorithms for the sequential generation of combinatorial struct...
AbstractWe consider systems of recursively defined combinatorial structures. We give algorithms chec...
In this paper, we present a bijective proof of the �-Mehler formula. The proof is in the same style ...
International audienceSpringer numbers are analogs of Euler numbers for the group of signed permutat...
AbstractThe category of combinatorial species was introduced by Joyal, and has been studied extensiv...
AbstractAs a direct consequence of the Kan Extension Theorem, the derivative functor, D, on (combina...
AbstractWe analyse the solution set of first-order initial value differential problems of the form d...
AbstractWe give combinatorial proofs of the primary results developed by Stanley for deriving enumer...
We give combinatorial proofs of the primary results developed by Stanley for deriving enumerative pr...
AbstractWe describe the close relationship between permutation groups and combinatorial species (int...
AbstractLet f = f(x) = x + a2x2 + … ∈ K[[x]] be a “normalized” power series over a (commutative) fie...
In this article, we study systems of $n \geq 1$, not necessarily linear, discrete differential equat...
AbstractLet ξ be a complex variable. We associate a polynomial in ξ, denoted (MN)ξ, to any two molec...
AbstractWe give a simple combinatorial proof a Langrange inversion theorem for species and derive fr...
AbstractWe introduce two new binary operations on combinatorial species; the arithmetic product and ...
AbstractWe show, in this paper, how algorithms for the sequential generation of combinatorial struct...
AbstractWe consider systems of recursively defined combinatorial structures. We give algorithms chec...
In this paper, we present a bijective proof of the �-Mehler formula. The proof is in the same style ...
International audienceSpringer numbers are analogs of Euler numbers for the group of signed permutat...