|
Moser's Worm Problem
Moser's worm problem (also known as mother worm's blanket problem) is an unsolved problem in geometry formulated by the Austrian-Canadian mathematician Leo Moser in 1966. The problem asks for the region of smallest area that can accommodate every plane curve of length 1. Here "accommodate" means that the curve may be rotated and translated to fit inside the region. In some variations of the problem, the region is restricted to be convex. Examples For example, a circular disk of radius 1/2 can accommodate any plane curve of length 1 by placing the midpoint of the curve at the center of the disk. Another possible solution has the shape of a rhombus with vertex angles of 60 and 120 degrees (/3 and 2/3 radians) and with a long diagonal of unit length. However, these are not optimal solutions; other shapes are known that solve the problem with smaller areas. Solution properties It is not completely trivial that a solution exists – an alternative possibility would be tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Blaschke Selection Theorem
The Blaschke selection theorem is a result in topology and convex geometry about sequences of convex sets. Specifically, given a sequence \ of convex sets contained in a bounded set, the theorem guarantees the existence of a subsequence \ and a convex set K such that K_ converges to K in the Hausdorff metric. The theorem is named for Wilhelm Blaschke. Alternate statements * A succinct statement of the theorem is that the metric space of convex bodies is locally compact. * Using the Hausdorff metric on sets, every infinite collection of compact subsets of the unit ball has a limit point (and that limit point is itself a compact set). Application As an example of its use, the isoperimetric problem can be shown to have a solution. That is, there exists a curve of fixed length that encloses the maximum area possible. Other problems likewise can be shown to have a solution: * Lebesgue's universal covering problem Lebesgue's universal covering problem is an unsolved problem in ... [...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] |
Discrete And 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] |
The American Mathematical Monthly
''The American Mathematical Monthly'' is a mathematical journal founded by Benjamin Finkel in 1894. It is published ten times each year by Taylor & Francis for the Mathematical Association of America. The ''American Mathematical Monthly'' is an expository journal intended for a wide audience of mathematicians, from undergraduate students to research professionals. Articles are chosen on the basis of their broad interest and reviewed and edited for quality of exposition as well as content. In this the ''American Mathematical Monthly'' fulfills a different role from that of typical mathematical research journals. The ''American Mathematical Monthly'' is the most widely read mathematics journal in the world according to records on JSTOR. Tables of contents with article abstracts from 1997–2010 are availablonline The MAA gives the Lester R. Ford Awards annually to "authors of articles of expository excellence" published in the ''American Mathematical Monthly''. Editors *2022– ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bellman's Lost In A Forest Problem
Bellman's lost-in-a-forest problem is an unsolved minimization problem in geometry, originating in 1955 by the American applied mathematician Richard E. Bellman. The problem is often stated as follows: ''"A hiker is lost in a forest whose shape and dimensions are precisely known to him. What is the best path for him to follow to escape from the forest?"'' It is usually assumed that the hiker does not know the starting point or direction he is facing. The best path is taken to be the one that minimizes the worst-case distance to travel before reaching the edge of the forest. Other variations of the problem have been studied. Although real world applications are not apparent, the problem falls into a class of geometric optimization problems including search strategies that are of practical importance. A bigger motivation for study has been the connection to Moser's worm problem. It was included in a list of 12 problems described by the mathematician Scott W. Williams Scott Will ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lebesgue's Universal Covering Problem
Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one. The diameter of a set by definition is the least upper bound of the distances between all pairs of points in the set. A shape covers a set if it contains a congruent subset. In other words the set may be rotated, translated or reflected to fit inside the shape. Formulation and early research The problem was posed by Henri Lebesgue in a letter to Gyula Pál in 1914. It was published in a paper by Pál in 1920 along with Pál's analysis. He showed that a cover for all curves of constant width one is also a cover for all sets of diameter one and that a cover can be constructed by taking a regular hexagon with an inscribed circle of diameter one and removing two corners from the hexagon to give a cover of area 2-\frac\approx 0.84529946. In 1936, Roland Sprague showed that a part of Pál's cover could be removed ne ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kakeya Set
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 set, convex ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moving Sofa Problem
In mathematics, the moving sofa problem or sofa problem is a two-dimensional idealisation of real-life furniture-moving problems and asks for the rigid two-dimensional shape of largest area that can be maneuvered through an L-shaped planar region with legs of unit width. The area thus obtained is referred to as the ''sofa constant''. The exact value of the sofa constant is an open problem. The currently leading solution, by Joseph L. Gerver, has a value of approximately 2.2195 and is thought to be close to the optimal, based upon subsequent study and theoretical bounds. History The first formal publication was by the Austrian-Canadian mathematician Leo Moser in 1966, although there had been many informal mentions before that date. Bounds Work has been done on proving that the sofa constant (A) cannot be below or above certain values (lower bounds and upper bounds). Lower An obvious lower bound is A \geq \pi/2 \approx 1.57. This comes from a sofa that is a half-disk of unit ra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Radians
The radian, denoted by the symbol rad, is the unit of angle in the International System of Units (SI) and is the standard unit of angular measure used in many areas of mathematics. The unit was formerly an SI supplementary unit (before that category was abolished in 1995). The radian is defined in the SI as being a dimensionless unit, with 1 rad = 1. Its symbol is accordingly often omitted, especially in mathematical writing. Definition One radian is defined as the angle subtended from the center of a circle which intercepts an arc equal in length to the radius of the circle. More generally, the magnitude in radians of a subtended angle is equal to the ratio of the arc length to the radius of the circle; that is, \theta = \frac, where is the subtended angle in radians, is arc length, and is radius. A right angle is exactly \frac radians. The rotation angle (360°) corresponding to one complete revolution is the length of the circumference divided by the radius, which i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leo Moser
Leo Moser (11 April 1921, Vienna – 9 February 1970, Edmonton) was an Austrian-Canadian mathematician, best known for his polygon notation. A native of Vienna, Leo Moser immigrated with his parents to Canada at the age of three. He received his Bachelor of Science degree from the University of Manitoba in 1943, and a Master of Science from the University of Toronto in 1945. After two years of teaching he went to the University of North Carolina to complete a PhD, supervised by Alfred Brauer. There, in 1950, he began suffering recurrent heart problems. He took a position at Texas Technical College for one year, and joined the faculty of the University of Alberta in 1951, where he remained until his death at the age of 48. In 1966, Moser posed the question "What is the region of smallest area which will accommodate every planar arc of length one?".W. Moser, G. Bloind, V. Klee, C. Rousseau, J. Goodman, B. Monson, J. Wetzel, L. M. Kelly7, G. Purdy, and J Wilker, Fifth edition, ''Pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Degree (angle)
A degree (in full, a degree of arc, arc degree, or arcdegree), usually denoted by ° (the degree symbol), is a measurement of a plane (mathematics), plane angle in which one Turn (geometry), full rotation is 360 degrees. It is not an SI unit—the SI unit of angular measure is the radian—but it is mentioned in the SI Brochure, SI brochure as an Non-SI units mentioned in the SI, accepted unit. Because a full rotation equals 2 radians, one degree is equivalent to radians. History The original motivation for choosing the degree as a unit of rotations and angles is unknown. One theory states that it is related to the fact that 360 is approximately the number of days in a year. Ancient astronomers noticed that the sun, which follows through the ecliptic path over the course of the year, seems to advance in its path by approximately one degree each day. Some ancient calendars, such as the Iranian calendar, Persian calendar and the Babylonian calendar, used 360 days for a year. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
