The main focus of this activity is the interrelation between algebraic structure and algorithms. We plan to work on the following subjects:

More precisely, the research project takes place in effective algebraic combinatorics, at the interface of enumerative combinatorics and analysis of algorithms on one hand and symbolic and algebraic computation on the other hand. The objective is twofold: firstly, thanks to vast generalization of the notion of generating series, we hope to give a theoretical framework allowing to study the fine behavior of various algorithms. Reciprocally, the study of those very same algorithms gives a new mean to discover algebraic identities. Those identities have many applications in mathematics, in particular in representation theory but also in physics (mainly statistical physics).

The research relies deeply on computer experimentation and contains as a consequence an important software development part within the Sage-Combinat software project. However, the required level of sophistication, flexibility, and breath of computational tools is reaching a point where large scale collaborative development is critical. The design and collaborative development of such a software is raising research-grade computer science challenges around the modelling of mathematics, the management of large hierarchy of (object oriented) classes, etc.

Those very specific questions also raise more general combinatorial questions. We therefore plan to work on enumerative combinatorics and cellular automaton, in particular on trees. This activity is conducted with close collaborators in France, Germany, North America, and India.

Bijections for tree-decorated maps and applications to random maps

-- Luis Fredes (LaBRI, Bordeaux)

We introduce a new family of maps, namely tree-decorated maps where the tree is not necessarily spanning. To study this class of maps, we define a bijection which allows us to deduce combinatorial results, recovering as a corollary some results about spanning-tree decorated maps, and to understand local limits. Finally ...

L-Convex Polyominoes are Recognizable in Real Time by 2D Cellular Automata

-- Anaël Grandjean (Université Paris-Est Créteil)

This is a joint work with Victor Poupet where we investigate the recognition power of cellular automata in real time. A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected inner path that changes direction at most once. The 2-dimensional language representing ...

Asymptotic distribution of parameters in random maps

-- Sergey Dovgal (LIPN Univ. Paris 13)

In this joint work with Olivier Bodini, Julien Courtiel, and Hsien-Kuei Hwang, we consider random rooted maps without regard to their genus. We address the problem of limiting distributions for six different parameters: - vertices - leaves - loops - root edges - root isthmic constructions - root vertex degree Each parameter has a different limiting ...

See all

Translations: fr