On the number of bishop arrangements on an n n chessboard

zbMATH Open0553.05005MaRDI QIDQ801909FDOQ801909

Helmut Teschke

Publication date: 1984

Published in: Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/141344

zbMATH Keywords

rook polynomials\(n\times n\) chessboardnumber of bishop arrangements

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cited In (2)

• Title not available (Why is that?)
• On the asymptotic enumeration of restricted strip arrangements of a chessboard

This page was built for publication: On the number of bishop arrangements on an \(n\times n\) chessboard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801909)