|
Zoltán Füredi
Zoltán Füredi (Budapest, Hungary, 21 May 1954) is a Hungarian people, 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 Alfréd Rényi Institute of Mathematics, 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 (discrete mathematics), graph with no cycle graph, ''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 triangle#By internal angles, acute. * With Imre Bárány he pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Budapest
Budapest (, ; ) is the capital and most populous city of Hungary. It is the ninth-largest city in the European Union by population within city limits and the second-largest city on the Danube river; the city has an estimated population of 1,752,286 over a land area of about . Budapest, which is both a city and county, forms the centre of the Budapest metropolitan area, which has an area of and a population of 3,303,786; it is a primate city, constituting 33% of the population of Hungary. The history of Budapest began when an early Celtic settlement transformed into the Roman town of Aquincum, the capital of Lower Pannonia. The Hungarians arrived in the territory in the late 9th century, but the area was pillaged by the Mongols in 1241–42. Re-established Buda became one of the centres of Renaissance humanist culture by the 15th century. The Battle of Mohács, in 1526, was followed by nearly 150 years of Ottoman rule. After the reconquest of Buda in 1686, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Time
In 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 generally expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Illinois Urbana-Champaign Faculty
A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, the designation is reserved for colleges that have a graduate school. The word ''university'' is derived from the Latin ''universitas magistrorum et scholarium'', which roughly means "community of teachers and scholars". The first universities were created in Europe by Catholic Church monks. The University of Bologna (''Università di Bologna''), founded in 1088, is the first university in the sense of: *Being a high degree-awarding institute. *Having independence from the ecclesiastic schools, although conducted by both clergy and non-clergy. *Using the word ''universitas'' (which was coined at its foundation). *Issuing secular and non-secular degrees: grammar, rhetoric, logic, theology, canon law, notarial law.Hunt Janin: "The university i ... [...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 learned academy, scholarly society, or academic association) is an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
21st-century Hungarian 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 emperor, a ... [...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. Intersec ... [...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. 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. * |
Orchard-planting Problem
In discrete geometry, the original orchard-planting problem asks for the maximum number of 3-point lines attainable by a configuration of a specific number of points in the plane. It is also called the tree-planting problem or simply the orchard problem. There are also investigations into how many ''k''-point lines there can be. Hallard T. Croft and Paul Erdős proved ''t''''k'' > ''c'' ''n''2 / ''k''3, where ''n'' is the number of points and ''t''''k'' is the number of ''k''-point lines. Their construction contains some ''m''-point lines, where ''m'' > ''k''. One can also ask the question if these are not allowed. Integer sequence Define ''t''3orchard(''n'') to be the maximum number of 3-point lines attainable with a configuration of ''n'' points. For an arbitrary number of points, ''n'', ''t''3orchard(''n'') was shown to be (1/6)''n''2 − O(n) in 1974. The first few values of ''t''3orchard(''n'') are given in the following table . Upp ... [...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 found an eigh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
_-_09.JPG "Click for more on -> University Of Illinois Urbana-Champaign Faculty")
