An inequality on broken chessboards

Details An inequality on broken chessboards An inequality on broken chessboards

2006-01-05

arxiv.org/abs/math/0601094v1

Mathematics

Combinatorics

Scientific paper

For any partition of a positive integer we consider the chess (or draughts) colouring of its associated Ferrers graph. Let b denote the total number of black unit squares, and w the number of white squares. In this note we characterize all pairs (b,w) which arise in this way. This simple combinatorical result was discovered by characterizing Hilbert series of certain right modules over cubic three-dimensional Artin-Schelter algebras. However in this note we present a purely combinatorical proof. The result is (at least partially) known in literature, however we found it interesting to present an elementary proof. All additional references and remarks will be mostly appreciated.

Affiliated with

Also associated with

No associations

Rating

An inequality on broken chessboards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An inequality on broken chessboards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An inequality on broken chessboards will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591356