Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematician

Leon Mirsky

Modern

Leon Mirsky, whose full name was Leonid, lived from 19 December 1918 to 1 December 1983 and was a Russian-British mathematician who worked in number theory, linear algebra and combinatorics. Born in Russia, he was sent at the age of eight to live with relatives in Germany and then in Bradford, England, studied at King's College London and Bristol, and spent most of his career at the University of Sheffield, where he earned his doctorate in 1949 and received a personal chair in 1971. His early work concerned r-free numbers, and with Paul Erdos he bounded the number of distinct values of the divisor function. He wrote textbooks on linear algebra and transversal theory, and Mirsky's theorem, a dual of Dilworth's theorem on chains and antichains in partially ordered sets, is named after him.

Facts
Biography
Gender
Male 1
Birth Year
1918 1
Connections

In Branch

Source Leonid Mirsky (Wikipedia)
Source Leonid Mirsky (Wikipedia)
Source Leonid Mirsky (Wikipedia)

Principal Result

Source Leonid Mirsky (Wikipedia)

Proofs Credited

Source Mirsky's theorem (Wikipedia)
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Source Leonid Mirsky (Wikipedia)Lead, nationality / culture
Quote, Lead, nationality / culture
was a Russian-British mathematician

Also in Geography Atlas: the nationality of this subject.

Source Leonid Mirsky (Wikipedia)Lead, nationality / culture
Quote, Lead, nationality / culture
was a Russian-British mathematician
Sources
1. Leonid Mirsky (Wikipedia)
  • Lead
    19 December 1918
  • Biography
    his parents sent him to live with his aunt and uncle
  • Lead, nationality / culture
    was a Russian-British mathematician
View the Source
Mirsky's theorem (Wikipedia)
Proofs Credited: Mirsky's Theorem, Lead sentence
Quote, Proofs Credited: Mirsky's Theorem, Lead sentence
It is named for Leon Mirsky (1971) and is closely related to Dilworth's theorem on the widths of partial orders, to the perfection of comparability graphs, to the Gallai-Hasse-Roy-Vitaver theorem relating longest paths and colorings in graphs, and to the Erdős-Szekeres theorem on monotonic subsequences.
View the Source

Take a Related Quiz

Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.