[en] In this talk, I present a few results and several questions about "regular" sequences of integers
and related concepts, such as balanced words, partitions and covers of the integers by
arithmetic sequences. Such concepts have been investigated in pure mathematics, but also
naturally arise in a variety of application fields such as production planning, political science, or
queueing theory. I briefly present some of these applications and explain how they motivate
seemingly new questions relating, for instance, to the algorithmic complexity of regular partitions, or to the structure of balanced words.
The presentation is based on joint work with Nadia Brauner and Vincent Jost (Grenoble).
Centre/Unité de recherche :
QuantOM HEC
Disciplines :
Mathématiques Méthodes quantitatives en économie & gestion
Auteur, co-auteur :
Crama, Yves ; Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production
Langue du document :
Anglais
Titre :
Balanced words and related concepts: applications and complexity issues
Date de publication/diffusion :
05 septembre 2016
Nom de la manifestation :
16th Mons Theoretical Computer Science Days
Organisateur de la manifestation :
ULg - Université de Liège
Date de la manifestation :
05/09/2016 - 09/09/2016
Sur invitation :
Oui
Manifestation à portée :
International
Intitulé du projet de recherche :
PAI COMEX
Organisme subsidiant :
BELSPO - Service Public Fédéral de Programmation Politique scientifique
