Posts

Showing posts from May, 2019

The 33rd Midwest Conference on Combinatorics and Cominatorial Computing (MCCCC)

The  33 rd    Midwest Conference on Combinatorics and Cominatorial Computing (MCCCC)     will be held on the campus of    the Rochester Institute of Technology, Rochester, NY, October 12(Saturday)-14(Monday), 2019                                   The confirmed plenary Speakers are: Karen Collins,  Wesleyan University; Stephen Hartke,  University of Colorado, Denver; Mark Skandera,  LLehigh University; and Michael Young,  Iowa State University.  We invite the participants to give a 20-minute contributed talk.  Deadline for the submission of abstracts and early registration is September 30, 2019 The conference poster is attached. Please print out this poster and post it on your department bulletin board.  Also, please forward this announcement to the friends and colleagues who might be interested in participating in this conference.  For additional information please contact dansma@rit.edu We hope to see you in Rochester!

Dr. Robin Wilson awarded the 2017 Stanton Medal of the ICA

Image
Stanton Medals honour significant lifetime contributions to promoting the discipline of combinatorics through advocacy, outreach, service, teaching and/or mentoring. Dr. Robin Wilson has, for fifty years, been an outstanding ambassador for graph theory to the general public.   He has lectured widely (giving some 1500 public lectures), and extended the reach of his lectures through television, radio, and videotape.   He has also published extensively (authoring or editing some 40 books) on combinatorial ideas, written in a style that is engaging and accessible.   He has provided direction, encouragement, and support to colleagues and students at all levels.   His superb talents at conveying the beauty of graph-theoretic ideas, and inviting his readers and listeners to join in, have enthused many students, teachers, and researchers. Professor Wilson’s advocacy and outreach for combinatorics continue to yield many positive impacts that are enjoyed by researchers and

Dr. Kai-Uwe Schmidt awarded the 2018 Hall Medal of the ICA

Hall Medals recognize extensive quality research with substantial international impact by Fellows of the ICA in mid-career. Dr. Kai-Uwe Schmidt has repeatedly made outstanding contributions concerning algebraic, analytic and probabilistic techniques for combinatorial problems in coding theory and cryptography. He has published about forty papers in the best journals, covering a substantial breadth.   The hallmark of Dr. Schmidt’s research is the development of novel, fundamental theory that addresses practical applications.   In particular, his research on merit factor, exceptional polynomials, configurations in finite projective planes, and vector spaces over finite fields have all been influential in developing deep theory for practical problems.   Dr. Schmidt is increasingly recognized as a leader in his field through invitations to speak at numerous international conferences and to join prestigious editorial boards.   His nominators characterize his work

Dr. Shuxing Li awarded the 2018 Kirkman Medal of the ICA

Kirkman Medals recognize excellent research by Fellows or Associate Fellows of the ICA early in their research career, as evidenced by an excellent body of published research . Dr. Shuxing Li has made significant contributions on a number of central problems in algebraic coding theory, discrete geometry, combinatorial design theory, and information theory. He applies deep theory and powerful tools to answer fundamental questions, not only in combinatorics but also in practical digital communications applications such as coding, compressed sensing, and energy minimization. The excellence of his PhD thesis was recognized by prizes from Zhejiang University and from Zhejiang Province.   He has published more than twenty papers in prestigious mathematics and electrical engineering journals, conducting a remarkable breadth of research.   His nominators conclude that Dr. Li is “very original, passionate, and hard-working”, and that “the depth and breadth of