A combinatorial proof of Fisher's Inequality

2020/03/12 by Mathew, Rogers, Mishra, Tapas Kumar · 3 citations
#05D05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2003.06286

Abstract

In this note, we give a simple, counting based proof of Fisher's Inequality that does not use any tools from linear algebra.

Cited by

• Symmetric (2^k-1,2^k-1,2^k-2)-designs which are (2^k-1-1)-pyramidal over abelian groups
• The full automorphism groups of the five symmetric (15,8,4)-designs
• q-analogues of Fisher's inequality and oddtown theorem

Related

• q-analogues of Fisher's inequality and oddtown theorem
• A combinatorial proof of Cramer's Rule
• One Hundred Probability and Statistics Inequalities
• Two Proofs of the Fisher Information Inequality via Data Processing Arguments
• A graph theoretic proof of Cramer's rule