|
János Pach
János Pach (born May 3, 1954) is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry. Biography Pach was born and grew up in Hungary. He comes from a noted academic family: his father, (1919–2001) was a well-known historian, and his mother Klára (née Sós, 1925–2020) was a university mathematics teacher; his maternal aunt Vera T. Sós and her husband Pál Turán are two of the best-known Hungarian mathematicians. Pach received his Candidate degree from the Hungarian Academy of Sciences, in 1983, where his advisor was Miklós Simonovits. Since 1977, he has been affiliated with the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.Research Fellows Rényi Institute He was Research Professor at the |
International Symposium On Graph Drawing
The International Symposium on Graph Drawing (GD) is an annual academic conference in which researchers present peer reviewed papers on graph drawing, information visualization of network information, geometric graph theory, and related topics. Significance The Graph Drawing symposia have been central to the growth and development of graph drawing as a research area: as Herman et al. write, "the Graph Drawing community grew around the yearly Symposia." Nguyen lists Graph Drawing as one of "several good conferences which directly or indirectly concern with information visualization", and Wong et al. report that its proceedings "provide a wealth of information". In a 2003 study the symposium was among the top 30% of computer science research publication venues, ranked by impact factor. History The first symposium was held in Marino, near Rome, Italy, in 1992, organized by Giuseppe Di Battista, Peter Eades Peter D. Eades (born 8 January 1952) is an Australian computer scientist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete And Computational Geometry
'' Discrete & Computational Geometry'' is a peer-reviewed mathematics journal published quarterly by Springer. Founded in 1986 by Jacob E. Goodman and Richard M. Pollack, the journal publishes articles on discrete geometry and computational geometry. Abstracting and indexing The journal is indexed in: * ''Mathematical Reviews'' * ''Zentralblatt MATH'' * ''Science Citation Index'' * ''Current Contents''/Engineering, Computing and Technology Notable articles The articles by Gil Kalai with a proof of a subexponential upper bound on the diameter of a polyhedron and by Samuel Ferguson on the Kepler conjecture, both published in Discrete & Computational geometry, earned their author the Fulkerson Prize The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at e .... References External link ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topological Graph
In mathematics, a topological graph is a representation of a graph in the plane, where the ''vertices'' of the graph are represented by distinct points and the ''edges'' by Jordan arcs (connected pieces of ''Jordan curves'') joining the corresponding pairs of points. The points representing the vertices of a graph and the arcs representing its edges are called the ''vertices'' and the ''edges'' of the topological graph. It is usually assumed that any two edges of a topological graph cross a finite number of times, no edge passes through a vertex different from its endpoints, and no two edges touch each other (without crossing). A topological graph is also called a ''drawing'' of a graph. An important special class of topological graphs is the class of ''geometric graphs'', where the edges are represented by ''line segments''. (The term '' geometric graph'' is sometimes used in a broader, somewhat vague sense.) The theory of topological graphs is an area of graph theory, mainl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Micha Perles
Micah (; ) is a given name. Micah is the name of several people in the Hebrew Bible ( Old Testament), and means "Who is like God?" The name is sometimes found with theophoric extensions. Suffix theophory in '' Yah'' and in ''Yahweh'' results in Michaiah or Michaihu (), meaning ''who is like Yahweh?''New Bible Dictionary, second edition. Tyndale House Publishers, Inc., Wheaton, IL, USA. Suffix theophory in '' El'' results in ''Michael'' (), meaning "who is like god". In German and Dutch, Micah is spelled and the ''ch'' in the name is pronounced either or ; the first is more common in female names, the latter in male names. The name is not as common as Michael or Michiel. Bible *Micah son of Mephibosheth son of Jonathan son of Saul, the first king of Israel () *Micah (prophet), eponymous prophet of the Book of Micah in the Old Testament *Micaiah, a prophet and the son of Imlah, who gave a negative prophecy to Ahab on his request Notable people with the given name "Micah" inclu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
European Journal Of Combinatorics
European, or Europeans, or Europeneans, may refer to: In general * ''European'', an adjective referring to something of, from, or related to Europe ** Ethnic groups in Europe ** Demographics of Europe ** European cuisine, the cuisines of Europe and other Western countries * ''European'', an adjective referring to something of, from, or related to the European Union ** Citizenship of the European Union ** Demographics of the European Union In publishing * ''The European'' (1953 magazine), a far-right cultural and political magazine published 1953–1959 * ''The European'' (newspaper), a British weekly newspaper published 1990–1998 * ''The European'' (2009 magazine), a German magazine first published in September 2009 *''The European Magazine'', a magazine published in London 1782–1826 *''The New European'', a British weekly pop-up newspaper first published in July 2016 Other uses * * Europeans (band), a British post-punk group, from Bristol See also * * * Europe (disam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Universal Graph
In mathematics, a universal graph is an infinite graph that contains ''every'' finite (or at-most-countable) graph as an induced subgraph. A universal graph of this type was first constructed by Richard Rado and is now called the Rado graph or random graph. More recent work has focused on universal graphs for a graph family : that is, an infinite graph belonging to ''F'' that contains all finite graphs in . For instance, the Henson graphs are universal in this sense for the -clique-free graphs. A universal graph for a family of graphs can also refer to a member of a sequence of finite graphs that contains all graphs in ; for instance, every finite tree is a subgraph of a sufficiently large hypercube graph so a hypercube can be said to be a universal graph for trees. However it is not the smallest such graph: it is known that there is a universal graph for -vertex trees, with only vertices and edges, and that this is optimal. A construction based on the planar separato ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanislaw Ulam
Stanisław Marcin Ulam (; 13 April 1909 – 13 May 1984) was a Polish-American scientist in the fields of mathematics and nuclear physics. He participated in the Manhattan Project, originated the Teller–Ulam design of thermonuclear weapons, discovered the concept of the cellular automaton, invented the Monte Carlo method of computation, and suggested nuclear pulse propulsion. In pure and applied mathematics, he proved some theorems and proposed several conjectures. Born into a wealthy Polish Jewish family, Ulam studied mathematics at the Lwów Polytechnic Institute, where he earned his PhD in 1933 under the supervision of Kazimierz Kuratowski and Włodzimierz Stożek. In 1935, John von Neumann, whom Ulam had met in Warsaw, invited him to come to the Institute for Advanced Study in Princeton, New Jersey, for a few months. From 1936 to 1939, he spent summers in Poland and academic years at Harvard University in Cambridge, Massachusetts, where he worked to establish import ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object. Discrete geometry has a large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology. History Although polyhedra and tessellations had been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topics studie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erdős Number
The Erdős number () describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual has collaborated with a large and broad number of peers. Overview Paul Erdős (1913–1996) was an influential Hungarian mathematician who in the latter part of his life spent a great deal of time writing papers with a large number of colleagues, working on solutions to outstanding mathematical problems. He published more papers during his lifetime (at least 1,525) than any other mathematician in history. (Leonhard Euler published more total pages of mathematics but fewer separate papers: about 800.) Erdős spent a large portion of his later life living out of a suitcase, visiting over 500 collaborators around the world. The idea of the Erdős number was originally created by the mathematician's friends as a tribute to his enormous ou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics. Erdős published around 1,500 mathematical papers during his lifetime, a figure that remains unsurpassed. He firmly believed mathematics to be a social activity, living an itinerant lifestyle with the sole purpose of writing mathematical papers with other mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
European Congress Of Mathematics
The European Congress of Mathematics (ECM) is the second largest international conference of the mathematics community, after the International Congresses of Mathematicians (ICM). The ECM are held every four years and are timed precisely between the ICM. The ECM is held under the auspices of the European Mathematical Society (EMS), and was one of its earliest initiatives. It was founded by Max Karoubi and the first edition took place in Paris in 1992. Its objectives are "to present various new aspects of pure and applied mathematics to a wide audience, to be a forum for discussion of the relationship between mathematics and society in Europe, and to enhance cooperation among mathematicians from all European countries." Activities The Congresses generally last a week and consist of plenary lectures, parallel (invited) lectures and several mini-symposia devoted to a particular subject, where participants can contribute with posters and short talks. Many editions featured also s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 renamed as the IMU Abacus Medal), the Carl Friedrich Gauss Prize, Gauss Prize, and the Chern Medal are awarded during the congress's opening ceremony. Each congress is memorialized by a printed set of Proceedings recording academic papers based on invited talks intended to be relevant to current topics of general interest. Being List of International Congresses of Mathematicians Plenary and Invited Speakers, invited to talk at the ICM has been called "the equivalent ... of an induction to a hall of fame". History Felix Klein and Georg Cantor are credited with putting forward the idea of an international congress of mathematicians in the 1890s.A. John Coleman"Mathematics without borders": a book review ''CMS Notes'', vol 31, no. 3, April 1999 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
