On the Structure of 3D Queen Domination
Pith reviewed 2026-05-13 17:29 UTC · model grok-4.3
The pith
The 3D queen domination number is Theta of n squared because interior positions dominate strictly more inner-core vertices than boundary ones.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper shows that in the n by n by n queen graph, a queen placed in the interior dominates strictly more inner-core vertices than one placed on the corner, edge, or face, and this stratified count combined with octahedral symmetry yields both a quadratic lower bound and a matching upper bound on the domination number gamma of Q sub n cubed.
What carries the argument
A position-stratified counting theorem that assigns different numbers of dominated inner-core vertices to queens in corner, edge, face, and interior locations.
If this is right
- The domination number gamma(Q_n^3) satisfies gamma = Theta(n^2).
- Exact domination numbers are obtained for all n up to 6 by integer linear programming.
- Optimal solutions can exploit the octahedral symmetry group to reduce the search space.
- Boundary positions are provably less efficient for covering the core.
Where Pith is reading between the lines
- This counting method could extend to four or higher dimensions to bound queen domination there.
- The strict inequality between interior and boundary suggests that for large n most queens in a minimal set will sit away from the surface.
- Similar stratification might apply to other chess pieces or to domination on different grid graphs.
Load-bearing premise
That the inner-core vertices remain well-defined for all n and the attack counts for each position type hold without overlaps that would erase the advantage of interior placements.
What would settle it
Finding an n where the minimal number of queens exceeds c n squared for some constant c, or where a boundary-heavy configuration dominates the core better than any interior one.
read the original abstract
We study the domination number $\gamma(Q_n^3)$ of the three-dimensional $n \times n \times n$ queen graph. The main result is a stratified theorem computing, for each position type -- corner, edge, face, or interior -- the number of inner-core vertices dominated by a queen, and showing in particular that interior placements dominate strictly more core cells than boundary placements. This yields a symmetry-reduction principle via the octahedral group and complements the standard counting lower bound and layered upper bound, giving $\gamma(Q_n^3) = \Theta(n^2)$. We also certify exact values for $n \leq 6$ via integer linear programming and independent verification.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies the domination number γ(Q_n³) of the three-dimensional n×n×n queen graph. Its central contribution is a stratified theorem that computes, for each of four position classes (corner, edge, face-center, interior), the exact number of inner-core vertices dominated by a queen; the theorem establishes that interior placements dominate strictly more core cells than boundary placements. This count is obtained by enumerating the 26 attack rays with boundary truncation and yields closed-form expressions linear in n. The result supplies a symmetry-reduction principle under the octahedral group action, which is combined with a standard |V|/max-coverage counting lower bound and a layered construction for the upper bound to conclude that γ(Q_n³) = Θ(n²). Exact values for n ≤ 6 are certified by integer linear programming on the reduced orbit space together with independent verification.
Significance. If the derivations hold, the work supplies the first asymptotic determination of the three-dimensional queen domination number together with a reusable symmetry-reduction technique and explicit domination-count formulas. The combination of a parameter-free counting argument, a constructive upper bound, and machine-checked small-n values constitutes a solid contribution to the literature on multidimensional domination problems. The octahedral symmetry reduction and the strict interior-versus-boundary inequality are likely to be useful in related chessboard-graph problems.
minor comments (3)
- [§3] §3, after the statement of the stratified theorem: the four closed-form expressions for the number of dominated inner-core vertices are given only in the text; placing them in a single table with the four position classes as rows would improve readability and facilitate direct comparison of the linear-in-n terms.
- [§4] §4, paragraph on ILP certification: the reduction to the orbit space under the octahedral group is described, but the precise size of the reduced instance (number of orbits for each n ≤ 6) is not tabulated; adding this datum would allow readers to reproduce the computational effort.
- [Figure 2] Figure 2 (layered construction): the caption states that the construction achieves the upper bound, yet the figure itself does not label the successive layers or indicate the queens placed on each layer; a minor annotation would clarify how the construction matches the counting lower bound.
Simulated Author's Rebuttal
We thank the referee for the careful summary of our manuscript and for the positive recommendation of minor revision. The assessment accurately reflects the stratified domination theorem, the octahedral symmetry reduction, the counting lower bound, the constructive upper bound, and the exact values obtained for small n via integer linear programming.
Circularity Check
No significant circularity in the derivation chain
full rationale
The stratified theorem defines the inner-core unambiguously as the central (n-2)^3 vertices and derives closed-form domination counts for each position class via exhaustive enumeration of the 26 attack rays with boundary truncation. These counts are then combined with the independent standard counting lower bound (|V| divided by maximum coverage) and a separate layered construction for the upper bound. The octahedral symmetry reduction follows directly from the group action on the four position classes. Small-n values are certified by ILP on the orbit space with independent cross-checks. No step reduces by construction to a fitted parameter, self-definition, or self-citation chain; all load-bearing elements are externally verifiable enumerations or standard arguments.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math The 3D queen graph is defined by standard line-of-sight attacks along rows, columns, and all space diagonals.
Reference graph
Works this paper leans on
-
[1]
J. Barr and S. Rao, The n -queens problem in higher dimensions, preprint, arXiv:0712.2309, 2007. https://doi.org/10.48550/arXiv.0712.2309
-
[2]
E. J. Cockayne, Chessboard domination problems, Discrete Math.\ 86 (1990), 13--20
work page 1990
-
[3]
D. Finozhenok and W. D. Weakley, An improved lower bound for domination numbers of the queen's graph, Australas.\ J.\ Combin.\ 37 (2007), 295--300
work page 2007
-
[4]
P. R. J. \" O sterg a rd and W. D. Weakley, Values of domination numbers of the queen's graph, Electron.\ J.\ Combin.\ 8 (2001), no. 1, R29
work page 2001
-
[5]
W. D. Weakley, Queen domination of even square boards, Electron.\ J.\ Combin.\ 29 (2022), no. 2, P2.50
work page 2022
-
[6]
https://doi.org/10.5281/zenodo.19412672
3D queen domination: computational certification code, Zenodo, 2026. https://doi.org/10.5281/zenodo.19412672
-
[7]
Gurobi Optimization, LLC, Gurobi Optimizer Reference Manual, 2026. https://www.gurobi.com
work page 2026
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.