Year: 2026
Type: preprint
Abstract: Switching methods can be seen as certain local transformations that do not alter their basic parameters of a combinatorial structure. Efforts have been devoted in the literature to relate and unify the switching theories for codes and designs, and also for Hadamard matrices and graphs. The combinatorial structures we consider in this paper are graphs and designs. We show an extension of known switching method for constructing 2-designs to divisible designs, and then provide some examples of its application. Moreover, we prove several equivalences between switching methods for graphs and designs, and as a byproduct, we obtain a new switching method to obtain 2-designs.
Source: arXiv (Cornell University)
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7213597154