<h1>Wilson, Richard</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Wilson, Ryan M. and Shirley, Wilbur E., el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160211-105020809">Anomalous supersolidity in a weakly interacting dipolar Bose mixture on a square lattice</a>; Physical Review A; Vol. 93; No. 1; Art. No. 011605; <a href="https://doi.org/10.1103/PhysRevA.93.011605">10.1103/PhysRevA.93.011605</a></li>
<li>Wilson, Richard M. and Wong, Tony W. H. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20131024-100335878">Diagonal forms of incidence matrices associated with t-uniform hypergraphs</a>; European Journal of Combinatorics; Vol. 35; 490-508; <a href="https://doi.org/10.1016/j.ejc.2013.06.032">10.1016/j.ejc.2013.06.032</a></li>
<li>Chee, Yeow Meng and Colbourn, Charles J., el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20130930-153617380">Covering and packing for pairs</a>; Journal of Combinatorial Theory. Series A; Vol. 120; No. 7; 1440-1449; <a href="https://doi.org/10.1016/j.jcta.2013.04.005">10.1016/j.jcta.2013.04.005</a></li>
<li>Wilson, Richard M. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110330-093452534">The proportion of various graphs in graph-designs</a>; ISBN 978-0-8218-4865-4; Combinatorics and Graphs; 251-255</li>
<li>Wilson, Richard M. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20090914-121114974">On set systems with restricted intersections modulo p and p-ary t-designs</a>; Discrete Mathematics; Vol. 309; No. 3; 606-612; <a href="https://doi.org/10.1016/j.disc.2008.09.025">10.1016/j.disc.2008.09.025</a></li>
<li>Draganova, Anna and Mutoh, Yukiyasu, el al. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20100715-120722042">More on decompositions of edge-colored complete graphs</a>; Discrete Mathematics; Vol. 308; No. 14; 2926-2943; <a href="https://doi.org/10.1016/j.disc.2007.08.044">10.1016/j.disc.2007.08.044</a></li>
<li>Keevash, Peter and Mubayi, Dhruv, el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:KEEsiamjd06">Set Systems with No Singleton Intersection</a>; SIAM Journal on Discrete Mathematics; Vol. 20; No. 4; 1031-1041; <a href="https://doi.org/10.1137/050647372">10.1137/050647372</a></li>
<li>Wilson, Richard M. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20110720-095319774">A lemma on polynomials modulo p^m and applications to coding theory</a>; Discrete Mathematics; Vol. 306; No. 23; 3154-3165; <a href="https://doi.org/10.1016/j.disc.2004.10.030">10.1016/j.disc.2004.10.030</a></li>
<li>Wilson, Rebecca M. and Jen, Wendy S., el al. (2005) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170420-133643860">Enantioselective Organocatalytic Intramolecular Diels−Alder Reactions. The Asymmetric Synthesis of Solanapyrone D</a>; Journal of the American Chemical Society; Vol. 127; No. 33; 11616-11617; <a href="https://doi.org/10.1021/ja054008q">10.1021/ja054008q</a></li>
<li>Wilson, Richard M. (2000) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180802-155215256">Existence of Steiner systems that admit automorphisms with large cycles</a>; ISBN 9783110198119; Codes and Designs: Proceedings of a conference honoring Professor Dijen K. Ray-Chaudhuri on the occasion of his 65th birthday; 305-312; <a href="https://doi.org/10.1515/9783110198119.305">10.1515/9783110198119.305</a></li>
<li>Brouwer, A. E. and Wilson, R. M., el al. (1999) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200716-154839094">Cyclotomy and Strongly Regular Graphs</a>; Journal of Algebraic Combinatorics; Vol. 10; No. 1; 25-28; <a href="https://doi.org/10.1023/a:1018620002339">10.1023/a:1018620002339</a></li>
<li>Janwa, H. and Wilson, R. M. (1993) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201120-120816991">Hyperplane sections of fermat varieties in P³ in char. 2 and some applications to cyclic codes</a>; ISBN 9783540566861; Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 180-194; <a href="https://doi.org/10.1007/3-540-56686-4_43">10.1007/3-540-56686-4_43</a></li>
<li>Chung, F. R. K. and Graham, R. L., el al. (1988) <a href="https://resolver.caltech.edu/CaltechAUTHORS:CHUpnas88">Quasi-Random Graphs</a>; Proceedings of the National Academy of Sciences of the United States of America; Vol. 85; No. 4; 969-970; PMCID PMC279681; <a href="https://doi.org/10.1073/pnas.85.4.969">10.1073/pnas.85.4.969</a></li>
</ul>