|
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] |
Discrete Geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object. Discrete geometry has a large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology. History Although polyhedra and tessellations had been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topics studie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Combinatorial Theory
The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applications of combinatorics. ''Series B'' is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as ''JCTA'' and ''JCTB''. The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.They are acknowledged on the journals' title pages and Web sites. SeEditorial board of JCTA Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. An electronic, [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
William Gasarch
William Ian Gasarch ( ; born 1959) is an American computer scientist known for his work in computational complexity theory, computability theory, computational learning theory, and Ramsey theory. He is currently a professor at the University of Maryland Department of Computer Science with an affiliate appointment in Mathematics. As of 2015 he has supervised over 40 high school students on research projects, including Jacob Lurie. He has co-blogged on computational complexity with Lance Fortnow since 2007. He was book review editor for ACM SIGACT NEWS from 1997 to 2015. Education Gasarch received his doctorate in computer science from Harvard in 1985, advised by Harry R. Lewis. His thesis was titled ''Recursion-Theoretic Techniques in Complexity Theory and Combinatorics''. He was hired into a tenure track professorial job at the University of Maryland in the Fall of 1985. He was promoted to Associate Professor with Tenure in 1991, and to Full Professor in 1998. Work Gasarch ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Unit Distance Graph
In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some non-adjacent pairs of vertices to be at distance one, they may also be called strict unit distance graphs or faithful unit distance graphs. As a hereditary family of graphs, they can be characterized by forbidden induced subgraphs. The unit distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict unit distance graphs. An unsolved problem of Paul Erdős asks how many edges a unit distance graph on n vertices can have. The best known lower bound is slightly above linear in n—far from the upper bound, proportional to n^. The number of colors required to color unit distance graphs is also unknown (t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Falconer's Conjecture
In geometric measure theory, Falconer's conjecture, named after Kenneth Falconer, is an unsolved problem concerning the sets of Euclidean distances between points in compact d-dimensional spaces. Intuitively, it states that a set of points that is large in its Hausdorff dimension must determine a set of distances that is large in measure. More precisely, if S is a compact set of points in d-dimensional Euclidean space whose Hausdorff dimension is strictly greater than d/2, then the conjecture states that the set of distances between pairs of points in S must have nonzero Lebesgue measure. Formulation and motivation proved that Borel sets with Hausdorff dimension greater than (d+1)/2 have distance sets with nonzero measure. He motivated this result as a multidimensional generalization of the Steinhaus theorem, a previous result of Hugo Steinhaus proving that every set of real numbers with nonzero measure must have a difference set that contains an interval of the form (-\vareps ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorica
''Combinatorica'' is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are Imre Bárány and József Solymosi. The advisory board consists of Ronald Graham, Gyula O. H. Katona, Miklós Simonovits, Vera Sós, and Endre Szemerédi. It is published by the János Bolyai Mathematical Society and Springer Verlag. The following members of the '' Hungarian School of Combinatorics'' have strongly contributed to the journal as authors, or have served as editors: Miklós Ajtai, László Babai, József Beck, András Frank, Péter Frankl, Zoltán Füredi, András Hajnal, Gyula Katona, László Lovász, László Pyber, Alexander Schrijver, Miklós Simonovits, Vera Sós, Endre Szemerédi, Tamás Szőnyi, Éva Tardos, Gábor Tardos.{{cite web, url=https://www.springer.com/ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Van H
A van is a type of road vehicle used for transporting goods or people. Depending on the type of van, it can be bigger or smaller than a pickup truck and SUV, and bigger than a common car. There is some varying in the scope of the word across the different English-speaking countries. The smallest vans, microvans, are used for transporting either goods or people in tiny quantities. Mini MPVs, compact MPVs, and MPVs are all small vans usually used for transporting people in small quantities. Larger vans with passenger seats are used for institutional purposes, such as transporting students. Larger vans with only front seats are often used for business purposes, to carry goods and equipment. Specially-equipped vans are used by television stations as mobile studios. Postal services and courier companies use large step vans to deliver packages. Word origin and usage Van meaning a type of vehicle arose as a contraction of the word caravan. The earliest records of a van as a vehicl ... [...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: * |
Gábor Tardos
Gábor Tardos (born 11 July 1964) is a Hungarian mathematician, currently a professor at Central European University and previously a Canada Research Chair at Simon Fraser University. He works mainly in combinatorics and computer science. He is the younger brother of Éva Tardos. Education and career Gábor Tardos received his PhD in Mathematics from Eötvös University, Budapest in 1988. His counsellors were László Babai and Péter Pálfy. He held postdoctoral posts at the University of Chicago, Rutgers University, University of Toronto and the Princeton Institute for Advanced Study. From 2005 to 2013, he served as a Canada Research Chair of discrete and computational geometry at Simon Fraser University. He then returned to Budapest to the Alfréd Rényi Institute of Mathematics where he has served as a research fellow since 1991. Mathematical results Tardos started with a result in universal algebra: he exhibited a maximal clone of order-preserving operations that is ... [...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] |
Combinatorics, Probability And Computing
''Combinatorics, Probability and Computing'' is a peer-reviewed scientific journal in mathematics published by Cambridge University Press. Its editor-in-chief is Béla Bollobás (DPMMS and University of Memphis). History The journal was established by Bollobás in 1992. Fields Medalist Timothy Gowers calls it "a personal favourite" among combinatorics journals and writes that it "maintains a high standard". Content The journal covers combinatorics, probability theory, and theoretical computer science. Currently, it publishes six issues annually. As with other journals from the same publisher, it follows a hybrid green/gold open access policy, in which authors may either place copies of their papers in an institutional repository after a six-month embargo period, or pay an open access charge to make their papers free to read on the journal's website. Abstracting and indexing The journal is abstracted and indexed in: According to the ''Journal Citation Reports'', the jou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
