Welcome to Nicolas' home

Contact Information

Nicolas M. Thiéry (aka Isil)
E-mail (professional) (private, permanent) (permanent since 1998; alas some e-mails seem to get lost)
PGP Public key
Professor, Laboratoire de Recherche en Informatique, Université Paris Sud

Computational sessions at CRM's workshop

Resume, Research, Teaching, Software,

Teaching resources

For a full record of my teaching, see my resume.
Faculté d'Orsay, Université Paris Sud, 2012-:
Licence MPI: Info 111 Introduction à l'informatique
Préparation à l'Agrégation d'Orsay: Option Algèbre et Calcul Formel
Master Compétences Complémentaires en Informatique: Languages Objets (Java)
Fête de la Science au Laboratoire de Recherche en Informatique
Atelier: Apprenez à fabriquer votre propre robot,
IUT d'Orsay, Université Paris Sud, 2004-2011:
Java and Math courses: the documents are on the DOKEOS platform of the Université Paris Sud.
Mathématiques à l'Institut Universitaire de Technologie
Préparation à l'Agrégation d'Orsay, Option Algèbre et Calcul Formel
Université Claude Bernard Lyon I, Fall 2001, 2002, 2003:
Remise à Niveau en Informatique; Utilisation de l'Outil Informatique; Système et Réseaux
DESS de Statistiques, Informatique et Techniques Numériques.
Université Claude Bernard Lyon I, Spring 2001, 2002 and 2003:
Recherche Opérationnelle et Optimisation Discrète
Maîtrise de Mathématiques et d'Ingénierie Mathématique.
Université Marne-la-Vallée, Fall 2002:
TP de C++ Première Année, Filière IR
Colorado School of Mines, Fall 2000:
MACS 358: Algebraic Structures and Discrete Maths



The art of doing mathematics consists in finding that special case which contains all the germs of generality.
--David Hilbert Quoted in N Rose Mathematical Maxims and Minims (Raleigh N C 1988).


My goal is to participate to the building of more bridges between combinatorics, algebra, and computer science; for example, I used commutative algebra, and in particular invariant theory, to obtain some results in graph reconstruction, or about the generating series of combinatorial objects described as equivalence classes w.r.t. certain relations. Reciprocally, I am using combinatorics to describe the representation theory of (towers of) algebras and monoids. My favorite tool is computer exploration and, to this end, I am leading the development of the (algebraic) combinatorics project Sage-Combinat.

List of publications

See also my resume.

Habilitation à diriger des recherches (10 décembre 2008)

Some recent talks

Students and former students


Older things:
Our cardboard cathedral

Hobbies & interests

Valid HTML 4.0!
Welcome to Nicolas' home / Isil's home / Nicolas M. Thiéry
Last modified: Fri May 11 11:56:18 2018