The art of doing mathematics consists in finding that special
case which contains all the germs of generality.
--David Hilbert
Quoted in N Rose Mathematical Maxims and Minims (Raleigh N C
1988).
Monoids and their representation theory, applications to discrete Markov chains
Computational invariant theory and applications
Computer exploration, experimental mathematics
Mathematical software design and development
My goal is to participate to the building of more bridges between
combinatorics, algebra, and computer science; for example, I used
commutative algebra, and in particular invariant theory, to obtain
some results in graph reconstruction, or about the generating series
of combinatorial objects described as equivalence classes
w.r.t. certain relations. Reciprocally, I am using combinatorics to
describe the representation theory of (towers of) algebras and
monoids. My favorite tool is computer exploration and, to this end, I
am leading the development of the (algebraic) combinatorics project
Sage-Combinat.
I led from 2008 to about 2020 the open source project
Sage-Combinat, whose mission statement is to improve
Sage as a platform for computer exploration in (algebraic)
combinatorics, and to foster code sharing among researchers in
this area.
Developed jointly with researchers in Barcelona, Daejeon, Davis,
Lyon, Marne-la-Vallée, Marseille, Montpellier, Montréal,
Philadelphia, Seattle, Stanford, Strasbourg, Toronto, ...
I have a strong interest in open source computer algebra. See
in particular the intense
discussion which took place in France, and the following workshop which I
co-organized in Lyon, in May 21st-23rd 2002.