|
Erdős–Szemerédi Theorem
In arithmetic combinatorics, the Erdős–Szemerédi theorem states that for every finite set A of integers, at least one of A+A, the set of pairwise sums or A\cdot A, the set of pairwise products form a significantly larger set. More precisely, the Erdős–Szemerédi theorem states that there exist positive constants ''c'' and \varepsilon such that for any non-empty set A \subset \mathbb :\max( , A+A, , , A \cdot A, ) \geq c , A, ^ . It was proved by Paul Erdős and Endre Szemerédi in 1983.. The notation , A, denotes the cardinality of the set A. The set of pairwise sums is A+A = \ and is called sum set of A. The set of pairwise products is A \cdot A = \ and is called the product set of A. The theorem is a version of the maxim that additive structure and multiplicative structure cannot coexist. It can also be viewed as an assertion that the real line does not contain any set resembling a finite subring or finite subfield; it is the first example of what is now known as th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arithmetic Combinatorics
In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis. Scope Arithmetic combinatorics is about combinatorial estimates associated with arithmetic operations (addition, subtraction, multiplication, and division). Additive combinatorics is the special case when only the operations of addition and subtraction are involved. Ben Green explains arithmetic combinatorics in his review of "Additive Combinatorics" by Tao and Vu. Important results Szemerédi's theorem Szemerédi's theorem is a result in arithmetic combinatorics concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured. that every set of integers ''A'' with positive natural density contains a ''k'' term arithmetic progression for every ''k''. This conjecture, which became Szemerédi's theorem, generalizes the statement of van der Waerden's theorem. Green–Tao theorem and extensions Th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
József Solymosi
József Solymosi is a Hungarian-Canadian mathematician and a professor of mathematics at the University of British Columbia. His main research interests are arithmetic combinatorics, discrete geometry, graph theory, and combinatorial number theory. Education and career Solymosi earned his master's degree in 1999 under the supervision of László Székely from the Eötvös Loránd University and his Ph.D. in 2001 at ETH Zürich under the supervision of Emo Welzl. His doctoral dissertation was ''Ramsey-Type Results on Planar Geometric Objects''. From 2001 to 2003 he was S. E. Warschawski Assistant Professor of Mathematics at the University of California, San Diego. He joined the faculty of the University of British Columbia in 2002. He was editor in chief of the ''Electronic Journal of Combinatorics'' from 2013 to 2015. Contributions Solymosi was the first online contributor to the first Polymath Project, set by Timothy Gowers to find improvements to the Hales–Jewett theorem. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Terence Tao
Terence Chi-Shen Tao (; born 17 July 1975) is an Australian-American mathematician. He is a professor of mathematics at the University of California, Los Angeles (UCLA), where he holds the James and Carol Collins chair. His research includes topics in harmonic analysis, partial differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing and analytic number theory. Tao was born to ethnic Chinese immigrant parents and raised in Adelaide. Tao won the Fields Medal in 2006 and won the Royal Medal and Breakthrough Prize in Mathematics in 2014. He is also a 2006 MacArthur Fellow. Tao has been the author or co-author of over three hundred research papers. He is widely regarded as one of the greatest living mathematicians and has been referred to as the "Mozart of mathematics". Life and career Family Tao's parents are first-generation immigrants from Hong Kong to Australia.''Wen Wei Po'', Page A4, 24 ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jean Bourgain
Jean, Baron Bourgain (; – ) was a Belgian mathematician. He was awarded the Fields Medal in 1994 in recognition of his work on several core topics of mathematical analysis such as the geometry of Banach spaces, harmonic analysis, ergodic theory and nonlinear partial differential equations from mathematical physics. Biography Bourgain received his PhD from the Vrije Universiteit Brussel in 1977. He was a faculty member at the University of Illinois, Urbana-Champaign and, from 1985 until 1995, professor at Institut des Hautes Études Scientifiques at Bures-sur-Yvette in France, at the Institute for Advanced Study in Princeton, New Jersey from 1994 until 2018. He was an editor for the ''Annals of Mathematics''. From 2012 to 2014, he was a visiting scholar at UC Berkeley. His research work included several areas of mathematical analysis such as the geometry of Banach spaces, harmonic analysis, analytic number theory, combinatorics, ergodic theory, partial differential equa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Randomness Extractor
A randomness extractor, often simply called an "extractor", is a function, which being applied to output from a weakly random entropy source, together with a short, uniformly random seed, generates a highly random output that appears independent from the source and uniformly distributed. Examples of weakly random sources include radioactive decay or thermal noise; the only restriction on possible sources is that there is no way they can be fully controlled, calculated or predicted, and that a lower bound on their entropy rate can be established. For a given source, a randomness extractor can even be considered to be a true random number generator ( TRNG); but there is no single extractor that has been proven to produce truly random output from any type of weakly random source. Sometimes the term "bias" is used to denote a weakly random source's departure from uniformity, and in older literature, some extractors are called unbiasing algorithms, as they take the randomness from a so ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Avi Wigderson
Avi Wigderson ( he, אבי ויגדרזון; born 9 September 1956) is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks. Wigderson received the Abel Prize in 2021 for his work in theoretical computer science. Biography Avi Wigderson was born in Haifa, Israel, to Holocaust survivors. Wigderson is a graduate of the Hebrew Reali School in Haifa, and did his undergraduate studies at the Technion in Haifa, Israel, graduating in 1980, and went on to graduate study at Princeton University. He received his PhD in computer science in 1983 after completing a doctoral dissertation, titled "Studies in computational complexity", under the supervision of Richard Lipton. After short-term positions at ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Thomas Wolff
Thomas Hartwig Wolff (July 14, 1954, New York City – July 31, 2000, Kern County) was a noted mathematician, working primarily in the fields of harmonic analysis, complex analysis, and partial differential equations. As an undergraduate at Harvard University he regularly played poker with his classmate Bill Gates. While a graduate student at the University of California, Berkeley from 1976 to 1979, under the direction of Donald Sarason, he obtained a new proof of the corona theorem, a famously difficult theorem in complex analysis. He was made Professor of Mathematics at Caltech in 1986, and was there from 1988–1992 and from 1995 to his death in a car accident in 2000. He also held positions at the University of Washington, University of Chicago, New York University, and University of California, Berkeley. He received the Salem Prize in 1985 and the Bôcher Memorial Prize in 1999, for his contributions to analysis and particularly to the Kakeya conjecture. He was an Invite ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kakeya Conjecture
In mathematics, a Kakeya set, or Besicovitch set, is a set of points in Euclidean space which contains a unit line segment in every direction. For instance, a disk of radius 1/2 in the Euclidean plane, or a ball of radius 1/2 in three-dimensional space, forms a Kakeya set. Much of the research in this area has studied the problem of how small such sets can be. Besicovitch showed that there are Besicovitch sets of measure zero. A Kakeya needle set (sometimes also known as a Kakeya set) is a (Besicovitch) set in the plane with a stronger property, that a unit line segment can be rotated continuously through 180 degrees within it, returning to its original position with reversed orientation. Again, the disk of radius 1/2 is an example of a Kakeya needle set. Kakeya needle problem The Kakeya needle problem asks whether there is a minimum area of a region D in the plane, in which a needle of unit length can be turned through 360°. This question was first posed, for convex regions, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod when is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number and every positive integer there are fields of order p^k, all of which are isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Szemerédi–Trotter Theorem
The Szemerédi–Trotter theorem is a mathematical result in the field of Discrete geometry. It asserts that given points and lines in the Euclidean plane, the number of incidences (''i.e.'', the number of point-line pairs, such that the point lies on the line) is O \left ( n^ m^ + n + m \right ). This bound cannot be improved, except in terms of the implicit constants. As for the implicit constants, it was shown by János Pach, Radoš Radoičić, Gábor Tardos, and Géza Tóth that the upper bound 2.5n^ m^ + n + m holds. Since then better constants are known due to better crossing lemma constants; the current best is 2.44. On the other hand, Pach and Tóth showed that the statement does not hold true if one replaces the coefficient 2.5 with 0.42. An equivalent formulation of the theorem is the following. Given points and an integer , the number of lines which pass through at least of the points is O \left( \frac + \frac \right ). The original proof of Endre Szemerédi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sergei Konyagin
Sergei Vladimirovich Konyagin (russian: Серге́й Владимирович Конягин; born 25 April 1957) is a Russian mathematician. He is a professor of mathematics at the Moscow State University. Konyagin participated in the International Mathematical Olympiad for the Soviet Union, winning two consecutive gold medals with perfect scores in 1972 and 1973. At the age of 15, he became one of the youngest people to achieve a perfect score at the IMO. In 1990 Konyagin was awarded the Salem Prize. In 2012 he became a fellow of the American Mathematical Society The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings .... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
