Title
A -queens problem. VI. The bishops' period.
Abstract
The number of ways to place q nonattacking queens, bishops, or similar chess pieces on an n x n 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.
Year
DOI
Venue
2019
10.26493/1855-3974.1657.d75
ARS MATHEMATICA CONTEMPORANEA
Keywords
DocType
Volume
Nonattacking chess pieces,Ehrhart theory,inside-out polytope,arrangement of hyperplanes,signed graph
Journal
16
Issue
ISSN
Citations 
2
1855-3966
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Seth Chaiken1102.50
Christopher R. H. Hanusa2276.63
T. Zaslavsky329756.67