The construction of antipodal triple systems by simulated annealing (Q1923482): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3994799 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4026146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4017158 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3980564 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4304324 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization by Simulated Annealing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3809582 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3975128 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On making two Steiner triple systems disjoint / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4026154 / rank | |||
Normal rank |
Latest revision as of 13:42, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The construction of antipodal triple systems by simulated annealing |
scientific article |
Statements
The construction of antipodal triple systems by simulated annealing (English)
0 references
22 June 1997
0 references
A Steiner triple system \(S(2,3,v)\) is a pair \((S,B)\), where \(S\) is a \(v\)-set and \(B\) is a set of 3-subsets of \(S\), called triples, such that any pair of distinct elements of \(S\) is included in exactly one triple. A cyclic triple is a directed 3-cycle. A Mendelsohn triple system \(M(2,3,v)\) is a decomposition of the arcs of the complete digraph (without loops) on \(v\) vertices into cyclic triples. A Steiner triple system \((S,B)\) is called hemispheric if there exists an orientation of \(B\) into a set \(B'\) of cyclic triples and an involution \(f\) of \(S\) having exactly one fixed point such that \(B\cap f(B)=\varnothing\) and such that \((S,B'\cup f(B'))\) is a Mendelsohn triple system. The resulting triple \((S,B,f)\) is then called an antipodal triple system. The authors use simulated annealing on a carefully chosen feasibility space to show that any \(S(2,3,v)\) with \(7\leq v\leq15\) is hemispheric. They conjecture that every \(S(2,3,v)\) with \(v>3\) is hemispheric.
0 references
Steiner triple system
0 references
Mendelsohn triple system
0 references
hemispheric
0 references
antipodal triple system
0 references
simulated annealing
0 references
feasibility space
0 references
0 references