The configuration polytope of ℓ-line configurations in Steiner triple systems

Mathematica Slovaca

Charles Colbourn¹ 

关键词: Steiner triple system;    configuration;    r-sparsity;    polyhedral inequality;   

DOI  :  10.2478/s12175-008-0111-2

学科分类：数学（综合）

来源: Slovenska Akademia Vied * Matematicky Ustav / Slovak Academy of Sciences, Mathematical Institute

【 摘 要 】

It has been shown that the number of occurrences of any ℓ-line configuration in a Steiner triple system can be written as a linear combination of the numbers of full m-line configurations for 1 ≤ m ≤ ℓ; full means that every point has degree at least two. More precisely, the coefficients of the linear combination are ratios of polynomials in v, the order of the Steiner triple system. Moreover, the counts of full configurations, together with v, form a linear basis for all of the configuration counts when ℓ ≤ 7. By relaxing the linear integer equalities to fractional inequalities, a configuration polytope is defined that captures all feasible assignments of counts to the full configurations. An effective procedure for determining this polytope is developed and applied when ℓ = 6. Using this, minimum and maximum counts of each configuration are examined, and consequences for the simultaneous avoidance of sets of configurations explored.

【 授权许可】

Unknown