English

Torus Queen Independence

Combinatorics 2024-07-16 v2

Abstract

Define a queen on Znd\mathbb{Z}_n^d with admissible moves parallel to x{1,0,1}d\mathbf{x}\in\{-1,0,1\}^d at arbitrary length. How many queens can be placed on Znd\mathbb{Z}_n^d without any two in conflict? In two dimensions, this problem was initiated by P\'{o}lya in 1918 and resolved by Monsky in 1989. We give the first known results in dd dimensions, showing that the trivial upper bound nd1n^{d-1} cannot be attained if nn is a multiple of 55, not 2525. We demonstrate, for every dd, how nd1O(nd2)n^{d-1}-O(n^{d-2}) queens can be placed independently.

Cite

@article{arxiv.2404.18237,
  title  = {Torus Queen Independence},
  author = {Kada Williams},
  journal= {arXiv preprint arXiv:2404.18237},
  year   = {2024}
}
R2 v1 2026-06-28T16:09:01.043Z