The triplication method for constructing strong starters

DOI10.61091/JCMCC131-08MaRDI QIDQ7315675zbMATH OpenFDO

Authors Oleg Ogandzhanyants, Sergey Yu. Sadov, Margo Kondratieva

Publication date 18 August 2026

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC131-08

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other combinatorial number theory (11B75)

Cites work

• A Fast Algorithm for Finding Strong Starters
• A multiplication theorem for strong starters
• Constructing strong starters of orders 3p: triplication with SAT solver
• Construction of Room Squares
• Elementary Number Theory
• scientific article; zbMATH DE number 3855125 (Why is no real title available?)
• On products of strong Skolem starters
• Orthogonal and strong frame starters: revisited
• Orthogonal starters in finite abelian groups
• Quintuplication of Room squares
• Strong Skolem starters

This page was built for publication: The triplication method for constructing strong starters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7315675)