|
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] |
Diameter
In geometry, a diameter of a circle is any straight line segment that passes through the center of the circle and whose endpoints lie on the circle. It can also be defined as the longest chord of the circle. Both definitions are also valid for the diameter of a sphere. In more modern usage, the length d of a diameter is also called the diameter. In this sense one speaks of diameter rather than diameter (which refers to the line segment itself), because all diameters of a circle or sphere have the same length, this being twice the radius r. :d = 2r \qquad\text\qquad r = \frac. For a convex shape in the plane, the diameter is defined to be the largest distance that can be formed between two opposite parallel lines tangent to its boundary, and the is often defined to be the smallest such distance. Both quantities can be calculated efficiently using rotating calipers. For a curve of constant width such as the Reuleaux triangle, the width and diameter are the same because all ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Advances In Mathematics
''Advances in Mathematics'' is a peer-reviewed scientific journal covering research on pure mathematics. It was established in 1961 by Gian-Carlo Rota. The journal publishes 18 issues each year, in three volumes. At the origin, the journal aimed at publishing articles addressed to a broader "mathematical community", and not only to mathematicians in the author's field. Herbert Busemann writes, in the preface of the first issue, "The need for expository articles addressing either all mathematicians or only those in somewhat related fields has long been felt, but little has been done outside of the USSR. The serial publication ''Advances in Mathematics'' was created in response to this demand." Abstracting and indexing The journal is abstracted and indexed in: * |
Discrete & 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] |
Hungarian Academy Of Science
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 inaugurat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aisenstadt Prize
The André Aisenstadt Prize recognizes a young Canadian mathematician's outstanding achievement in pure or applied mathematics. It has been awarded annually since 1992 (except in 1994, when no prize was given) by the Centre de Recherches Mathématiques at the University of Montreal. The prize consists of a $3,000 award and a medal. It is named after . Prize Winners SourceCRM, University of Montreal * 2021 Giulio Tiozzo (University of Toronto) and Tristan C. Collins (Massachusetts Institute of Technology) * 2020 Robert Haslhofer (University of Toronto) and Egor Shelukhin (Université de Montréal) * 2019 Yaniv Plan (University of British Columbia) * 2018 Benjamin Rossman (University of Toronto) * 2017 Jacob Tsimerman (University of Toronto) * 2016 Anne Broadbent (University of Ottawa) * 2015 Louis-Pierre Arguin (University of Montréal and the City University of New York - Baruch College and Graduate Center) * 2014 Sabin Cautis of the University of British Columbia * 2013 S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sloan Research Fellowship
The Sloan Research Fellowships are awarded annually by the Alfred P. Sloan Foundation since 1955 to "provide support and recognition to early-career scientists and scholars". This program is one of the oldest of its kind in the United States. Fellowships were initially awarded in physics, chemistry, and mathematics. Awards were later added in neuroscience (1972), economics (1980), computer science (1993), computational and evolutionary molecular biology (2002), and ocean sciences or earth systems sciences (2012). Winners of these two-year fellowships are awarded $75,000, which may be spent on any expense supporting their research. From 2012 through 2020, the foundation awarded 126 research fellowship each year; in 2021, 128 were awarded, and 118 were awarded in 2022. Eligibility and selection To be eligible, a candidate must hold a Ph.D. or equivalent degree and must be a member of the faculty of a college, university, or other degree-granting institution in the United Stat ... [...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] |
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 the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
