EUVIMEDEUVIMED entdecken
Crossref

The triplication method for constructing strong starters

Oleg Ogandzhanyants, Sergey Sadov, Margo Kondratieva

Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 115-160

DOI: 10.61091/jcmcc131-08 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Oleg Ogandzhanyants und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The triplication method for constructing strong starters in \(\mathbb{Z}_{3m}\) from starters in \(\mathbb{Z}_{m}\) (say, a starter of order 21 from a starter of order 7) was proposed by the authors in 2025. The method reduced the construction of this particular combinatorial design (a strong starter in a cyclic group) to solving a Sudoku-type problem – an independent task with its own tools and techniques available. The Sudoku-type problem was formulated in terms of the so-called triplication table constructed from a starter of order \(m\). The method was applicable to odd orders \(m\ge 7\) not divisible by 3. In the present paper, our previous approach is developed in two directions: (1) the definition of the triplication table is generalized, which expands possibilities for its construction to include three base starters, “pseudostarters”, or even more general setup; (2) the formulation of the Sudoku-type problem is broadened to embrace various scenarios of “modular encoding” and reconstruction of strong starters from its solution. A theoretical gain of these developments is an improved understanding of the general structure of the triplication approach. A practical outcome is that all odd values \(m \ge 5\) (including those divisible by 3) are now admissible and the set of possible triplication tables is so broad that any latent strong starter of odd order \(3m\) can emerge by triplication.

Zitieren

APA

Ogandzhanyants, O., Sadov, S., & Kondratieva, M. (2026). The triplication method for constructing strong starters. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 115-160. https://doi.org/10.61091/jcmcc131-08

Vancouver

Ogandzhanyants O, Sadov S, Kondratieva M. The triplication method for constructing strong starters. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:115-160. doi:10.61091/jcmcc131-08

BibTeX
@article{Ogandzhanyants2026,
  author = {Ogandzhanyants, Oleg and Sadov, Sergey and Kondratieva, Margo},
  title = {The triplication method for constructing strong starters},
  journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
  year = {2026},
  volume = {131},
  pages = {115--160},
  doi = {10.61091/jcmcc131-08}
}
Kostenlos starten →