|
Václav Chvátal
Václav (Vašek) Chvátal () is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada and a Visiting Professor at Charles University in Prague. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization. Biography Chvátal was born in 1946 in Prague and educated in mathematics at Charles University in Prague, where he studied under the supervision of Zdeněk Hedrlín. He fled Czechoslovakia in 1968, three days after the Soviet invasion, and completed his Ph.D. in Mathematics at the University of Waterloo, under the supervision of Crispin St. J. A. Nash-Williams, in the fall of 1970. Subsequently, he took positions at McGill University (1971 and 1978-1986), Stanford University (1972 and 1974-1977), the Université de Montréal (1972-1974 and 1977-1978), and Rutgers University (1986-2004) before returning to Montreal for the Canada Research Chair in Combi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prague
Prague ( ; cs, Praha ; german: Prag, ; la, Praga) is the capital and largest city in the Czech Republic, and the historical capital of Bohemia. On the Vltava river, Prague is home to about 1.3 million people. The city has a temperate oceanic climate, with relatively warm summers and chilly winters. Prague is a political, cultural, and economic hub of central Europe, with a rich history and Romanesque, Gothic, Renaissance and Baroque architectures. It was the capital of the Kingdom of Bohemia and residence of several Holy Roman Emperors, most notably Charles IV (r. 1346–1378). It was an important city to the Habsburg monarchy and Austro-Hungarian Empire. The city played major roles in the Bohemian and the Protestant Reformations, the Thirty Years' War and in 20th-century history as the capital of Czechoslovakia between the World Wars and the post-war Communist era. Prague is home to a number of well-known cultural attractions, many of which survived ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crispin St
Saints Crispin and Crispinian are the Christian patron saints of cobblers, curriers, tanners, and leather workers. They were beheaded during the reign of Diocletian; the date of their execution is given as 25 October 285 or 286. History Born to a noble Roman family in the 3rd century AD, Crispin and Crispinian fled persecution for their faith, ending up at Soissons, where they preached Christianity to the Gauls while making shoes by night. It is stated that they were twin brothers. They earned enough by their trade to support themselves and also to aid the poor. Their success attracted the ire of Rictus Varus, governor of Belgic Gaul, who had them tortured and thrown into the river with millstones around their necks. Though they survived, they were beheaded by the Emperor 286. Veneration The feast day of Saints Crispin and Crispinian is 25 October. Although this feast was removed from the Roman Catholic Church's universal liturgical calendar following the Second Vatic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prague Spring
The Prague Spring ( cs, Pražské jaro, sk, Pražská jar) was a period of political liberalization and mass protest in the Czechoslovak Socialist Republic. It began on 5 January 1968, when reformist Alexander Dubček was elected First Secretary of the Communist Party of Czechoslovakia (KSČ), and continued until 21 August 1968, when the Soviet Union and most of Warsaw Pact members invaded the country to suppress the reforms. The Prague Spring reforms were a strong attempt by Dubček to grant additional rights to the citizens of Czechoslovakia in an act of partial decentralization of the economy and democratization. The freedoms granted included a loosening of restrictions on the media, speech and travel. After national discussion of dividing the country into a federation of three republics, Bohemia, Moravia-Silesia and Slovakia, Dubček oversaw the decision to split into two, the Czech Socialist Republic and Slovak Socialist Republic. This dual federation was the o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Czechoslovakia
, rue, Чеськословеньско, , yi, טשעכאסלאוואקיי, , common_name = Czechoslovakia , life_span = 1918–19391945–1992 , p1 = Austria-Hungary , image_p1 = , s1 = Czech Republic , flag_s1 = Flag of the Czech Republic.svg , s2 = Slovakia , flag_s2 = Flag of Slovakia.svg , image_flag = Flag of Czechoslovakia.svg , flag = Flag of Czechoslovakia , flag_type = Flag(1920–1992) , flag_border = Flag of Czechoslovakia , image_coat = Middle coat of arms of Czechoslovakia.svg , symbol_type = Middle coat of arms(1918–1938 and 1945–1961) , image_map = Czechoslovakia location map.svg , image_map_caption = Czechoslovakia during the interwar period and the Cold War , national_motto = , anthems = ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graphs And Combinatorics
''Graphs and Combinatorics'' (ISSN 0911-0119, abbreviated ''Graphs Combin.'') is a peer-reviewed academic journal in graph theory, combinatorics, and discrete geometry published by Springer Japan. Its editor-in-chief is Katsuhiro Ota of Keio University. The journal was first published in 1985. Its founding editor in chief was Hoon Heng Teh of Singapore, the president of the Southeast Asian Mathematics Society, and its managing editor was Jin Akiyama. Originally, it was subtitled "An Asian Journal". In most years since 1999, it has been ranked as a second-quartile journal in discrete mathematics and theoretical computer science Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumsc ... by SCImago Journal Rank.. References {{reflist Publications established in 1985 Combinatorics journ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zdeněk Hedrlín
Zdeněk Hedrlín (1933 – April 22, 2018) was a Czech mathematician, specializing in universal algebra and combinatorial theory, both in pure and applied mathematics. Zdeněk Hedrlín received his PhD from Prague's Charles University in 1963. His thesis on commutative semigroups was supervised by Miroslav Katětov. Hedrlín held the title of ''Docent'' (associated professor) at Charles University. There he worked at the Faculty of Mathematics and Physics for over 60 years until he died at age 85. He was among the first Czech mathematicians to do research on category theory. In 1970 Hedrlín was an Invited Speaker at the International Congress of Mathematicians The International Congress of Mathematicians (ICM) is the largest conference for the topic of mathematics. It meets once every four years, hosted by the International Mathematical Union (IMU). The Fields Medals, the Nevanlinna Prize (to be rename ... in Nice. In the later part of his career, he focused on applicatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorial Optimization
Combinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead. Combinatorial optimization is related to operations research, algorithm theory, and computational complexity theory. It has important applications in several fields, including artificial intelligence, machine learning, auction theory, software engineering, VLSI, applied mathematics and theoretical computer science. Some research literature considers discre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics i ... [...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] |
Montreal, Quebec
Montreal ( ; officially Montréal, ) is the second-most populous city in Canada and most populous city in the Canadian province of Quebec. Founded in 1642 as '' Ville-Marie'', or "City of Mary", it is named after Mount Royal, the triple-peaked hill around which the early city of Ville-Marie is built. The city is centred on the Island of Montreal, which obtained its name from the same origin as the city, and a few much smaller peripheral islands, the largest of which is Île Bizard. The city is east of the national capital Ottawa, and southwest of the provincial capital, Quebec City. As of 2021, the city had a population of 1,762,949, and a metropolitan population of 4,291,732, making it the second-largest city, and second-largest metropolitan area in Canada. French is the city's official language. In 2021, it was spoken at home by 59.1% of the population and 69.2% in the Montreal Census Metropolitan Area. Overall, 85.7% of the population of the city of Montreal con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concordia University (Montreal)
Concordia University (French: ''Université Concordia'') is a public research university located in Montreal, Quebec, Canada. Founded in 1974 following the merger of Loyola College and Sir George Williams University, Concordia is one of the three universities in Quebec where English is the primary language of instruction (the others being McGill and Bishop's). As of the 2020–21 academic year, there were 51,253 students enrolled in credit courses at Concordia, making the university among the largest in Canada by enrollment. The university has two campuses, set approximately apart: Sir George Williams Campus is the main campus, located in the Quartier Concordia neighbourhood of Downtown Montreal in the borough of Ville Marie; and Loyola Campus in the residential district of Notre-Dame-de-Grâce. With four faculties, a school of graduate studies and numerous colleges, centres and institutes, Concordia offers over 400 undergraduate and 200 graduate programs and courses. Con ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
