Logo image
Se connecter
Combinatorial Designs and Availability
Rapport   Open Access

Combinatorial Designs and Availability

Alain Jean-Marie, Xavier Roche, Vincent Boudet et Anne-Elisabeth Baert
2009

Résumé

F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics/G.2.1.0: Combinatorial algorithms
We consider a variation of Design Theory, in which the elements of the base set may be “available” or not. The random variable of interest is the number of subsets in the design which contain some available element. We are particularly interested in the variance of this variable, and we look for arrangements which minimize this value. We provide the solution to some instances of this problem; we show in particular that Steiner systems optimize this function.

Fichiers et liens (1)

url
Find in HALAfficher

Indicateurs

1 Consultations de la notice

Détails

Logo image