|
Zoltán Füredi
Zoltán Füredi (Budapest, Hungary, 21 May 1954) is a Hungarian mathematician, working in combinatorics, mainly in discrete geometry and extremal combinatorics. He was a student of Gyula O. H. Katona. He is a corresponding member of the Hungarian Academy of Sciences (2004). He is a research professor of the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and a professor at the University of Illinois Urbana-Champaign (UIUC). Füredi received his Candidate of Sciences degree in mathematics in 1981 from the Hungarian Academy of Sciences. Some results * In infinitely many cases he determined the maximum number of edges in a graph with no ''C''4. * With Paul Erdős he proved that for some ''c''>1, there are ''c''''d'' points in ''d''-dimensional space such that all triangles formed from those points are acute. * With Imre Bárány he proved that no polynomial time algorithm determines the volume of convex bodies in dimension ''d'' within a multiplicative err ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Budapest
Budapest is the Capital city, capital and List of cities and towns of Hungary, most populous city of Hungary. It is the List of cities in the European Union by population within city limits, tenth-largest city in the European Union by population within city limits and the List of cities and towns on the river Danube, second-largest city on the river Danube. The estimated population of the city in 2025 is 1,782,240. This includes the city's population and surrounding suburban areas, over a land area of about . Budapest, which is both a List of cities and towns of Hungary, city and Counties of Hungary, municipality, forms the centre of the Budapest metropolitan area, which has an area of and a population of 3,019,479. It is a primate city, constituting 33% of the population of Hungary. The history of Budapest began when an early Celts, Celtic settlement transformed into the Ancient Rome, Roman town of Aquincum, the capital of Pannonia Inferior, Lower Pannonia. The Hungarian p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Time
In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is gener ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Illinois Urbana-Champaign Faculty
A university () is an institution of tertiary education and research which awards academic degrees in several academic disciplines. ''University'' is derived from the Latin phrase , which roughly means "community of teachers and scholars". Universities typically offer both undergraduate and postgraduate programs. The first universities in Europe were established by Catholic monks. The University of Bologna (), Italy, which was founded in 1088, is the first university in the sense of: *being a high degree-awarding institute. *using the word (which was coined at its foundation). *having independence from the ecclesiastic schools and issuing secular as well as non-secular degrees (with teaching conducted by both clergy and non-clergy): grammar, rhetoric, logic, theology, canon law and notarial law.Hunt Janin: "The university in medieval life, 1179–1499", McFarland, 2008, , p. 55f.de Ridder-Symoens, Hilde''A History of the University in Europe: Volume 1, Universities in the Midd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Members Of The Hungarian Academy Of Sciences
Member may refer to: * Military jury, referred to as "Members" in military jargon * Element (mathematics), an object that belongs to a mathematical set * In object-oriented programming, a member of a class ** Field (computer science), entries in a database ** Member variable, a variable that is associated with a specific object * Limb (anatomy), an appendage of the human or animal body ** Euphemism for penis * Structural component of a truss, connected by nodes * User (computing), a person making use of a computing service, especially on the Internet * Member (geology), a component of a geological formation * Member of parliament * The Members, a British punk rock band * Meronymy, a semantic relationship in linguistics * Church membership, belonging to a local Christian congregation, a Christian denomination and the universal Church * Member, a participant in a club or learned society A learned society ( ; also scholarly, intellectual, or academic society) is an organizatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
21st-century Hungarian Mathematicians
File:1st century collage.png, From top left, clockwise: Jesus is crucified by Roman authorities in Judaea (17th century painting). Four different men (Galba, Otho, Vitellius, and Vespasian) claim the title of Emperor within the span of a year; The Great Fire of Rome (18th-century painting) sees the destruction of two-thirds of the city, precipitating the empire's first persecution against Christians, who are blamed for the disaster; The Roman Colosseum is built and holds its inaugural games; Roman forces besiege Jerusalem during the First Jewish–Roman War (19th-century painting); The Trưng sisters lead a rebellion against the Chinese Han dynasty (anachronistic depiction); Boudica, queen of the British Iceni leads a rebellion against Rome (19th-century statue); Knife-shaped coin of the Xin dynasty., 335px rect 30 30 737 1077 Crucifixion of Jesus rect 767 30 1815 1077 Year of the Four Emperors rect 1846 30 3223 1077 Great Fire of Rome rect 30 1108 1106 2155 Boudican revolt ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matching In Hypergraphs
In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph. Definition Recall that a hypergraph is a pair , where is a set of vertices and is a set of subsets of called ''hyperedges''. Each hyperedge may contain one or more vertices. A matching in is a subset of , such that every two hyperedges and in have an empty intersection (have no vertex in common). The matching number of a hypergraph is the largest size of a matching in . It is often denoted by . As an example, let be the set Consider a 3-uniform hypergraph on (a hypergraph in which each hyperedge contains exactly 3 vertices). Let be a 3-uniform hypergraph with 4 hyperedges: : Then admits several matchings of size 2, for example: : : However, in any subset of 3 hyperedges, at least two of them intersect, so there is no matching of size 3. Hence, the matching number of is 2. Interse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proceedings Of The American Mathematical Society
''Proceedings of the American Mathematical Society'' is a monthly peer-reviewed scientific journal of mathematics published by the American Mathematical Society. The journal is devoted to shorter research articles. As a requirement, all articles must be at most 15 printed pages. According to the ''Journal Citation Reports'', the journal has a 2018 impact factor of 0.813. Scope ''Proceedings of the American Mathematical Society'' publishes articles from all areas of pure and applied mathematics, including topology, geometry, analysis, algebra, number theory, combinatorics, logic, probability and statistics. Abstracting and indexing This journal is indexed in the following databases: 2011. American Mathematical Society. * [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orchard-planting Problem
In discrete geometry, the original orchard-planting problem (or the tree-planting problem) asks for the maximum number of 3-point lines attainable by a configuration of a specific number of points in the plane. There are also investigations into how many -point lines there can be. Hallard T. Croft and Paul Erdős proved t_k > \frac, where is the number of points and is the number of -point lines. Their construction contains some -point lines, where . One can also ask the question if these are not allowed. Integer sequence Define to be the maximum number of 3-point lines attainable with a configuration of points. For an arbitrary number of points, was shown to be \tfracn^2 - O(n) in 1974. The first few values of are given in the following table . Upper and lower bounds Since no two lines may share two distinct points, a trivial upper-bound for the number of 3-point lines determined by points is \left\lfloor \binom \Big/ \binom \right\rfloor = \left\lfloor \frac ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ilona Palásti
Ilona Palásti (1924–1991) was a Hungarian mathematician who worked at the Alfréd Rényi Institute of Mathematics. She is known for her research in discrete geometry, geometric probability, and the theory of random graphs. With Alfréd Rényi and others, she was considered to be one of the members of the Hungarian School of Probability. Contributions In connection to the Erdős distinct distances problem, Palásti studied the existence of point sets for which the ith least frequent distance occurs i times. That is, in such points there is one distance that occurs only once, another distance that occurs exactly two times, a third distance that occurs exactly three times, etc. For instance, three points with this structure must form an isosceles triangle. Any n evenly-spaced points on a line or circular arc also have the same property, but Paul Erdős asked whether this is possible for points in general position (no three on a line, and no four on a circle). Palásti foun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
