**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

**Actuarial Association**

seminars:comb:abstract.200903zas

In how many ways can q queens be placed on an n × n chessboard so no two queens attack each other? What about other chess pieces, like bishops or knightriders (a fairy chess piece)? This generalization of the famous n-queens problem can be treated by a hyperplane-arrangement generalization of Ehrhart's theory of counting lattice points in a convex polytope. An ingredient in the Ehrhart-type formula is the least common denominator of the “vertices” of the polytope + the arrangement; this number depends on the Kronecker product of two matrices.

seminars/comb/abstract.200903zas.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported