|
Karl Heinrich Weise
Karl Heinrich Weise (24 May 1909, Gera – 15 April 1990, Kiel) was a German mathematician. In 1956 he was the president of the German Mathematical Society (''Deutsche-Mathematiker Vereinigung'', DMV). Biography Karl-Heinrich Weise, the son of a middle school teacher, studied mathematics, astronomy, and physics from 1928 to 1930 at Leipzig University. In 1930 he matriculated at the University of Jena, where he received his doctorate in mathematics in 1934. His doctoral dissertation, supervised by Robert König, is entitled ''Beiträge zum Klassenproblem der quadratischen Differentialformen'' (Contributions to the class problem of quadratic differential forms) and was published in 1935 in ''Mathematische Annalen''. At the University of Jena, Weise was from 1935 to 1937 ''wissenschaftliche Assistent'' and from 1937 to 1942 ''Privatdozent''. His ''NSDAP-Mitgliedsnummer'' was 5663631. From 1940 to 1945 he held an appointment as ''wissenschaftlicher Mitarbeiter'' in Potsdam. At Kiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Z22 (computer)
The Z22 was the seventh computer model Konrad Zuse developed (the first six being the Z1, Z2, Z3, Z4, Z5 and Z11, respectively). One of the early commercial computers, the Z22's design was finished about 1955. The major version jump from Z11 to Z22 was due to the use of vacuum tubes, as opposed to the electromechanical systems used in earlier models. The first machines built were shipped to Berlin and Aachen. By the end of 1958 the ZMMD-group had built a working ALGOL 58 compiler for the Z22 computer. ZMMD was an abbreviation for Zürich (where Rutishauser worked), München (workplace of Bauer and Samelson), Mainz (location of the Z22 computer), Darmstadt (workplace of Bottenbruch). In 1961, the Z22 was followed by a logically very similar transistorized version, the Z23. Already in 1954, Zuse had come to an agreement with Heinz Zemanek that his Zuse KG would finance the work of Rudolf Bodo, who helped Zemanek build the early European transistorized computer Mailüfter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wolfgang Gaschütz
Wolfgang is a German male given name traditionally popular in Germany, Austria and Switzerland. The name is a combination of the Old High German words ''wolf'', meaning "wolf", and ''gang'', meaning "path", "journey", "travel". Besides the regular "wolf", the first element also occurs in Old High German as the combining form "-olf". The earliest reference of the name being used was in the 8th century. The name was also attested as "Vulfgang" in the Reichenauer Verbrüderungsbuch in the 9th century. The earliest recorded famous bearer of the name was a tenth-century Saint Wolfgang of Regensburg. Due to the lack of conflict with the pagan reference in the name with Catholicism, it is likely a much more ancient name whose meaning had already been lost by the tenth century. Grimm (''Teutonic Mythology'' p. 1093) interpreted the name as that of a hero in front of whom walks the "wolf of victory". A Latin gloss by Arnold of St Emmeram interprets the name as ''Lupambulus''.E. F ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Andreas Dress
Andreas Dress (born 26 August 1938) is a German mathematician specializing in geometry, combinatorics and mathematical biology. Dress earned his PhD from the University of Kiel in 1962, under the supervision of Friedrich Bachmann and Karl-Heinrich Weise. His thesis is entitled ''Konstruktion metrischer Ebenen''. He has been a professor of mathematics at the University of Bielefeld since 1969. In 1998 he was an Invited Speaker of the International Congress of Mathematicians in Berlin. See also *Split networks *SplitsTree *T-theory *Tight span In metric geometry, the metric envelope or tight span of a metric space ''M'' is an injective metric space into which ''M'' can be embedded. In some sense it consists of all points "between" the points of ''M'', analogous to the convex hull of a po ... References Living people 1938 births 20th-century German mathematicians University of Kiel alumni Academic staff of Bielefeld University {{Germany-mathematician-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kenneth Appel
Kenneth Ira Appel (October 8, 1932 – April 19, 2013) was an American mathematician who in 1976, with colleague Wolfgang Haken at the University of Illinois at Urbana–Champaign, solved one of the most famous problems in mathematics, the four-color theorem. They proved that any two-dimensional map, with certain limitations, can be filled in with four colors without any adjacent "countries" sharing the same color. Biography Appel was born in Brooklyn, New York, on October 8, 1932. He grew up in Queens, New York, and was the son of a Jewish couple, Irwin Appel and Lillian Sender Appel. He worked as an actuary for a brief time and then served in the U.S. Army for two years at Fort Benning, Georgia, and in Baumholder, Germany. In 1959, he finished his doctoral program at the University of Michigan, and he also married Carole S. Stein in Philadelphia. The couple moved to Princeton, New Jersey, where Appel worked for the Institute for Defense Analyses from 1959 to 1961. His main work ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poincaré Conjecture
In the mathematics, mathematical field of geometric topology, the Poincaré conjecture (, , ) is a theorem about the Characterization (mathematics), characterization of the 3-sphere, which is the hypersphere that bounds the unit ball in four-dimensional space. Originally conjectured by Henri Poincaré in 1904, the Grigori Perelman's theorem concerns spaces that locally look like ordinary Euclidean space, three-dimensional space but which are finite in extent. Poincaré hypothesized that if such a space has the additional property that each path (topology), loop in the space can be continuously tightened to a point, then it is necessarily a 3-sphere, three-dimensional sphere. Attempts to resolve the conjecture drove much progress in the field of geometric topology during the 20th century. The Perelman's proof built upon Richard S. Hamilton's ideas of using the Ricci flow to solve the problem. By developing a number of breakthrough new techniques and results in the theory of Ricci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Four Color Problem
In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. ''Adjacent'' means that two regions share a common boundary curve segment, not merely a corner where three or more regions meet. It was the first major theorem to be proved using a computer. Initially, this proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand. The proof has gained wide acceptance since then, although some doubters remain. The four color theorem was proved in 1976 by Kenneth Appel and Wolfgang Haken after many false proofs and counterexamples (unlike the five color theorem, proved in the 1800s, which states that five colors are enough to color a map). To dispel any remaining doubts about the Appel–Haken proof, a simpler proof using the same ideas and still relying on computers was publis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Heinrich Heesch
Heinrich Heesch (June 25, 1906 – July 26, 1995) was a German mathematician. He was born in Kiel and died in Hanover. In Göttingen he worked on Group theory. In 1933 Heesch witnessed the National Socialist purges of university staff. Not willing to become a member of the National Socialist organization of university teachers as required, he resigned from his university position in 1935 and worked privately at his parents' home in Kiel until 1948. During this time he did research on tilings. In 1955 Heesch began teaching at Leibniz University Hannover and worked on graph theory. In this period Heesch did pioneering work in developing methods for a computer-aided proof of the then unproved four color theorem. In particular, he was the first to investigate the notion of "discharging", which turned out to be a fundamental ingredient of the eventual computer-aided proof by Kenneth Appel and Wolfgang Haken. Between 1967 and 1971, Heesch made several visits to the United States ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wolfgang Haken
Wolfgang Haken (June 21, 1928 – October 2, 2022) was a German American mathematician who specialized in topology, in particular 3-manifolds. Biography Haken was born in Berlin, Germany. His father was Werner Haken, a physicist who had Max Planck as a doctoral thesis advisor. In 1953, Haken earned a Ph.D. degree in mathematics from Christian-Albrechts-Universität zu Kiel (Kiel University) and married Anna-Irmgard von Bredow, who earned a Ph.D. degree in mathematics from the same university in 1959. In 1962, they left Germany so he could accept a position as visiting professor at the University of Illinois at Urbana-Champaign. He became a full professor in 1965, retiring in 1998. In 1976, together with colleague Kenneth Appel at the University of Illinois at Urbana-Champaign, Haken solved the four-color theorem. They proved that any two-dimensional map, with certain limitations, can be filled in with four colors without any adjacent “countries” sharing the same color. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computational Group Theory
In mathematics, computational group theory is the study of group (mathematics), groups by means of computers. It is concerned with designing and analysing algorithms and data structures to compute information about groups. The subject has attracted interest because for many interesting groups (including most of the sporadic groups) it is impractical to perform calculations by hand. Important algorithms in computational group theory include: * the Schreier–Sims algorithm for finding the order (group theory), order of a permutation group * the Todd–Coxeter algorithm and Knuth–Bendix algorithm for coset enumeration * the product-replacement algorithm for finding random elements of a group Two important computer algebra systems (CAS) used for group theory are GAP computer algebra system, GAP and Magma computer algebra system, Magma. Historically, other systems such as CAS (for character theory) and Cayley computer algebra system, Cayley (a predecessor of Magma) were important. S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Knot Theory
In the mathematical field of topology, knot theory is the study of knot (mathematics), mathematical knots. While inspired by knots which appear in daily life, such as those in shoelaces and rope, a mathematical knot differs in that the ends are joined so it cannot be undone, Unknot, the simplest knot being a ring (or "unknot"). In mathematical language, a knot is an embedding of a circle in 3-dimensional Euclidean space, \mathbb^3 (in topology, a circle is not bound to the classical geometric concept, but to all of its homeomorphisms). Two mathematical knots are equivalent if one can be transformed into the other via a deformation of \mathbb^3 upon itself (known as an ambient isotopy); these transformations correspond to manipulations of a knotted string that do not involve cutting it or passing through itself. Knots can be described in various ways. Using different description methods, there may be more than one description of the same knot. For example, a common method of descr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Electrologica
N.V. Electrologica was a pioneering Dutch computer manufacturer from 1956 to 1968, when it was taken over by Philips. It was started by A. van Wijngaarden, B.J. Loopstra and C.S. Scholten from the Mathematisch Centrum (Mathematical centre) in Amsterdam, when that organisation decided to spin off and commercialise its work on computers. The most successful computers produced by Electrologica were the Electrologica X1 The Electrologica X1 was a digital computer designed and manufactured in the Netherlands from 1958 to 1965. About thirty were produced and sold in the Netherlands and abroad. The X1 was designed by the Mathematical Centre in Amsterdam, an academ ... and the Electrologica X8. Other stripped-down versions of the X8, the X2 to X5, were less successful. The Stichting Electrologica (“Electrologica Foundation”) is an organisation dedicated to preserving and spreading the history of computing in the Netherlands. References External links * Defunct comp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
