### Honorary members

SS Shrikhande

CR Rao

"his contributions to the foundations of modern statistics through the introduction of concepts such as Cramér–Rao inequality, Rao–Blackwellization, Rao distance, Rao measure, and for introducing the idea of orthogonal arrays for the industry to design high-quality products."

He has been the President of the International Statistical Institute, Institute of Mathematical Statistics (USA), and the International Biometric Society. He was inducted into the Hall of Fame of India's National Institution for Quality and Reliability (Chennai Branch) for his contribution to industrial statistics and the promotion of quality control programs in industries.

The

GJ Simmons

A retired cryptographer and former manager of the applied mathematics Department and Senior Fellow at Sandia National Laboratories. He has worked primarily with authentication theory, developing cryptographic techniques for solving problems of mutual distrust and in devising protocols whose function can be trusted, even though some of the inputs or participants cannot be. Simmons has published over 170 papers, many of which are devoted to asymmetric encryption techniques. His technical contributions include the development of subliminal channels which make it possible to conceal covert communications in digital signatures and the mathematical formulation of an authentication channel paralleling in many respects the secrecy channel formulated by Claude Shannon in 1948. He is also the creator of the Ramsey/graph theory-based mathematical game Sim.

Vera Sos

A Hungarian mathematician, specializing in number theory and combinatorics. She was a student and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, the analyst, number theorist, and combinatorist. Until 1987, she worked at the Department of Analysis at the Eötvös Loránd University, Budapest. Since then, she has been employed by the Alfréd Rényi Institute of Mathematics. One of her results is the Kővári–Sós–Turán theorem concerning the maximum possible number of edges in a bipartite graph that does not contain certain complete subgraphs. Another is the following so-called friendship theorem proved with Paul Erdős and Alfréd Rényi: if, in a finite graph, any two vertices have exactly one common neighbor, then some vertex is joined to all others. In number theory, Sós proved the

Henry Gould

Professor Gould has published over 200 papers, which have appeared in about 20 countries. His research has been in combinatorial analysis, number theory, special functions of mathematical physics, and the history of mathematics and astronomy. Gould served as mathematics consultant to the 'Dear Abby' newspaper column. One interesting aspect of this work was writing an explanation of the three ancient Greek problems (trisecting an angle, squaring the circle, and duplicating the cube). A pamphlet on this material was sent to hundreds of readers (mostly secondary school students) in every state and overseas, who wanted to know more about these famous problems.

To nominate someone for honorary membership, please email combinatoricsinstitute@gmail.com

His friends call him "Shrik", but he is
also often referred to as SSS. The development of to-day's very strong group of
Indian researchers in Combinatorics is due largely to the pioneering research
of R.C. Bose and S.S. Shrikhande. One of the few times that Combinatorics made
the pages of the New York Times was when Bose, Parker, and Shrikhande disproved
the famous Euler conjecture that there were no pairs of orthogonal Latin
squares of side 411+2. Shrik is such an innovative research worker in Design
Theory that it is difficult to single out particular achievements, but many
colleagues would cite his work on the extension of quasi-residual designs for
values of lambda greater than 2.

CR Rao

"his contributions to the foundations of modern statistics through the introduction of concepts such as Cramér–Rao inequality, Rao–Blackwellization, Rao distance, Rao measure, and for introducing the idea of orthogonal arrays for the industry to design high-quality products."

He has been the President of the International Statistical Institute, Institute of Mathematical Statistics (USA), and the International Biometric Society. He was inducted into the Hall of Fame of India's National Institution for Quality and Reliability (Chennai Branch) for his contribution to industrial statistics and the promotion of quality control programs in industries.

The

*Journal of Quantitative Economics*published a special issue in Rao's honour in 1991. "Dr Rao is a very distinguished scientist and a highly eminent statistician of our time. His contributions to statistical theory and applications are well known, and many of his results, which bear his name, are included in the curriculum of courses in statistics at bachelor's and master's level all over the world. "GJ Simmons

A retired cryptographer and former manager of the applied mathematics Department and Senior Fellow at Sandia National Laboratories. He has worked primarily with authentication theory, developing cryptographic techniques for solving problems of mutual distrust and in devising protocols whose function can be trusted, even though some of the inputs or participants cannot be. Simmons has published over 170 papers, many of which are devoted to asymmetric encryption techniques. His technical contributions include the development of subliminal channels which make it possible to conceal covert communications in digital signatures and the mathematical formulation of an authentication channel paralleling in many respects the secrecy channel formulated by Claude Shannon in 1948. He is also the creator of the Ramsey/graph theory-based mathematical game Sim.

Vera Sos

A Hungarian mathematician, specializing in number theory and combinatorics. She was a student and close collaborator of both Paul Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, the analyst, number theorist, and combinatorist. Until 1987, she worked at the Department of Analysis at the Eötvös Loránd University, Budapest. Since then, she has been employed by the Alfréd Rényi Institute of Mathematics. One of her results is the Kővári–Sós–Turán theorem concerning the maximum possible number of edges in a bipartite graph that does not contain certain complete subgraphs. Another is the following so-called friendship theorem proved with Paul Erdős and Alfréd Rényi: if, in a finite graph, any two vertices have exactly one common neighbor, then some vertex is joined to all others. In number theory, Sós proved the

*three distance theorem*, conjectured by Hugo Steinhaus and proved independently by Stanisław Świerczkowski.Henry Gould

Professor Gould has published over 200 papers, which have appeared in about 20 countries. His research has been in combinatorial analysis, number theory, special functions of mathematical physics, and the history of mathematics and astronomy. Gould served as mathematics consultant to the 'Dear Abby' newspaper column. One interesting aspect of this work was writing an explanation of the three ancient Greek problems (trisecting an angle, squaring the circle, and duplicating the cube). A pamphlet on this material was sent to hundreds of readers (mostly secondary school students) in every state and overseas, who wanted to know more about these famous problems.

To nominate someone for honorary membership, please email combinatoricsinstitute@gmail.com

## Comments

## Post a Comment