190 citations · 561 across the 46 of their papers we have counts for
51 papers
Presentation of monoids generated by a projection and an involution
Pascal Caron, Jean-Gabriel Luque, Bruno Patrou
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various…
State complexity of the star of a Boolean operation
Pascal Caron, Edwin Hamel-de-le court, Jean-Gabriel Luque
Monsters and modifiers are two concepts recently developed in the state complexity theory. A monster is an automaton in which every function from states to states is represented by…
The state complexity of a class of operations involving roots and boolean operations
Pascal Caron, Edwin Hamel-de-le-court, Jean-Gabriel Luque
Modifiers are a sets of functions acting on tuple of automata and allowing one to construct regular operations. We define and study the class of friendly modifiers that describes a…
On recursively defined combinatorial classes and labelled trees
Ali Chouria, Vlad-Florin Drǎgoi, Jean-Gabriel Luque
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
Algebraic and Combinatorial Tools for State Complexity : Application to the Star-Xor Problem
Pascal Caron, Edwin Hamel-de le Court, Jean-Gabriel Luque
We investigate the state complexity of the star of symmetrical differences using modifiers and monsters. A monster is an automaton in which every function from states to states is…
Connections between vector-valued and highest weight Jack and Macdonald polynomials
Laura Colmenarejo, Charles F. Dunkl, Jean-Gabriel Luque
We analyze conditions under which a projection from the vector-valued Jack or Macdonald polynomials to scalar polynomials has useful properties, especially commuting with the actio…