[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).
Research Center/Unit :
QuantOM HEC
Disciplines :
Mathematics Quantitative methods in economics & management
Author, co-author :
Crama, Yves ; Université de Liège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production
Language :
English
Title :
Balanced words and related concepts: applications and complexity issues
Publication date :
05 September 2016
Event name :
16th Mons Theoretical Computer Science Days
Event organizer :
ULg - Université de Liège
Event date :
05/09/2016 - 09/09/2016
By request :
Yes
Audience :
International
Name of the research project :
PAI COMEX
Funders :
BELSPO - Service Public Fédéral de Programmation Politique scientifique
