Shrikhande S. S.
name = Sharadchandr S. Shrikhande
box_width = 300px
birth_date = birth date|1917|10|19|mf=y
birth_place = Sagar, Madhya Pradesh,
Mumbai University, India, University of North Carolina at Chapel Hill, Banaras Hindu University, India
doctoral_advisor = Dr.
Raj Chandra Bose|
Sharadchandra Shankar Shrikhande was born on
October 19, 1917in Sagar, Madhya Pradesh, India. He is notable for his work along with R. C. Bose and E. T. Parker in their disproof of the famous conjecturemade by Leonhard Eulerin 1782.
Shrikhande taught at various universities in the US and in India. [citation|url=http://mospi.nic.in/mospi_stat_news_letter.htm|journal=Statistical Newsletter|date=July-September 2003|volume=XXVIII|issue=3|title=Prof. S. S. Shrikhande – An Outstanding Statistician|page=3.] Currently (2008), he resides in
Michigan, US. He is father of four children, and has five grandchildren, and three great grandchildren.
Shrikande served as a Professor of Mathematics at
Banaras Hindu University, Banaras. He was Head of the Department of Mathematics, University of Mumbaiand the Director of the Center of Advanced Study in Mathematics, Mumbai since its inception in 1963 until he retired in 1978.
Shrikhande's Ph.D. students were S. Bhagavan Das,
Vasanti N. Bhat-Nayakand Navin M. Singhi.mathgenealogy|name=Shartchandra S. Shrikhande|id=47278.]
Contributions to mathematics
His specialty was
combinatoricsand statistical designs. He is notable for his work along with R. C. Bose and E. T. Parker in their disproof of the famous conjecturemade by Leonhard Eulerdated 1782 that there do not exist two mutually orthogonal latin squares of order 4n + 2 for every n. [citation|title=Major Mathematical Conjecture Propounded 177 Years Ago Is Disproved|publisher= New York Times|date=April 26, 1959|last=Osmundsen|first=John A.|url=http://select.nytimes.com/gst/abstract.html?res=F50613FB355C1A7B93C4AB178FD85F4D8585F9. [http://www.cecm.sfu.ca/organics/papers/lam/paper/html/NYTimes.html Scan of full article] .] Shrikhande is also known for discovering the Shrikhande graphwhich is used in balanced incomplete block designs for experiments.
One of his children, [http://www.cst.cmich.edu/units/mth/gradinfo/pp/MTHShrikhande.html Mohan Shrikhande] , is a Professor of Combinatorial Mathematics at
Central Michigan Universityin Mt. Pleasant, Michigan.
Shrikhande's co-authors include
Navin M. Singhi, Vasanti N. Bhat-Nayak,E. T. Parker,Raj Chandra Bose, Siddani Bhaskara Rao,Ranjan Naik,Sharad Sane,N. C. Jain,D. Raghava Rao,S. Bhagavan Das,W. H. Clatworthy,W. B. Taylor,H. Hartley,Olkin, I,W. Hoeffdig, andN. K. Singh.
Erdős numberis 2.
*citation | last1 = Bose | first1 = R. C. | last2 = Shrikhande | first2 = S. S.
title = On the falsity of Euler's conjecture about the non-existence of two orthogonal Latin squares of order 4"t"+2
Proceedings of the National Academy of Sciences
volume = 45 | issue = 5 | year = 1959 | pages = 734–737
url = http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=222625.
url = http://links.jstor.org/sici?sici=0003-4851(197004)41%3A2%3C683%3AAEOWTF%3E2.0.CO%3B2-D
title = An Extension of Wilks' Test for the Equality of Means
first1 = I. | last1 = Olkin | first2 = S. S. | last2 = Shrikhande
journal = The Annals of Mathematical Statistics
volume = 41 | issue = 2 | year = 1970 | pages = 683-687.
first1 = Ranjan N. | last1 = Naik
first2 = S. B. | last2 = Rao
first3 = S. S. | last3 = Shrikhande
first4 = N. M. | last4 = Singhi
title = Intersection graphs of "k"-uniform hypergraphs
journal = European J. Combinatorics | volume = 3 | pages = 159–172 | year = 1982
id = MathSciNet | id = 0670849.
first1 = S.S. | last1 = Shrikhande
title = The uniqueness of the L2 association scheme
journal = Ann .Math. Statist. | volume = 30 | pages = 781-798 | year = 1959.
* [http://www.win.tue.nl/~aeb/drg/graphs/Shrikhande.html An explanation of the Shrikhande graph] .
* [http://www.oakland.edu/enp/Erdos0 Erdos Number Project]
Wikimedia Foundation. 2010.
Look at other dictionaries:
Shrikhande graph — infobox graph name = Shrikhande graph image caption = The Shrikhande graph drawn symmetrically. namesake = S. S. Shrikhande vertices = 16 edges = 48 chromatic number = chromatic index = properties = Strongly regularThe Shrikhande graph is a named … Wikipedia
Graphe de Shrikhande — Représentation du graphe de Shrikhande Nombre de sommets 16 Nombre d arêtes 48 Distribution des degrés 6 régulier Rayon … Wikipédia en Français
Line graph of a hypergraph — The line graph of a hypergraph is the graph whose vertex set is the set of the hyperedges of the hypergraph, with two edges adjacent when they have nonempty intersection. In other words, the line graph of a hypergraph is the intersection graph of … Wikipedia
Raj Chandra Bose — (June 19, 1901 October 31, 1987) Indian mathematician and statistician best known for his work in design theory and the theory of error correcting codes in which the class of BCH codes is partly named after him. He was notable for his work along… … Wikipedia
Латинский квадрат — n го порядка таблица L=(lij) размеров n × n, заполненная n элементами упорядоченного множества M таким образом, что в каждой строке и в каждом столбце таблицы каждый элемент из M встречается в точности один раз. Пример латинского квадрата 3 … Википедия
Navin M. Singhi — N. M. Singhi Born 1949 Citizenship Indian … Wikipedia
Graeco-Latin square — Orthogonal Latin squares of order 3 Orthogonal Latin squares of order 5 In mathematics, a Graeco Latin square or Euler square or orthogonal Latin squares of order n over two … Wikipedia
CRKL — V crk sarcoma virus CT10 oncogene homolog (avian) like, also known as CRKL, is a human gene. PBB Summary section title = summary text = v CRK avian sarcoma virus CT10 homolog like contains one SH2 domain and two SH3 domains. CRKL has been shown… … Wikipedia
PIK3R2 — Phosphoinositide 3 kinase, regulatory subunit 2 (beta) Rendering based on PDB 2KT1 … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium