BIROn - Birkbeck Institutional Research Online

    Putting dots in triangles

    Blackburn, S.R. and Paterson, Maura B. and Stinson, D.R. (2011) Putting dots in triangles. Journal of Combinatorial Mathematics and Combinatorial Computing 78 , pp. 23-32. ISSN 0835-3026.

    [img] Text (Refereed)
    0910.4325v3.pdf - Submitted Version
    Restricted to Repository staff only

    Download (107kB)

    Abstract

    Given a right-angled triangle of squares in a grid whose horizontal and vertical sides are $n$ squares long, let N(n) denote the maximum number of dots that can be placed into the cells of the triangle such that each row, each column, and each diagonal parallel to the long side of the triangle contains at most one dot. It has been proven that $N(n) = \lfloor \frac{2n+1}{3} \rfloor$. In this note, we give a new proof of this result using linear programming techniques.

    Metadata

    Item Type: Article
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Economics, Mathematics and Statistics
    Depositing User: Maura Paterson
    Date Deposited: 29 Nov 2012 09:57
    Last Modified: 17 Apr 2013 12:33
    URI: http://eprints.bbk.ac.uk/id/eprint/5363

    Statistics

    Downloads
    Activity Overview
    2Downloads
    87Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item