2024/07/10 by Thengarnanchai, Pantaree, Kaemawichanurat, Pawaton, Ruksasakchai, Watcharintorn +1
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2407.07378
In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of (3 × n)-Latin rectangles whose entries based on a set \1, 2, ..., λ\ in which λ≥ n. Their proof requires Möbius inversion formula and lattice partitions. In this paper, we present a simpler proof by using the idea of mathematical induction and appropriate coloring.