Includes bibliographical references.

A journey of discovery: orthogonal matrices and wireless communications ; Probabilistic expectations on unstructured spaces ; A beginner's guide to forcing ; Higher order necessary conditions in smooth constrained optimization ; Hamiltonian paths and hyperbolic patterns ; When graph theory meets knot theory ; Can an asymmetric power structure always be achieved? ; McKay's canonical graph labeling algorithm ; A multiplicative deformation of the Mobius function for the poset of partitions of a multiset ; Communicating, mathematics, communicating mathematics Joe Gallian style ; Fair allocation methods for coalition games ; Sumsofsquares formulas ; Productfree subsets of groups, then and now ; Generalizations of productfree subsets ; What is a superrigid subgroup? ; Averaging points two at a time ; Vertex algebras as twisted bialgebras: on a theorem of Borcherds Sarah Spence Adams ; John Beam ; Timothy Y Chow ; Elena Constantin ; Douglas Dunham ; Joel S Foisy and Lewis D Ludwig ; Jane Friedman and Cameron Parker ; Stephen G Hartke and A J Radcliffe ; Patricia Hersh and Robert Kleinberg ; Aparna Higgins ; David Housman ; Daniel C Isaksen ; Kiran S Kedlaya ; Kiran S Kedlaya and Xuancheng Shao ; Dave Witte Morris ; David Petrie Moulton ; Manish M Patnaik