Search arXivSearch

arXiv · 2404.18237

Torus Queen Independence

Abstract

Define a queen on $\mathbb{Z}_n^d$ with admissible moves parallel to $\mathbf{x}\in\{-1,0,1\}^d$, of arbitrary length. How many queens can be placed on $\mathbb{Z}_n^d$ without any two in conflict? In two dimensions, this problem was initiated by Pólya in 1918 and resolved by Monsky in 1989. We give the first known impossibility result in $d>2$ dimensions, showing that a trivial upper bound $n^{d-1}$ cannot be achieved if $n$ is a multiple of $5$ and not of $25$. Moreover, we conjecture that $n^{d-1}-O(n^{d-2})$ queens can be placed independently, which we prove if $n$ has no prime divisor less than $2^{\lfloor d/2\rfloor +1}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kada Williams. 2026-06-24. Torus Queen Independence. https://arxiv.org/abs/2404.18237

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO