R. M. Wilson

Q: What Schools Are Affiliated With R. M. Wilson

R. M. Wilson is affiliated with the following schools: California Institute of Technology, Ohio State University, Princeton University, Stanford University

R. M. Wilson's AcademicInfluence.com Rankings

R. M. Wilson

Mathematics

#1302

World Rank

#2179

Historical Rank

#541

USA Rank

Group Theory

#106

World Rank

#132

Historical Rank

#23

USA Rank

Number Theory

#169

World Rank

#221

Historical Rank

#34

USA Rank

Algebra

#196

World Rank

#295

Historical Rank

#46

USA Rank

mathematics Degrees

Download Badge

Mathematics

R. M. Wilson's Degrees

PhD Mathematics Princeton University
Masters Mathematics Stanford University

Why Is R. M. Wilson Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Michael Wilson is a mathematician and a professor emeritus at the California Institute of Technology. Wilson and his PhD supervisor Dijen K. Ray-Chaudhuri, solved Kirkman's schoolgirl problem in 1968. Wilson is known for his work in combinatorial mathematics, as well as on historical flutes.

(See a Problem?)

R. M. Wilson's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A course in combinatorics (1992) (1651)
Intersection theorems with geometric consequences (1981) (532)
Quasi-random graphs (1988) (484)
The exact bound in the Erdös-Ko-Rado theorem (1984) (302)
On $t$-designs (1975) (283)
An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures (1975) (259)
Cyclotomy and difference families in elementary abelian groups (1972) (255)
Constructions and Uses of Pairwise Balanced Designs (1975) (250)
Solution of Kirkman''s schoolgirl problem (1971) (223)
An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms (1972) (210)
An existence theory for pairwise balanced designs (1969) (205)
Graph puzzles, homotopy, and the alternating group☆ (1974) (204)
On the minimum distance of cyclic codes (1986) (188)
The Erdös-Ko-Rado theorem for vector spaces (1986) (185)
An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures (1972) (171)
Embeddings of Steiner triple systems (1973) (161)
A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-Subsets (1990) (151)
Concerning the number of mutually orthogonal latin squares (1974) (124)
The Existence of Resolvable Block Designs (1973) (102)
Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes (1993) (100)
Nonisomorphic Steiner triple systems (1974) (82)
Whitney Number Inequalities for Geometric Lattices (1975) (78)
On the Preparata and Goethals codes (1983) (75)
Decompositions of Edge-Colored Complete Graphs (2000) (74)
Short codes with a given coveting radius (1989) (65)
On resolvable designs (2006) (65)
The number of submatrices of a given type in a Hadamard matrix and related results (1988) (50)
Cyclotomy and Strongly Regular Graphs (1999) (43)
Some partitions of all triples into steiner triple systems (1974) (42)
The slimmest geometric lattices (1974) (41)
A Course in Combinatorics: Trees (2001) (30)
A lemma on polynomials modulo pm and applications to coding theory (2006) (28)
Set Systems with No Singleton Intersection (2006) (28)
Incidence matrices of t-designs (1982) (27)
Constructions of Hadamard Difference Sets (1997) (26)
Covering and packing for pairs (2013) (25)
Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices (1999) (23)
Four pairwise balanced designs (1991) (17)
Inequalities for t Designs (1983) (15)
Diagonal forms of incidence matrices associated with tt-uniform hypergraphs (2014) (14)
A Course in Combinatorics: Two (0, 1, ⋆) problems: addressing for graphs and a hash-coding scheme (2001) (13)
On 2-Designs (1985) (11)
The number of sub-matrics of a given type in a Hadamard matrix and related results (1987) (11)
Binary cyclic codes generated by mira7 (1986) (10)
The decomposition of graphs into ladder graphs (1980) (8)
Combinatorial Design Theory (2009) (7)
On set systems with restricted intersections modulo p and p-ary t-designs (2009) (6)
The cone condition and t-designs (2007) (5)
More on decompositions of edge-colored complete graphs (2008) (5)
The proportion of various graphs in graph-designs (2010) (4)
A Course in Combinatorics: Preface to the second edition (2001) (4)
Codes and modules associated with designs and t-uniform hypergraphs (2011) (4)
A Course in Combinatorics: De Bruijn sequences (2001) (3)
A Course in Combinatorics: The principle of inclusion and exclusion; inversion formulae (2001) (2)
A Course in Combinatorics: Elementary counting; Stirling numbers (2001) (2)
A Course in Combinatorics: Pólya theory of counting (2001) (1)
A Course in Combinatorics: Designs (2001) (1)
Hadamard matrices, Reed–Muller codes (2001) (1)
A Course in Combinatorics: Flows in networks (2001) (1)
A Course in Combinatorics: Turán's theorem and extremal graphs (2001) (1)
A Course in Combinatorics: Lattices and Möbius inversion (2001) (1)
A Course in Combinatorics: Planarity and coloring (2001) (0)
Codes and symmetric designs (2001) (0)
A Course in Combinatorics: Formal power series (2001) (0)
A Course in Combinatorics: Codes and designs (2001) (0)
A Course in Combinatorics: Recursions and generating functions (2001) (0)
Embeddings of graphs on surfaces (2001) (0)
Existence of Steiner systems that admit automorphisms with large cycles (2000) (0)
A Course in Combinatorics: Difference sets and the group ring (2001) (0)
Diagonal forms for incidence matrices and zero-sum Ramsey theory (2011) (0)
A Course in Combinatorics: Permanents (2001) (0)
On the crossing number of K(9,9) SURF 2002 Final Report (2002) (0)
Combinatorial designs and projective geometries (2001) (0)
A Course in Combinatorics: Projective and combinatorial geometries (2001) (0)
Enumeration in geometric lattices (1986) (0)
A Course in Combinatorics: Orthogonal Latin squares (2001) (0)
Difference sets and automorphisms (2001) (0)
Systems of distinct representatives (2001) (0)
A Course in Combinatorics: Gaussian numbers and q -analogues (2001) (0)
Dilworth's theorem and extremal set theory (2001) (0)
A Course in Combinatorics: Electrical networks and squared squares (2001) (0)
A Course in Combinatorics: (More) algebraic techniques in graph theory (2001) (0)
A Course in Combinatorics: Baranyai's theorem (2001) (0)
Colorings of graphs and Ramsey's theorem (2001) (0)
A Course in Combinatorics: Hints and comments on problems (2001) (0)
A Course in Combinatorics: Whitney Duality (2001) (0)

This paper list is powered by the following services:

Other Resources About R. M. Wilson

en.wikipedia.org

What Schools Are Affiliated With R. M. Wilson?

R. M. Wilson is affiliated with the following schools:

R. M. Wilson's Academic­Influence.com Rankings

R. M. Wilson's Degrees

Why Is R. M. Wilson Influential?

R. M. Wilson's Published Works

Published Works

Other Resources About R. M. Wilson

What Schools Are Affiliated With R. M. Wilson?

R. M. Wilson's AcademicInfluence.com Rankings