|
György Elekes
György Elekes (19 May 1949 – 29 September 2008) was a Hungarian mathematician and computer scientist who specialized in Combinatorial geometry and Combinatorial set theory. He may be best known for his work in the field that would eventually be called Additive Combinatorics. Particularly notable was his "ingenious" application of the Szemerédi–Trotter theorem to improve the best known lower bound for the sum-product problem. He also proved that any polynomial-time algorithm approximating the volume of convex bodies must have a multiplicative error, and the error grows exponentially on the dimension. With Micha Sharir he set up a framework which eventually led Guth and Katz to the solution of the Erdős distinct distances problem.20.99''n''vol(''K''). That is, any polynomial-time estimator of volume over ''K'' must be inaccurate by at least an exponential factor. Not long before his death he developed new tools in Algebraic geometry and used them to obtain results in Discre ... [...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] |
Numerical Stability
In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues. On the other hand, in numerical algorithms for differential equations the concern is the growth of round-off errors and/or small fluctuations in initial data which might cause a large deviation of final answer from the exact solution. Some numerical algorithms may damp out the small fluctuations (errors) in the input data; others might magnify such errors. Calculations that can be proven not to magnify approximation errors are called ''numerically stable''. One of the common task ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hungarian Academy Of Sciences
The Hungarian Academy of Sciences ( hu, Magyar Tudományos Akadémia, MTA) is the most important and prestigious learned society of Hungary. Its seat is at the bank of the Danube in Budapest, between Széchenyi rakpart and Akadémia utca. Its main responsibilities are the cultivation of science, dissemination of scientific findings, supporting research and development, and representing Hungarian science domestically and around the world. History The history of the academy began in 1825 when Count István Széchenyi offered one year's income of his estate for the purposes of a ''Learned Society'' at a district session of the Diet in Pressburg (Pozsony, present Bratislava, seat of the Hungarian Parliament at the time), and his example was followed by other delegates. Its task was specified as the development of the Hungarian language and the study and propagation of the sciences and the arts in Hungarian. It received its current name in 1845. Its central building was inaugurate ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Doktor Nauk
Doctor of Sciences ( rus, доктор наук, p=ˈdoktər nɐˈuk, abbreviated д-р наук or д. н.; uk, доктор наук; bg, доктор на науките; be, доктар навук) is a higher doctoral degree in the Russian Empire, Soviet Union and many post-Soviet countries, which may be earned after the Candidate of Sciences. History The "Doctor of Sciences" degree was introduced in the Russian Empire in 1819 and abolished in 1917. Later it was revived in the USSR on January 13, 1934, by a decision of the Council of People's Commissars of the USSR. By the same decision, a lower degree, "Candidate of Sciences" (''kandidat nauk''), roughly the Russian equivalent to the research doctorate in other countries, was first introduced. This system was generally adopted by the USSR/Russia and many post-Soviet/Eastern bloc states, including Bulgaria, Belarus, former Czechoslovakia, Poland (since abolished), and Ukraine. But note that the former Yugoslav degree "Do ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Professor
Professor (commonly abbreviated as Prof.) is an Academy, academic rank at university, universities and other post-secondary education and research institutions in most countries. Literally, ''professor'' derives from Latin as a "person who professes". Professors are usually experts in their field and teachers of the highest rank. In most systems of List of academic ranks, academic ranks, "professor" as an unqualified title refers only to the most senior academic position, sometimes informally known as "full professor". In some countries and institutions, the word "professor" is also used in titles of lower ranks such as associate professor and assistant professor; this is particularly the case in the United States, where the unqualified word is also used colloquially to refer to associate and assistant professors as well. This usage would be considered incorrect among other academic communities. However, the otherwise unqualified title "Professor" designated with a capital let ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
László Lovász
László Lovász (; born March 9, 1948) is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020. In graph theory, Lovász's notable contributions include the proofs of Kneser's conjecture and the Lovász local lemma, as well as the formulation of the Erdős–Faber–Lovász conjecture. He is also one of the eponymous authors of the LLL lattice reduction algorithm. Early life and education Lovász was born on March 9, 1948, in Budapest, Hungary. Lovász attended the Fazekas Mihály Gimnázium in Budapest. He won three gold medals (1964–1966) and one silver medal (1963) at the International Mathematical Olympiad. He also participated in a Hungarian game show about math prodigies. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical disciplines (including the design and implementation of Computer architecture, hardware and Computer programming, software). Computer science is generally considered an area of research, academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing Vulnerability (computing), security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Progr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Analysis
Analysis is the branch of mathematics dealing with continuous functions, limit (mathematics), limits, and related theories, such as Derivative, differentiation, Integral, integration, measure (mathematics), measure, infinite sequences, series (mathematics), series, and analytic functions. These theories are usually studied in the context of Real number, real and Complex number, complex numbers and Function (mathematics), functions. Analysis evolved from calculus, which involves the elementary concepts and techniques of analysis. Analysis may be distinguished from geometry; however, it can be applied to any Space (mathematics), space of mathematical objects that has a definition of nearness (a topological space) or specific distances between objects (a metric space). History Ancient Mathematical analysis formally developed in the 17th century during the Scientific Revolution, but many of its ideas can be traced back to earlier mathematicians. Early results in analysis were i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fazekas Mihály
Fazekas is a Hungarian language surname meaning potter. Notable people with the surname include: * Franz Fazekas (born 1956), Austrian neurologist * István Fazekas (1898–1967), Hungarian–British chess master *Krisztina Fazekas (born 1980), Hungarian sprint canoeist who has competed since the mid-2000s *László Fazekas (born 1947), Hungarian football player *Mihály Fazekas (1766–1828), Hungarian writer from Debrecen * Nándor Fazekas (born 1976), Hungarian handball goalkeeper *Nick Fazekas (born 1985), American professional basketball player *Róbert Fazekas (born 1975), Hungarian discus thrower who won gold in the 2002 European Championships *Sándor Fazekas (born 1963), Hungarian jurist and politician *Stephen Fazekas de St. Groth, Hungarian-Australia microbiologist *Tibor Fazekas (1892–1982), Hungarian water polo player who competed in the 1912 and 1924 Summer Olympics See also * Fazekas Hills *Fazekas Mihály Gimnázium (Budapest), a high school in Budapest, Hungar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fazekas Mihály Gimnázium (Budapest)
Fazekas Mihály Gimnázium (in English: Mihály Fazekas High School; full official name: ''Budapesti Fazekas Mihály Gyakorló Általános Iskola és Gimnázium''; also known among alumni as simply ''Fazekas'' (potter) or even ''Fazék'' (pot)) is a high school in Budapest, Hungary. Over the past 40 years it has built up a reputation for excellence, especially in mathematics and in the exact sciences . History Early years The school's history reaches back to 1911 when the mayor of Budapest opened an elementary school at the site to meet the increasing demand for education in the expanding city. A year later, the building became temporary home to the Pedagogical Seminary, whose purpose was to provide guidance and later supervision for all teachers and schools in the city. The elementary school thus became a ''training school'' where teachers could become acquainted with the latest pedagogical techniques. The seminars given at the school became enormously popular between the two Wor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erdős Distinct Distances Problem
In discrete geometry, the Erdős distinct distances problem states that every set of points in the plane has a nearly-linear number of distinct distances. It was posed by Paul Erdős in 1946 and almost proven by Larry Guth and Nets Katz in 2015. The conjecture In what follows let denote the minimal number of distinct distances between points in the plane, or equivalently the smallest possible cardinality of their distance set. In his 1946 paper, Erdős proved the estimates :\sqrt-1/2\leq g(n)\leq c n/\sqrt for some constant c. The lower bound was given by an easy argument. The upper bound is given by a \sqrt\times\sqrt square grid. For such a grid, there are O( n/\sqrt) numbers below ''n'' which are sums of two squares, expressed in big O notation; see Landau–Ramanujan constant. Erdős conjectured that the upper bound was closer to the true value of ''g''(''n''), and specifically that (using big Omega notation) g(n) = \Omega(n^c) holds for every . Partial results Paul Erdős ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nets Hawk Katz
Nets Hawk Katz is the IBM Professor of Mathematics at the California Institute of Technology. He was a professor of Mathematics at Indiana University Bloomington until March 2013. Katz earned a B.A. in mathematics from Rice University in 1990 at the age of 17. He received his Ph.D. in 1993 under Dennis DeTurck at the University of Pennsylvania, with a dissertation titled "Noncommutative Determinants and Applications". He is the author of several important results in combinatorics (especially additive combinatorics), harmonic analysis and other areas. In 2003, jointly with Jean Bourgain and Terence Tao, he proved that any subset of \Z/p\Z grows substantially under either addition or multiplication. More precisely, if A is a set such that \max(, A \cdot A, , , A+A, ) \leq K, A, , then A has size at most K^C or at least p/K^C where C is a constant that depends on A. This result was followed by the subsequent work of Bourgain, Sergei Konyagin and Glibichuk, establishing that every a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
