13 citations · 37 across the 8 of their papers we have counts for
8 papers · 1 filter
A Theory for Coloring Walks in a Digraph
Seth Chaiken
Consider edge colorings of digraphs where edges and have different colors. This coloring induces a vertex coloring by sets of edge colors, in which edge $v_1 v_…
A -Queens Problem. IV. Attacking Configurations and Their Denominators
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
In Parts I-III we showed that the number of ways to place nonattacking queens or similar chess pieces on an chessboard is a quasipolynomial function of whose co…
A -Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
Parts I-IV showed that the number of ways to place nonattacking queens or similar chess pieces on an chessboard is a quasipolynomial function of whose coefficie…
A -Queens Problem. III. Nonattacking Partial Queens
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
We apply our geometrical theory for counting placements of nonattacking on an chessboard, from Parts~I and II, to partial queens: that is, chess pieces with any com…
A -Queens Problem. II. The Square Board
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
We apply to the chessboard the counting theory from Part I for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen. Part I sho…
A -Queens Problem. I. General Theory
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such a…