New constructions solve the Crazy Knight's Tour Problem for cyclically k-diagonal arrays with odd n and k, supporting a conjecture that this is necessary and sufficient.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2023 2verdicts
UNVERDICTED 2representative citing papers
Constructs infinite families of simple generalized Heffter arrays over cyclic groups with row/column weights ≡0 mod 4, including the first rectangular simple classic Heffter arrays with <n nonzeros per row.
citing papers explorer
-
A conjecture on the Crazy Knight's Tour Problem
New constructions solve the Crazy Knight's Tour Problem for cyclically k-diagonal arrays with odd n and k, supporting a conjecture that this is necessary and sufficient.
-
Constructing generalized Heffter arrays via near alternating sign matrices
Constructs infinite families of simple generalized Heffter arrays over cyclic groups with row/column weights ≡0 mod 4, including the first rectangular simple classic Heffter arrays with <n nonzeros per row.