AbstractMould calculus is a powerful combinatorial tool that often provides some explicit formulae when there are no other available computational methods. It has a well-known interpretation/dictionary in terms of Hopf algebras. But this dictionary does not provide any equivalent of formal moulds. Thus, we present here such an interpretation and give a generic way to prove mould symmetries of formal moulds
International audienceThe well-known Baker-Campbell-Hausdorff theorem in Lie theory says that the lo...
This paper describes the mechanisation in HOL of some basic λ-calculus theory. The proofs are taken ...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
International audienceMould calculus is a powerful combinatorial tool that often provides some expli...
91 pagesThis paper is an introduction to mould calculus as introduced by Jean Ecalle. We give a prec...
The present article deals with various generating series and group schemes (not necessarily affine o...
The present article deals with various generating series and group schemes (not necessarily affine o...
International audienceWe describe a method for constructing characters of combinatorial Hopf algebra...
This thesis studies the applications of mould techniques to Kashiwara-Vergne theory. Developed by Je...
Art. ID rnn018 16 pages, one reference added and minor changes in v2International audienceThe operad...
A new anticyclic operad Mould is introduced, on spaces of functions in several variables. It is prov...
Abstract. We present a technique that is able to detect symmetries in formulas of the basic modal lo...
We establish Ecalle's mould calculus in an abstract Lie-theoretic setting and use it to solve a norm...
30 pagesWe present the general framework of Écalle's moulds in the case of linearization of a formal...
A 12-page survey (15 pages including bibliography).Resurgence Theory and Mould Calculus were invente...
International audienceThe well-known Baker-Campbell-Hausdorff theorem in Lie theory says that the lo...
This paper describes the mechanisation in HOL of some basic λ-calculus theory. The proofs are taken ...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
International audienceMould calculus is a powerful combinatorial tool that often provides some expli...
91 pagesThis paper is an introduction to mould calculus as introduced by Jean Ecalle. We give a prec...
The present article deals with various generating series and group schemes (not necessarily affine o...
The present article deals with various generating series and group schemes (not necessarily affine o...
International audienceWe describe a method for constructing characters of combinatorial Hopf algebra...
This thesis studies the applications of mould techniques to Kashiwara-Vergne theory. Developed by Je...
Art. ID rnn018 16 pages, one reference added and minor changes in v2International audienceThe operad...
A new anticyclic operad Mould is introduced, on spaces of functions in several variables. It is prov...
Abstract. We present a technique that is able to detect symmetries in formulas of the basic modal lo...
We establish Ecalle's mould calculus in an abstract Lie-theoretic setting and use it to solve a norm...
30 pagesWe present the general framework of Écalle's moulds in the case of linearization of a formal...
A 12-page survey (15 pages including bibliography).Resurgence Theory and Mould Calculus were invente...
International audienceThe well-known Baker-Campbell-Hausdorff theorem in Lie theory says that the lo...
This paper describes the mechanisation in HOL of some basic λ-calculus theory. The proofs are taken ...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...