[논문 리뷰] The triplication method for constructing strong starters

Oleg Ogandzhanyants, Sergey Sadov외 1명|arXiv (Cornell University)|2026. 03. 09.

graph theory and CDMA systems인용 수 0

한 줄 요약

이 논문은 순환군에서 강력한 스타터를 구성하기 위한 triplication 방법을 일반화하고 확장하여 이전의 나눗셈 제한을 제거하고 다중 기본 스타터와 모듈러 Sudoku 문제를 포함하도록 프레임워크를 확장한다.

ABSTRACT

The triplication method for constructing strong starters in $Z_{3m}$ from starters in $Z_{m}$ (say, a starter of order 21 from a starter of order 7) was proposed by the authors in 2025. The method reduced construction of the 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 for 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 or even ``pseudostarters''; (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 consists in the improved understanding of the general structure of the triplication approach. A practical outcome is elimination of the requirement that $m$ be not divisible by 3. This leads to a broader scope of strong starters obtainable by triplication: any latent strong starter of odd order $3m$ can emerge this way.

연구 동기 및 목표

• Extend the triplication framework to odd orders m where 3 does not necessarily divide m.
• Generalize the triplication table construction beyond the previous constraints.
• Broaden the Modular Sudoku Problem (MSP) formulation to accommodate various modular encodings.
• Prove that a TT and MSP solution yield a strong starter of order 3m.
• Provide practical methods and examples for generating strong starters using the extended framework.

제안 방법

• Define and analyze the triplication table Σm with generalized constraints.
• Introduce discriminating scenarios and modular encodings that map Z3m to Zm via a pair (u, U).
• Formulate the Modular Sudoku Problem (MSP) whose solution yields a compatible table ˜Σr.
• Prove that a congruous pair of tables Σm and ˜Σr yields a strong starter S in Z3m (Theorem 3.7).
• Present explicit constructions of Σm using starters, pseudostarters, and epicycloidal pseudostarters.
• Discuss scenario-independence and provide criteria for MSP solvability and recovery of S.]

실험 결과

연구 질문

• RQ1 How can the triplication table Σm be defined and constructed for odd m without the prior restriction that m is not divisible by 3?
• RQ2 How does the MSP framework recover a strong starter from a given triplication table under different discrimination scenarios?
• RQ3 Under what conditions do Σm and a congruous ˜Σr guarantee a strong starter in Z3m?
• RQ4 What are the practical constructions of Σm (starter-based, pseudostarter-based, epicycloidal) and how do they influence MSP solvability?

주요 결과

• The triplication framework is extended to include three base starters or pseudostarters, expanding construction possibilities.
• A generalized triplication table Σm is defined with updated constraints that ensure a strong starter can be recovered via MSP.
• Two discrimination scenarios (Mod and Carry) are formalized and shown to yield the same set of strong starters, ensuring scenario-independence.
• A central theorem (Theorem 3.7) proves that a TT Σm and a solution to the MSP yield a strong starter in Z3m.
• An MSP-based pipeline (I–III) is established: set up MSP, solve MSP, recover S from Σm and ˜Σr.
• Explicit constructions of Σm include single-starter, triple-starter, and epicycloidal pseudostarter templates.