On the Structure of 3D Queen Domination

Abstract: We study the domination number $γ(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 $γ(Q_n^3) = Θ(n^2)$. We also certify exact values for $n \leq 6$ via integer linear programming and independent verification.

• The paper presents a stratified analysis determining optimal queen placements to cover all cells in a 3D chessboard.
• It employs symmetry reduction and integer programming to derive exact bounds for small n and asymptotic estimates for larger boards.
• The work establishes a framework with implications for resource placement in multidimensional grid networks and advanced combinatorial optimization.

Structural and Computational Analysis of 3D Queen Domination

Problem Overview and Context

The paper "On the Structure of 3D Queen Domination" (2604.03793) extends classical chessboard domination problems to the three-dimensional $n \times n \times n$ queen graph, $Q^3_n$. The primary focus is on determining the domination number $\gamma(Q^3_n)$—the minimum cardinality of a dominating set such that every cell of $[n]^3$ is either occupied by a queen or is attacked by one via a 3D queen move. The queen's move in three dimensions encompasses 13 distinct undirected line families: 3 axes, 6 face diagonals, and 4 space diagonals.

The work builds on foundational results from Barr and Rao (0712.2309) and classical 2D domination studies [Ostergard/Weakley, Weakley2022, Finozhenok2007], and establishes a quantitative and structural framework for the analysis of the 3D case.

Core Coverage Stratification and Symmetry Reductions

A key technical contribution is the stratified theorem (Theorem 1), which precisely computes the coverage of "core" cells, i.e., the non-boundary region $C = \{1, ..., n-2\}^3$, by queens placed at various board positions: corners, edges, faces, and interior. The analysis leverages geometric and combinatorial arguments on queen-line truncations due to boundary adjacency.

For each type, the number of core cells dominated ($\kappa(q)$) is computed:

• Corners: $\kappa(q) = m$ (only one space diagonal penetrates the core).
• Edges: $\kappa(q) = 2m-1$ (more directions active, but still constrained).
• Faces: $\kappa(q) \leq 5m-4-\varepsilon_m$ (with $\varepsilon_m$ determined by parity, maximizing at the center of the face).
• Interior: $Q^3_n$0 (all directions fully active from the board center).

The paper proves, for $Q^3_n$1, that interior placements strictly dominate more core cells than any boundary placement, a result formalized via a symmetry-reduction principle. The octahedral symmetry group ($Q^3_n$2) acts on $Q^3_n$3, and the fundamental domain $Q^3_n$4 provides an explicit symmetry-breaking reduction, ensuring that dominating sets can be represented canonically.

Asymptotic and Exact Bounds

The analysis provides both asymptotic and explicit bounds on $Q^3_n$5:

• Lower Bound: From maximum closed neighborhood size, $Q^3_n$6.
• Layered Upper Bound: By placing minimum 2D dominating sets in each fixed $Q^3_n$7 layer, $Q^3_n$8. The tightest known 2D bound [Ostergard/Weakley] is used.
• Projection Argument: As every dominating set projects onto a dominating set in $Q^3_n$9, $\gamma(Q^3_n)$0.

As a result, the domination number scales as $\gamma(Q^3_n)$1. These bounds are sharp up to a multiplicative constant: specifically, $\gamma(Q^3_n)$2, substantiating the efficiency gap between the 3D structure and its lower-dimensional projections.

Computational Certification and Methodology

For small $\gamma(Q^3_n)$3 ($\gamma(Q^3_n)$4), exact values of $\gamma(Q^3_n)$5 are certified using integer linear programming. The ILP formulation and adjacency construction exploit the explicit queen-line enumeration for all 13 directions per cell, yielding the constraint matrix in $\gamma(Q^3_n)$6 time. Automorphism-based symmetry reductions are encoded directly as constraints, systematically pruning the search space as per Corollary 1.

Optimality for $\gamma(Q^3_n)$7 is established via partitioning the search space by lexicographically-first queen placement, with infeasibility certificates for subspaces generated independently. Solution verification uses a separate adjacency checker, confirming domination for all cells regardless of construction details.

Exact results:

• $\gamma(Q^3_n)$8: $\gamma(Q^3_n)$9.
• $[n]^3$0: $[n]^3$1.
• $[n]^3$2: $[n]^3$3.
• $[n]^3$4: $[n]^3$5.

For $[n]^3$6, computational exploration bounded $[n]^3$7 between 10 and 12, with the solver run stopped after 48 hours. The search space scales as $[n]^3$8, presenting substantial computational challenges beyond small $[n]^3$9.

Implications and Future Directions

The stratified core coverage analysis informs both theoretical and practical construction of dominating sets in higher-dimensional grids. The symmetry-reduction principle and automorphism-aware ILP integration represent a powerful methodology for attacking combinatorial optimization in symmetric graphs.

Practically, these results may yield improved strategies for resource placement and coverage in high-dimensional grid networks, sensor distributions, and related applications in coding theory and combinatorial geometry.

Theoretically, the explicit separation between interior and boundary efficiency hints at deeper geometric phenomena in domination and coverage problems. Further exploration may generalize these structural results to $C = \{1, ..., n-2\}^3$0-dimensional boards and other piece graphs (knight, rook, bishop), potentially revealing sharper bounds or novel symmetry-breaking constructions.

The scale of computational certification raises questions around algorithmic approaches, including SAT-based formulations, orbit enumeration, and advanced pruning via group theory.

Conclusion

This paper provides a detailed structural and computational analysis of the 3D queen domination problem, establishing stratified coverage results, formal symmetry reductions, and both asymptotic and exact bounds on the domination number. The findings have substantial implications for both the theory and practice of combinatorial domination in symmetric graphs, while computational limitations suggest promising directions for future research in algorithmic optimization and higher-dimensional generalizations.