A combinatorial proof of Fisher's inequality (Q2657061): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3037947048 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2003.06286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonuniform Fisher inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Integer-making'' theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing matrices with line shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Fisher's Inequality for Balanced Incomplete Block Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5790167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5842949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some Theorems in Combinatorics Relating to Incomplete Block Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Applications of Diophantine Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counting proof of the Graham-Pollak theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Fisher's inequality / rank
 
Normal rank

Latest revision as of 19:59, 24 July 2024

scientific article
Language Label Description Also known as
English
A combinatorial proof of Fisher's inequality
scientific article

    Statements