2000 character limit reached
Torus Queen Independence
Published 28 Apr 2024 in math.CO | (2404.18237v2)
Abstract: Define a queen on $\mathbb{Z}_nd$ with admissible moves parallel to $\mathbf{x}\in{-1,0,1}d$ at arbitrary length. How many queens can be placed on $\mathbb{Z}_nd$ 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 $d$ dimensions, showing that the trivial upper bound $n{d-1}$ cannot be attained if $n$ is a multiple of $5$, not $25$. We demonstrate, for every $d$, how $n{d-1}-O(n{d-2})$ queens can be placed independently.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.