|
Vojtěch Rödl
Vojtěch Rödl (born 1 April 1949) is a Czech American mathematician, Samuel Candler Dobbs Professor at Emory University. He is noted for his contributions mainly to combinatorics having authored hundreds of research papers. Academic Background Rödl obtained his PhD from the School of Mathematics and Physics at Charles University in 1976. His supervisor was Zdeněk Hedrlín. From 1973 to 1987 he lectured at the School of Nuclear and Physical Engineering at the Czech Technical University in Prague. He has held visiting positions in various institutions including McMaster University, University of Waterloo, Bell Laboratories, Microsoft, Charles University, Mathematical Institute of the Czech Academy of Science, Bielefeld University, as well as at Humboldt University in Berlin. He serves on the editorial board of several international journals. He has given lectures at many conferences, including plenary address in 2014 at the International Congress of Mathematicians ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Czech Americans
Czech Americans ( cz, Čechoameričané), known in the 19th and early 20th century as Bohemian Americans, are citizens of the United States whose ancestry is wholly or partly originate from the Czech lands, a term which refers to the majority of the traditional lands of the Bohemian Crown, namely Bohemia, Moravia and Czech Silesia. These lands over time have been governed by a variety of states, including the Kingdom of Bohemia, the Austrian Empire, Czechoslovakia, and the Czech Republic also known by its short-form name, Czechia. Germans from the Czech lands who emigrated to the United States are usually identified as German Americans, or, more specifically, as Americans of German Bohemian descent. According to the 2000 US census, there are 1,262,527 Americans of full or partial Czech descent, in addition to 441,403 persons who list their ancestry as Czechoslovak. Historical information about Czechs in America is available thanks to people such as Mila Rechcigl. History The fi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Humboldt Prize
The Humboldt Prize, the Humboldt-Forschungspreis in German, also known as the Humboldt Research Award, is an award given by the Alexander von Humboldt Foundation of Germany to internationally renowned scientists and scholars who work outside of Germany in recognition of their lifetime's research achievements. Recipients are "academics whose fundamental discoveries, new theories or insights have had a significant impact on their own discipline and who are expected to continue producing cutting-edge academic achievements in the future". The prize is currently valued at €60,000 with the possibility of further support during the prize winner's life. Up to one hundred such awards are granted each year. Nominations must be submitted by established academics in Germany. The award is named after the Prussian naturalist and explorer Alexander von Humboldt. Past winners Biology Günter Blobel, Serge Daan, Aaron M. Ellison, Eberhard Fetz, Daniel Gianola, Hendrikus Granzier, Dan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Charles University Alumni
Charles is a masculine given name predominantly found in English and French speaking countries. It is from the French form ''Charles'' of the Proto-Germanic name (in runic alphabet) or ''*karilaz'' (in Latin alphabet), whose meaning was "free man". The Old English descendant of this word was '' Ċearl'' or ''Ċeorl'', as the name of King Cearl of Mercia, that disappeared after the Norman conquest of England. The name was notably borne by Charlemagne (Charles the Great), and was at the time Latinized as ''Karolus'' (as in ''Vita Karoli Magni''), later also as '' Carolus''. Some Germanic languages, for example Dutch and German, have retained the word in two separate senses. In the particular case of Dutch, ''Karel'' refers to the given name, whereas the noun ''kerel'' means "a bloke, fellow, man". Etymology The name's etymology is a Common Germanic noun ''*karilaz'' meaning "free man", which survives in English as churl (< Old English ''ċeorl''), which developed its depr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Czech Mathematicians
Czech may refer to: * Anything from or related to the Czech Republic, a country in Europe ** Czech language ** Czechs, the people of the area ** Czech culture ** Czech cuisine * One of three mythical brothers, Lech, Czech, and Rus' Places *Czech, Łódź Voivodeship, Poland *Czechville, Wisconsin, unincorporated community, United States People * Bronisław Czech (1908–1944), Polish sportsman and artist * Danuta Czech (1922–2004), Polish Holocaust historian * Hermann Czech (born 1936), Austrian architect * Mirosław Czech (born 1968), Polish politician and journalist of Ukrainian origin * Zbigniew Czech (born 1970), Polish diplomat See also * Čech, a surname * Czech lands * Czechoslovakia * List of Czechs * * * Czechoslovak (other) * Czech Republic (other) * Czechia (other) Czechia is the official short form name of the Czech Republic. Czechia may also refer to: * Historical Czech lands *Czechoslovakia (1918–1993) *Czech Socialist Republi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
21st-century American Mathematicians
The 1st century was the century spanning AD 1 ( I) through AD 100 ( C) according to the Julian calendar. It is often written as the or to distinguish it from the 1st century BC (or BCE) which preceded it. The 1st century is considered part of the Classical era, epoch, or historical period. The 1st century also saw the appearance of Christianity. During this period, Europe, North Africa and the Near East fell under increasing domination by the Roman Empire, which continued expanding, most notably conquering Britain under the emperor Claudius ( AD 43). The reforms introduced by Augustus during his long reign stabilized the empire after the turmoil of the previous century's civil wars. Later in the century the Julio-Claudian dynasty, which had been founded by Augustus, came to an end with the suicide of Nero in AD 68. There followed the famous Year of Four Emperors, a brief period of civil war and instability, which was finally brought to an end by Vespasian, ninth Roman empero ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypergraph Removal Lemma
In graph theory, the hypergraph removal lemma states that when a hypergraph contains few copies of a given sub-hypergraph, then all of the copies can be eliminated by removing a small number of hyperedges. It is a generalization of the graph removal lemma. The special case in which the graph is a tetrahedron is known as the tetrahedron removal lemma. It was first proved by Nagle, Rödl, Schacht and Skokan and, independently, by Gowers. The hypergraph removal lemma can be used to prove results such as Szemerédi's theorem and the multi-dimensional Szemerédi theorem. Statement The hypergraph removal lemma states that for any \varepsilon, r, m > 0, there exists \delta = \delta(\varepsilon, r, m) > 0 such that for any r-uniform hypergraph H with m vertices the following is true: if G is any n-vertex r-uniform hypergraph with at most \delta n^ subgraphs isomorphic to H, then it is possible to eliminate all copies of H from G by removing at most \varepsilon n^r hyperedges from G. An e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frankl–Rödl Graph
In graph theory and computational complexity theory, a Frankl–Rödl graph is a graph defined by connecting pairs of vertices of a hypercube that are at a specified even distance from each other. The graphs of this type are parameterized by the dimension of the hypercube and by the distance between adjacent vertices. Frankl–Rödl graphs are named after Péter Frankl and Vojtěch Rödl, who proved in 1987 that (for certain ranges of the graph parameters) they have small independence number and high chromatic number. They have since become of interest to computational complexity theorists, as difficult examples for semidefinite programming based approximation algorithms for the vertex cover and graph coloring problems. Their properties with respect to these algorithms have been used to call into question the unique games conjecture. Definition and examples Let be a positive integer, and let be a real number in the unit interval . Suppose additionally that is an even number. Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Packing In A Hypergraph
In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in ''k''-uniform hypergraphs. One of them is a random greedy algorithm which was proposed by Joel Spencer. He used a branching process to formally prove the optimal achievable bound under some side conditions. The other algorithm is called the Rödl nibble and was proposed by Vojtěch Rödl et al. They showed that the achievable packing by the Rödl nibble is in some sense close to that of the random greedy algorithm. History The problem of finding the number of such subsets in a ''k''-uniform hypergraph was originally motivated through a conjecture by Paul Erdős and Haim Hanani in 1963. Vojtěch Rödl proved their conjecture asymptotically under certain conditions in 1985. Pippenger and Joel Spencer generalized Rödl's res ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithms And Combinatorics
Algorithms and Combinatorics () is a book series in mathematics, and particularly in combinatorics and the design and analysis of algorithms. It is published by Springer Science+Business Media, and was founded in 1987. Books , the books published in this series include: *''The Simplex Method: A Probabilistic Analysis'' (Karl Heinz Borgwardt, 1987, vol. 1) *''Geometric Algorithms and Combinatorial Optimization'' (Martin Grötschel, László Lovász, and Alexander Schrijver, 1988, vol. 2; 2nd ed., 1993) *''Systems Analysis by Graphs and Matroids'' (Kazuo Murota, 1987, vol. 3) *''Greedoids'' (Bernhard Korte, László Lovász, and Rainer Schrader, 1991, vol. 4) *''Mathematics of Ramsey Theory'' (Jaroslav Nešetřil and Vojtěch Rödl, eds., 1990, vol. 5) *''Matroid Theory and its Applications in Electric Network Theory and in Statics'' (Andras Recszki, 1989, vol. 6) *''Irregularities of Partitions: Papers from the meeting held in Fertőd, July 7–11, 1986'' (Gábor Halász and Vera T. S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Technical University Of Liberec
The Technical University of Liberec is a university in the city of Liberec, Czech Republic. The university has undergone great transformation in its over sixty-year history. When it was founded, it was called the Institute of Mechanical Engineering in Liberec, and its original classrooms were located in the attics of the F. X. Šalda Grammar School. These later served as accommodation for teachers, and it was here that the first plans and ideas arose concerning the later form and direction of the college. The first 259 students were admitted on October 1, 1953. Today, the university has seven faculties and one specialized institute: Faculty of Mechanical Engineering, Faculty of Textile Engineering, Faculty of Science-Humanities and Education, Faculty of Economics, Faculty of Arts and Architecture, Faculty of Mechatronics, Informatics and Inter-Disciplinary Studies, Faculty of Health Studies, Institute for Nanomaterials, Advanced Technologies and Innovation Academics The universi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
