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

DOI10.26493/1855-3974.1657.d75zbMath1416.05131arXiv1405.3001OpenAlexW2962988837WikidataQ128142277 ScholiaQ128142277MaRDI QIDQ5225057

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

Publication date: 25 July 2019

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

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

zbMATH Keywords

arrangement of hyperplanessigned graphEhrhart theoryinside-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) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Signed and weighted graphs (05C22) Recreational mathematics (00A08)

Related Items

A \(q\)-queens problem IV. Attacking configurations and their denominators, A billiards-like dynamical system for attacking chess pieces, A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders, A $q$-Queens Problem. III. Nonattacking Partial Queens

Cites Work

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