A q-queens problem. VI. The bishops' period

DOI10.26493/1855-3974.1657.D75zbMATH Open1416.05131arXiv1405.3001OpenAlexW2962988837WikidataQ128142277 ScholiaQ128142277MaRDI QIDQ5225057FDOQ5225057

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

Publication date: 25 July 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: The number of ways to place $q$ nonattacking queens, bishops, or similar chess pieces on an $nimesn$ square chessboard is essentially a quasipolynomial function of $n$ (by Part I of this series). The period of the quasipolynomial is difficult to settle. Here we prove that the empirically observed period 2 for three to ten bishops is the exact period for every number of bishops greater than 2. The proof depends on signed graphs and the Ehrhart theory of inside-out polytopes.

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

Recommendations

• 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. II: The square board
• A \(q\)-queens problem IV. Attacking configurations and their denominators
• A $q$-Queens Problem. III. Nonattacking Partial Queens

zbMATH Keywords

signed graphEhrhart theoryarrangement of hyperplanesinside-out polytopenonattacking chess pieces

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Orthogonal arrays, Latin squares, Room squares (05B15) Signed and weighted graphs (05C22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Recreational mathematics (00A08)

Cites Work

• Title not available (Why is that?)
• Biased graphs. II: The three matroids
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Inside-out polytopes
• A bidirected generalization of network matrices
• Nonattacking queens in a rectangular strip
• A \(q\)-queens problem. II: The square board
• A \(q\)-queens problem. I: General theory
• A \(q\)-queens problem IV. Attacking configurations and their denominators
• A $q$-Queens Problem. III. Nonattacking Partial Queens

Cited In (10)

• A $q$-Queens Problem. III. Nonattacking Partial Queens
• Additive triples of bijections, or the toroidal semiqueens problem
• On the distribution of non-attacking bishops on a chessboard \(C\)
• Non-attacking Bishop and King positions on regular and cylindrical chessboards
• A \(q\)-queens problem. V: Some of our favorite pieces: queens, bishops, rooks, and nightriders
• A \(q\)-queens problem. I: General theory
• A billiards-like dynamical system for attacking chess pieces
• A \(q\)-queens problem IV. Attacking configurations and their denominators
• A \(q\)-queens problem. II: The square board
• Nonattacking queens in a rectangular strip

This page was built for publication: A \(q\)-queens problem. VI. The bishops' period

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