|
Danilo Blanuša
Danilo Blanuša ( sr-cyr, Данило Блануша; 7 December 1903 – 8 August 1987) was a Croatian Serb mathematician, physicist, engineer and a professor at the University of Zagreb. Biography Blanuša was born in Osijek, Austria-Hungary (today Croatia), into an ethnic Serb family. He attended elementary school in Vienna and Steyr in Austria and gymnasium in Osijek and Zagreb. He studied engineering in both Zagreb and Vienna and also mathematics and physics. His career started in Zagreb, where he started to work and lecture. His student Mileva Prvanović completed her doctorate in 1955, the first in geometry in Serbia. Blanuša was the dean of the Faculty of Electrical Engineering, Zagreb in the 1957–58 school year. He received the Ruđer Bošković prize in 1960. He died in Zagreb. Mathematics In mathematics, Blanuša became known for discovering the second and third known snarks in 1946 (the Petersen graph was the first), triggering a new area of graph theory. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Croatian Serb
The Serbs of Croatia ( sh-Cyrl-Latn, separator=" / ", Срби у Хрватској, Srbi u Hrvatskoj) or Croatian Serbs ( sh-Cyrl-Latn, separator=" / ", хрватски Срби, hrvatski Srbi) constitute the largest national minority in Croatia. The community is predominantly Eastern Orthodox Christian by religion, as opposed to the Croats who are Roman Catholic. In some regions of modern-day Croatia, mainly in southern Dalmatia, ethnic Serbs have been present from the Early Middle Ages. Serbs from modern-day Serbia and Bosnia-Herzegovina started actively migrating to Croatia in several migration waves after 1538 when the Emperor Ferdinand I granted them the right to settle on the territory of the Military Frontier. In exchange for land and exemption from taxation, they had to conduct military service and participate in the protection of the Habsburg monarchy's border against the Ottoman Empire. They populated the Dalmatian Hinterland, Lika, Kordun, Banovina, Slavonia, an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dean (education)
Dean is a title employed in academic administrations such as colleges or universities for a person with significant authority over a specific academic unit, over a specific area of concern, or both. In the United States and Canada, deans are usually the head of each constituent college and school that make up a university. Deans are common in private preparatory schools, and occasionally found in middle schools and high schools as well. Origin A "dean" (Latin: ''decanus'') was originally the head of a group of ten soldiers or monks. Eventually an ecclesiastical dean became the head of a group of canons or other religious groups. When the universities grew out of the cathedral schools and monastic schools, the title of dean was used for officials with various administrative duties. Use Bulgaria and Romania In Bulgarian and Romanian universities, a dean is the head of a faculty, which may include several academic departments. Every faculty unit of university or academy. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Immersion (mathematics)
In mathematics, an immersion is a differentiable function between differentiable manifolds whose differential (or pushforward) is everywhere injective. Explicitly, is an immersion if :D_pf : T_p M \to T_N\, is an injective function at every point ''p'' of ''M'' (where ''TpX'' denotes the tangent space of a manifold ''X'' at a point ''p'' in ''X''). Equivalently, ''f'' is an immersion if its derivative has constant rank equal to the dimension of ''M'': :\operatorname\,D_p f = \dim M. The function ''f'' itself need not be injective, only its derivative must be. A related concept is that of an embedding. A smooth embedding is an injective immersion that is also a topological embedding, so that ''M'' is diffeomorphic to its image in ''N''. An immersion is precisely a local embedding – that is, for any point there is a neighbourhood, , of ''x'' such that is an embedding, and conversely a local embedding is an immersion. For infinite dimensional manifolds, this is sometimes ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isometry
In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος ''isos'' meaning "equal", and μέτρον ''metron'' meaning "measure". Introduction Given a metric space (loosely, a set and a scheme for assigning distances between elements of the set), an isometry is a transformation which maps elements to the same or another metric space such that the distance between the image elements in the new metric space is equal to the distance between the elements in the original metric space. In a two-dimensional or three-dimensional Euclidean space, two geometric figures are congruent if they are related by an isometry; the isometry that relates them is either a rigid motion (translation or rotation), or a composition of a rigid motion and a reflection. Isometries are often used in constructions where one space i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Hunting Of The Snark
''The Hunting of the Snark'', subtitled ''An Agony in 8 Fits'', is a poem by the English writer Lewis Carroll. It is typically categorised as a nonsense poem. Written between 1874 and 1876, it borrows the setting, some creatures, and eight portmanteau words from Carroll's earlier poem "Jabberwocky" in his children's novel ''Through the Looking-Glass'' (1871). The narrative follows a crew of ten trying to hunt the Snark, a creature which may turn out to be a highly dangerous ''Boojum''. The only crewmember to find the Snark quietly vanishes, leading the narrator to explain that the Snark was a Boojum after all. The poem is dedicated to young Gertrude Chataway, whom Carroll met at the English seaside town Sandown in the Isle of Wight in 1875. Included with many copies of the first edition of the poem was Carroll's religious tract, ''An Easter Greeting to Every Child Who Loves "Alice"''. ''The Hunting of the Snark'' was published by Macmillan in the United Kingdom in March 1876 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lewis Carroll
Charles Lutwidge Dodgson (; 27 January 1832 – 14 January 1898), better known by his pen name Lewis Carroll, was an English author, poet and mathematician. His most notable works are ''Alice's Adventures in Wonderland'' (1865) and its sequel ''Through the Looking-Glass'' (1871). He was noted for his facility with word play, logic, and fantasy. His poems ''Jabberwocky'' (1871) and ''The Hunting of the Snark'' (1876) are classified in the genre of literary nonsense. Carroll came from a family of high-church Anglicanism, Anglicans, and developed a long relationship with Christ Church, Oxford, where he lived for most of his life as a scholar and teacher. Alice Liddell, the daughter of Christ Church's dean Henry Liddell, is widely identified as the original inspiration for ''Alice in Wonderland'', though Carroll always denied this. An avid puzzler, Carroll created the word ladder puzzle (which he then called "Doublets"), which he published in his weekly column for ''Vanity Fair ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin Gardner
Martin Gardner (October 21, 1914May 22, 2010) was an American popular mathematics and popular science writer with interests also encompassing scientific skepticism, micromagic, philosophy, religion, and literatureespecially the writings of Lewis Carroll, L. Frank Baum, and G. K. Chesterton.Martin (2010) He was also a leading authority on Lewis Carroll. ''The Annotated Alice'', which incorporated the text of Carroll's two Alice books, was his most successful work and sold over a million copies. He had a lifelong interest in magic and illusion and in 1999, MAGIC magazine named him as one of the "100 Most Influential Magicians of the Twentieth Century". He was considered the doyen of American puzzlers. He was a prolific and versatile author, publishing more than 100 books. Gardner was best known for creating and sustaining interest in recreational mathematicsand by extension, mathematics in generalthroughout the latter half of the 20th century, principally through his "Mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called a pl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Four Color Theorem
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 publi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Peter Guthrie Tait
Peter Guthrie Tait FRSE (28 April 1831 – 4 July 1901) was a Scottish mathematical physicist and early pioneer in thermodynamics. He is best known for the mathematical physics textbook '' Treatise on Natural Philosophy'', which he co-wrote with Lord Kelvin, and his early investigations into knot theory. His work on knot theory contributed to the eventual formation of topology as a mathematical discipline. His name is known in graph theory mainly for Tait's conjecture. He is also one of the namesakes of the Tait–Kneser theorem on osculating circles. Early life Tait was born in Dalkeith on 28 April 1831 the only son of Mary Ronaldson and John Tait, secretary to the 5th Duke of Buccleuch. He was educated at Dalkeith Grammar School then Edinburgh Academy. He studied Mathematics and Physics at the University of Edinburgh, and then went to Peterhouse, Cambridge, graduating as senior wrangler and first Smith's prizeman in 1852. As a fellow and lecturer of his college he remai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petersen Graph
In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by . Kempe observed that its vertices can represent the ten lines of the Desargues configuration, and its edges represent pairs of lines that do not meet at one of the ten points of the configuration. Donald Knuth states that the Petersen graph is "a remarkable configuration that serves as a counterexample to many optimistic predictions about what might be true for graphs in general." The Petersen graph also makes an appearance in tropical geometry. The cone over the Petersen graph is naturally identif ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Petersen Graph")