23 citations · 42 across the 16 of their papers we have counts for
4 papers · 1 filter
The Tutte-Grothendieck group of a convergent alphabetic rewriting system
Laurent Poinsot
The two operations, deletion and contraction of an edge, on multigraphs directly lead to the Tutte polynomial which satisfies a universal problem. As observed by Brylawski in terms…
Doubly Perfect Nonlinear Boolean Permutations
Laurent Poinsot
Due to implementation constraints the XOR operation is widely used in order to combine plaintext and key bit-strings in secret-key block ciphers. This choice directly induces the c…
Partial monoids: associativity and confluence
Laurent Poinsot, Gérard Duchamp, Christophe Tollu
A partial monoid is a set with a partial multiplication (and total identity ) which satisfies some associativity axiom. The partial monoid may be embedded in…
Statistics on Graphs, Exponential Formula and Combinatorial Physics
L. Poinsot, G. H. E. Duchamp, S. Goodenough +1
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer s…