Share on Facebook Share on Twitter Email
Answers.com

Navin M. Singhi

 
Wikipedia: Navin M. Singhi
N. M. Singhi

Born 1949
Citizenship Indian Flag of India.svg
Fields Combinatorics, Graph Theory, and Computer science
Institutions TIFR,
University of Mumbai,
Indian Statistical Institute,
Ohio State University
Alma mater University of Mumbai
Doctoral advisor S. S. Shrikhande
Known for Combinatorics and Graph Theory
Notable awards Shanti Swarup Bhatnagar Prize for Science and Technology

Navin Madhavprasad Singhi (born 1949) an Indian mathematician and a professor at TIFR, Colaba,[1] Mumbai, specializing in combinatorics, graph theory and computer science.[2] Singhi wrote two papers with Paul Erdős, giving him an Erdős number of 1.[3] He is the recipient of the prestigious Shanti Swarup Bhatnagar Prize for Science and Technology. Singhi is known for his research in block designs, projective planes, line graphs, and coding theory.

Contents

Career

Singhi was born and raised in Goregaon, Mumbai and earned M.A. in Mathematics from the University of Mumbai. He earned his Ph.D. (1974) from the same institute under the guidance of S. S. Shrikhande.

Selected publications

  • A non-constructible projective plane, S Foldes, NM Singhi - Geometriae Dedicata, 1980 - Springer
  • Dwijendra K. Ray-Chaudhuri, N. M. Singhi, S. Sanyal, P. S. Subramanian: Theory and Design of t-Unidirectional Error-Correcting and d-Unidirectional Error-Detecting Code. IEEE Trans. Computers 43(10): 1221-1226 (1994)
  • M. S. Shrikhande, N. M. Singhi: An elementary derivation of the annihilator polynomial for extremal (2s + 1)-designs. Discrete Mathematics 80(1): 93-96 (1990)
  • Deza, M.; Frankl, P.; Singhi, N. M. (1983), "On functions of strength t", Combinatorica 3 (3–4): 331–339, doi:10.1007/BF02579189, MR0729786 .
  • N. M. Singhi: (19, 9, 4) Hadamard Designs and Their Residual Designs. Journal of Combinatorial Theory, Ser. A 16(2): 241-252 (1974)
  • Naik, Ranjan N.; Rao, S. B.; Shrikhande, S. S.; Singhi, N. M. (1982), "Intersection graphs of k-uniform hypergraphs", European J. Combinatorics 3: 159–172, MR0670849 .

References

External links



Search unanswered questions...
Enter a question here...
Search: All sources Community Q&A Reference topics
 
 

 

Copyrights:

Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Navin M. Singhi" Read more