A q-queens problem IV. Attacking configurations and their denominators

DOI10.1016/J.DISC.2019.111649MaRDI QIDQ2279971zbMATH OpenOpenAlexFDO

Authors Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky

Publication date 17 December 2019

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.04741

zbMATH Keywords

arrangement of hyperplanesdiscrete Fibonacci spiralEhrhart theoryfairy chess piecesinside-out polytopenonattacking chess pieces

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15)

Abstract: In Parts I-III we showed that the number of ways to place $q$ nonattacking queens or similar chess pieces on an $nimesn$ chessboard is a quasipolynomial function of $n$ whose coefficients are essentially polynomials in $q$. In this part we focus on the periods of those quasipolynomials. We calculate denominators of vertices of the inside-out polytope, since the period is bounded by, and conjecturally equal to, their least common denominator. We find an exact formula for that denominator of every piece with one move and of two-move pieces having a horizontal move. For pieces with three or more moves, we produce geometrical constructions related to the Fibonacci numbers that show the denominator grows at least exponentially with $q$.

Recommendations

• A \(q\)-queens problem. II: The square board
• A \(q\)-queens problem. V: Some of our favorite pieces: queens, bishops, rooks, and nightriders
• A q-queens problem. I: General theory
• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A \(q\)-queens problem. VI. The bishops' period

Cites work

• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A q-queens problem. I: General theory
• A \(q\)-queens problem. II: The square board
• A \(q\)-queens problem. VI. The bishops' period
• A survey of known results and research areas for \(n\)-queens
• Inside-out polytopes
• The n-Queens Problem

Cited in

(8)

• A billiards-like dynamical system for attacking chess pieces
• A \(q\)-queens problem. II: The square board
• A \(q\)-queens problem. V: Some of our favorite pieces: queens, bishops, rooks, and nightriders
• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A \(q\)-queens problem. VI. The bishops' period
• Counting nonattacking chess piece placements: bishops and anassas
• Counting with two-level polynomials
• A q-queens problem. I: General theory

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A \(q\)-queens problem IV. Attacking configurations and their denominators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279971)