Séminaire d'équipe GALaC

Le séminaire d'équipe de GALaC est organisé régulièrement le vendredi à 14h00 dans le bâtiment PCRI (650) au LISN.

Séminaires récents et à venir


-- Pacôme Perrotin (LISN, Galac)

summary: TBA


-- Ugo Gioccanti (G-SCOP (Grenoble))

summary: TBA

A simple counting argument applied to lower bounds on the growth of subshifts

-- Matthieu Rosenfeld (LIRMM (Montpellier))

summary: Given a group G, a set of colors A and a set of forbidden patterns F, the subshift X_F is the set of colorings of G by A that avoid the patterns in F. I recently obtained a simple condition on the set of forbidden patterns F that implies ...

Boolean dimension of boolean lattices

-- Hoang La (Jagiellonian University, Cracovie (Pologne))

summary: Partially ordered sets (or posets for short) are structures that arise naturally in mathematics in the study of binary relations between objects. A poset consists of a ground set -- a set of elements -- and a partial order among them, and are usually visualled with directed acyclic graphs (DAGs). Indeed ...

Efficient maximal cliques enumeration in weakly closed graphs

-- George Manoussakis (Université de Versailles Saint-Quentin-en-Yvelines)

summary: We show that the algorithm presented in [J. Fox, T. Roughgarden, C. Seshadhri, F. Wei, and N. Wein. Finding cliques in social networks: A new distribution-free model. SIAM journal on computing, 49(2):448-464, 2020] can be modified to have enumeration time complexity αO(n·poly(c)). Here parameter ...

See all

Translations: en