[math-fun] poly-anygons; count of chess positions

[Sascha Kurz]

Dear SeqFans,

On Tue, 18 Oct 2005, Schroeppel, Richard wrote:
> I decided to count polyanygons.
> These are kind of like polyominos, except you can use
> any regular polygons of side = 1, as long as there's no
> overlapping.
> ...

some similar stuff. Together with a student we have defined k-polyominoes
as non-overlapping unions of n regular k-gons and have counted a few
values by a computer program, see
http://www.mathe2.uni-bayreuth.de/sascha/oeis/k-polyominoes.html
For n<=4 we have obtained exact formulas. The work is going on as a
masters thesis.

Sincerely yours,
Sascha Kurz

-- 
Dipl. Math. Sascha Kurz
TEL:   -49-921-557353
email: sascha.kurz at uni-bayreuth.de
Raum:  FAN D.1.31
Lehrstuhl fuer Wirtschaftsmathematik
Universitaet Bayreuth
D-95440 Bayreuth
http://www.wm.uni-bayreuth.de