Template:Selected anniversaries/March 31: Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
No edit summary
No edit summary
Line 24: Line 24:
||1890 – William Lawrence Bragg, Australian-English physicist and academic, Nobel Prize laureate (d. 1971) Sir William Lawrence Bragg CH, OBE, MC, FRS[1] (31 March 1890 – 1 July 1971) was an Australian-born British physicist and X-ray crystallographer, discoverer (1912) of Bragg's law of X-ray diffraction, which is basic for the determination of crystal structure. He was joint winner (with his father, William Henry Bragg) of the Nobel Prize in Physics in 1915
||1890 – William Lawrence Bragg, Australian-English physicist and academic, Nobel Prize laureate (d. 1971) Sir William Lawrence Bragg CH, OBE, MC, FRS[1] (31 March 1890 – 1 July 1971) was an Australian-born British physicist and X-ray crystallographer, discoverer (1912) of Bragg's law of X-ray diffraction, which is basic for the determination of crystal structure. He was joint winner (with his father, William Henry Bragg) of the Nobel Prize in Physics in 1915


||1906 Sin-Itiro Tomonaga, Japanese physicist and academic, Nobel Prize laureate (d. 1979)
||Shin'ichirō Tomonaga (b. March 31, 1906), usually cited as Sin-Itiro Tomonaga in English, was a Japanese physicist, influential in the development of quantum electrodynamics, work for which he was jointly awarded the Nobel Prize in Physics in 1965 along with Richard Feynman and Julian Schwinger. Pic.


||Klaus Wagner (b. March 31, 1910) was a German mathematician - topology, graph theory. Wagner's theorem characterizes the planar graphs as exactly those graphs that do not have as a minor either a complete graph K5 on five vertices or a complete bipartite graph K3,3 with three vertices on each side of its bipartition. Pic.
||Klaus Wagner (b. March 31, 1910) was a German mathematician - topology, graph theory. Wagner's theorem characterizes the planar graphs as exactly those graphs that do not have as a minor either a complete graph K5 on five vertices or a complete bipartite graph K3,3 with three vertices on each side of its bipartition. Pic.

Revision as of 16:18, 31 March 2018