Partitions versus sets : a case of duality - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2009

Partitions versus sets : a case of duality

Résumé

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this unification process is definitely good, their main theorem remains quite technical and does not give a real insight of why some decompositions admit dual objects and why others do not. The goal of this paper is both to generalise a little this framework and to give an enlightening simple proof of its central theorem.
Fichier principal
Vignette du fichier
dualite.pdf (126.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00345894 , version 1 (10-12-2008)
hal-00345894 , version 2 (11-03-2009)
hal-00345894 , version 3 (20-10-2009)

Identifiants

Citer

Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé. Partitions versus sets : a case of duality. European Journal of Combinatorics, 2009, pp.1-7. ⟨10.1016/j.ejc.2009.09.004⟩. ⟨hal-00345894v3⟩
234 Consultations
198 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More