GALaC team at LRI, Paris-Sud

GALaC is a research group at LRI, Paris-Sud University. We are focused on graph theory, combinatorics and network distributed systems algorithmic.

A global presentation of research activities in GALaC was made in 2013 for the AERES evaluation: Slides AERES 2013 and projet.

Recent Posts

Cyclic sieving for reduced reflection factorizations of the Coxeter element

-- Theo Douvropoulos (IRIF, Paris 7 Diderot)

Given a factorization \(t_1\cdots t_n=c\) of some element \(c\) in a group, there are various natural cyclic operations we can apply on it; one of them is given by \(\Psi:(t_1,\cdots,t_n)\rightarrow (c\ t_n\ c^{-1},t_1,\cdots, t_{n-1})\). A common question is then to ...

Binary pattern of length greater than 14 are abelian-2-avoidable

-- Matthieu Rosenfeld (GALAC, LRI)

Summary: Two words u and v are abelian equivalent if they are permutation of each other ("aabc" and "baca" are abelian equivalent). Let w be a word and P= P1...Pn (where the Pi are the letters of P) a pattern (a word over another alphabet), we say that w ...

Convergence of uniform noncrossing partitions toward the Brownian triangulation

-- Jérémie Bettinelli (LIX, équipe Combi)

We give a short proof that a uniform noncrossing partition of the regular \(n\)-gon weakly converges toward Aldous's Brownian triangulation of the disk, in the sense of the Hausdorff topology. This result was first obtained by Curien and Kortchemski, using a more complicated encoding. Thanks to a result ...

See all

Edit this page / How to edit

Translations: fr