A combinatorial solution to LIMO 2010 question 10

2010/06/23 by Stijn Vermeeren, Vermeeren, Stijn
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1006.4473

openalex publication_date 2010/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Problem 10 of the Landelijke Interuniversitaire Mathematische Olympiade 2010 asks for a proof that all matrices in a certain family are nilpotent. Both model solutions prove this using the Cayley-Hamilton theorem. I give a purely combinatorial proof.

Related

• On Numbers of Tuples of Nilpotent Matrices over Finite Fields under Simultaneous Conjugation
• Remarks on two theorems in linear algebra
• Some notes about matrices, 4
• Some matrices with nilpotent entries, and their determinants
• A Proof of the Box Conjecture for Commuting Pairs of Matrices