|
Honeycomb Theorem
The honeycomb theorem, formerly the honeycomb conjecture, states that a regular hexagonal grid or honeycomb has the least total perimeter of any subdivision of the plane into regions of equal area. The conjecture was proven in 1999 by mathematician Thomas C. Hales. Theorem Let \Gamma be any system of smooth curves in \mathbb^2, subdividing the plane into regions (connected components of the complement of \Gamma) all of which are bounded and have unit area. Then, averaged over large disks in the plane, the average length of \Gamma per unit area is at least as large as for the hexagon tiling. The theorem applies even if the complement of \Gamma has additional components that are unbounded or whose area is not one; allowing these additional components cannot shorten \Gamma. Formally, let B(0,r) denote the disk of radius r centered at the origin, let L_r denote the total length of \Gamma\cap B(0,r), and let A_r denote the total area of B(0,r) covered by bounded unit-area components ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tiling Regular 6-3 Hexagonal
Tiling may refer to: *The physical act of laying tiles *Tessellations Computing *The compiler optimization of loop tiling *Tiled rendering, the process of subdividing an image by regular grid *Tiling window manager People *Heinrich Sylvester Theodor Tiling (1818–1871), physician and botanist *Reinhold Tiling (1893–1933), German rocket pioneer Other uses *Neuronal tiling *Tile drainage, an agriculture practice that removes excess water from soil *Tiling (crater), a small, undistinguished crater on the far side of the Moon See also *Brickwork *Packing (other) *Tiling puzzle {{disambiguation, surname ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
László Fejes Tóth
László Fejes Tóth (, ; 12 March 1915 – 17 March 2005) was a Hungarian mathematician who specialized in geometry. He proved that a lattice pattern is the most efficient way to pack centrally symmetric convex sets on the Euclidean plane (a generalization of Thue's theorem, a 2-dimensional analog of the Kepler conjecture). He also investigated the sphere packing problem. He was the first to show, in 1953, that proof of the Kepler conjecture can be reduced to a finite case analysis and, later, that the problem might be solved using a computer. He was a member of the Hungarian Academy of Sciences (from 1962) and a director of the Alfréd Rényi Institute of Mathematics (1970-1983). He received both the Kossuth Prize (1957) and State Award (1973). Together with H.S.M. Coxeter and Paul Erdős, he laid the foundations of discrete geometry. Early life and career As described in a 1999 interview witIstván Hargittai Fejes Tóth's father was a railway worker, who advanced ... [...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 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 s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
William Thomson, 1st Baron Kelvin
William Thomson, 1st Baron Kelvin (26 June 182417 December 1907), was a British mathematician, Mathematical physics, mathematical physicist and engineer. Born in Belfast, he was the Professor of Natural Philosophy (Glasgow), professor of Natural Philosophy at the University of Glasgow for 53 years, where he undertook significant research on the mathematical analysis of electricity, was instrumental in the formulation of the first and second laws of thermodynamics, and contributed significantly to unifying physics, which was then in its infancy of development as an emerging academic discipline. He received the Royal Society's Copley Medal in 1883 and served as its President of the Royal Society, president from 1890 to 1895. In 1892, he became the first scientist to be elevated to the House of Lords. Absolute temperatures are stated in units of kelvin in Lord Kelvin's honour. While the existence of a coldest possible temperature, absolute zero, was known before his work, Kelvin d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Weaire–Phelan Structure
In geometry, the Weaire–Phelan structure is a three-dimensional structure representing an idealised foam of equal-sized bubbles, with two different shapes. In 1993, Denis Weaire and Robert Phelan found that this structure was a better solution of the Kelvin problem of tiling space by equal volume cells of minimum surface area than the previous best-known solution, the Kelvin structure. History and the Kelvin problem In two dimensions, the subdivision of the plane into cells of equal area with minimum average perimeter is given by the hexagonal tiling, but although the first record of this honeycomb conjecture goes back to the ancient Roman scholar Marcus Terentius Varro (116-27 BCE), it was not proven until the work of Thomas C. Hales in 1999. In 1887, Lord Kelvin asked the corresponding question for three-dimensional space: how can space be partitioned into cells of equal volume with the least area of surface between them? Or, in short, what was the most efficient soap bubbl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quanta Magazine
''Quanta Magazine'' is an editorially independent online publication of the Simons Foundation covering developments in physics, mathematics, biology and computer science. History ''Quanta Magazine'' was initially launched as ''Simons Science News'' in October 2012, but it was renamed to its current title in July 2013. It was founded by the former ''New York Times'' journalist Thomas Lin, who was the magazine's editor-in-chief until 2024. The two deputy editors are John Rennie and Michael Moyer, formerly of ''Scientific American'', and the art director is Samuel Velasco. In 2024, Samir Patel became the magazine's second editor in chief. Content The articles in the magazine are freely available to read online. ''Scientific American'', ''Wired'', ''The Atlantic'', and ''The Washington Post'', as well as international science publications like '' Spektrum der Wissenschaft'', have reprinted articles from the magazine. In November 2018, MIT Press The MIT Press is the uni ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle Packing
In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap. The associated ''packing density'', , of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called ''sphere packing'', which usually deals only with identical spheres. The branch of mathematics generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like. Densest packing In the two-dimensional Euclidean plane, Joseph Louis Lagrange proved in 1773 that the highest-density lattice packing of circles is the hexagonal packing arrangement, in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MathWorld
''MathWorld'' is an online mathematics reference work, created and largely written by Eric W. Weisstein. It is sponsored by and licensed to Wolfram Research, Inc. and was partially funded by the National Science Foundation's National Science Digital Library grant to the University of Illinois at Urbana–Champaign. History Eric W. Weisstein, the creator of the site, was a physics and astronomy student who got into the habit of writing notes on his mathematical readings. In 1995 he put his notes online and called it "Eric's Treasure Trove of Mathematics." It contained hundreds of pages/articles, covering a wide range of mathematical topics. The site became popular as an extensive single resource on mathematics on the web. In 1998, he made a contract with CRC Press and the contents of the site were published in print and CD-ROM form, titled ''CRC Concise Encyclopedia of Mathematics''. The free online version became only partially accessible to the public. In 1999 Weisstein we ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polygon
In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is contained in the union of the interior and the boundary of the polygon. In particular, it is a simple polygon (not self-intersecting). Equivalently, a polygon is convex if every line that does not contain any edge intersects the polygon in at most two points. Strictly convex polygon A convex polygon is ''strictly'' convex if no line contains more than two vertices of the polygon. In a convex polygon, all interior angles are less than ''or equal'' to 180 degrees, while in a strictly convex polygon all interior angles are strictly less than 180 degrees. Properties The following properties of a simple polygon are all equivalent to convexity: *Every internal angle is less than or equal to 180 degrees. *Every point on every line segment between two points inside or on the boundary of the polygon remains inside or on the bou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hexagonal
In geometry, a hexagon (from Greek , , meaning "six", and , , meaning "corner, angle") is a six-sided polygon. The total of the internal angles of any simple (non-self-intersecting) hexagon is 720°. Regular hexagon A regular hexagon is defined as a hexagon that is both equilateral and equiangular. In other words, a hexagon is said to be regular if the edges are all equal in length, and each of its internal angle is equal to 120°. The Schläfli symbol denotes this polygon as \ . However, the regular hexagon can also be considered as the cutting off the vertices of an equilateral triangle, which can also be denoted as \mathrm\ . A regular hexagon is bicentric, meaning that it is both cyclic (has a circumscribed circle) and tangential (has an inscribed circle). The common length of the sides equals the radius of the circumscribed circle or circumcircle, which equals \tfrac times the apothem (radius of the inscribed circle). Measurement The longest diagonal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Triangular Tiling Circle Packing
A triangle is a polygon with three corners and three sides, one of the basic shapes in geometry. The corners, also called ''vertices'', are zero-dimensional points while the sides connecting them, also called ''edges'', are one-dimensional line segments. A triangle has three internal angles, each one bounded by a pair of adjacent edges; the sum of angles of a triangle always equals a straight angle (180 degrees or π radians). The triangle is a plane figure and its interior is a planar region. Sometimes an arbitrary edge is chosen to be the ''base'', in which case the opposite vertex is called the ''apex''; the shortest segment between the base and apex is the ''height''. The area of a triangle equals one-half the product of height and base length. In Euclidean geometry, any two points determine a unique line segment situated within a unique straight line, and any three points that do not all lie on the same straight line determine a unique triangle situated within a u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jan Brożek
Jan Brożek or Johannes Broscius (November 1585 – 21 November 1652) was the most prominent Polish mathematician of his era and an early biographer of Copernicus. He held numerous ecclesiastical offices in the Catholic Church and was associated with the Kraków Academy for his entire career. Life Brożek was born in Kurzelów, a village in south-central Poland. His father, Jakub, was an educated landowner who introduced Jan to the principles of geometry. He received his primary education in Kurzelow, then continued his education in Krakow. In 1604, he enrolled in the Kraków Academy (now Jagiellonian University), where he received his baccalaureate on 30 March 1605. In 1610, he earned a magister degree (equivalent to a doctorate). His association with the Belgian mathematician, Adriaan van Roomen, greatly influenced his studies. In early 1614, Brożek was appointed professor of astrology at the Kraków Academy. In 1618 he travelled to Torun, Danzig and Frombork gathering mate ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
