Related Research Articles
A perimeter is a closed path that encompasses, surrounds, or outlines either a two dimensional shape or a one-dimensional length. The perimeter of a circle or an ellipse is called its circumference.
In the theory of computational complexity, the travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research.
Mathematical optimization or mathematical programming is the selection of a best element, with regard to some criteria, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
Dynamic programming is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.
An equilateral triangle is a triangle in which all three sides have the same length, and all three angles are equal. Because of these properties, the equilateral triangle is a regular polygon, occasionally known as the regular triangle. It is the special case of an isosceles triangle by modern definition, creating more special properties.
Squaring the circle is a problem in geometry first proposed in Greek mathematics. It is the challenge of constructing a square with the area of a given circle by using only a finite number of steps with a compass and straightedge. The difficulty of the problem raised the question of whether specified axioms of Euclidean geometry concerning the existence of lines and circles implied the existence of such a square.
A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.
Max Wilhelm Dehn was a German mathematician most famous for his work in geometry, topology and geometric group theory. Dehn's early life and career took place in Germany. However, he was forced to retire in 1935 and eventually fled Germany in 1939 and emigrated to the United States.
Richard Ernest Bellman was an American applied mathematician, who introduced dynamic programming in 1953, and made important contributions in other fields of mathematics, such as biomathematics. He founded the leading biomathematical journal Mathematical Biosciences, as well as the Journal of Mathematical Analysis and Applications.
Sangaku or san gaku are Japanese geometrical problems or theorems on wooden tablets which were placed as offerings at Shinto shrines or Buddhist temples during the Edo period by members of all social classes.
Richard Evan Schwartz is an American mathematician notable for his contributions to geometric group theory and to an area of mathematics known as billiards. Geometric group theory is a relatively new area of mathematics beginning around the late 1980s which explores finitely generated groups, and seeks connections between their algebraic properties and the geometric spaces on which these groups act. He has worked on what mathematicians refer to as billiards, which are dynamical systems based on a convex shape in a plane. He has explored geometric iterations involving polygons, and he has been credited for developing the mathematical concept known as the pentagram map. In addition, he is author of a mathematics picture book for young children. In 2018 he is a professor of mathematics at Brown University.
A dissection puzzle, also called a transformation puzzle or Richter puzzle, is a tiling puzzle where a set of pieces can be assembled in different ways to produce two or more distinct geometric shapes. The creation of new dissection puzzles is also considered to be a type of dissection puzzle. Puzzles may include various restraints, such as hinged pieces, pieces that can fold, or pieces that can twist. Creators of new dissection puzzles emphasize using a minimum number of pieces, or creating novel situations, such as ensuring that every piece connects to another with a hinge.
In geometry, Prince Rupert's cube is the largest cube that can pass through a hole cut through a unit cube without splitting it into separate pieces. Its side length is approximately 1.06, 6% larger than the side length 1 of the unit cube through which it passes. The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution.
The Millennium Prize Problems are seven well-known complex mathematical problems selected by the Clay Mathematics Institute in 2000. The Clay Institute has pledged a US $1 million prize for the first correct solution to each problem.
Moser's worm 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.
In geometry, the Weber problem, named after Alfred Weber, is one of the most famous problems in location theory. It requires finding a point in the plane that minimizes the sum of the transportation costs from this point to n destination points, where different destination points are associated with different costs per unit distance.
In discrete geometry, an opaque set is a system of curves or other set in the plane that blocks all lines of sight across a polygon, circle, or other shape. Opaque sets have also been called barriers, beam detectors, opaque covers, or opaque forests. Opaque sets were introduced by Stefan Mazurkiewicz in 1916, and the problem of minimizing their total length was posed by Frederick Bagemihl in 1959.
In computational geometry, a polygonalization of a finite set of points in the Euclidean plane is a simple polygon with the given points as its vertices. A polygonalization may also be called a polygonization, simple polygonalization, Hamiltonian polygon, non-crossing Hamiltonian cycle, or crossing-free straight-edge spanning cycle.
Geometric Origami is a book on the mathematics of paper folding, focusing on the ability to simulate and extend classical straightedge and compass constructions using origami. It was written by Austrian mathematician Robert Geretschläger and published by Arbelos Publishing in 2008. The Basic Library List Committee of the Mathematical Association of America has suggested its inclusion in undergraduate mathematics libraries.
References
- ↑ Bellman, R. (1956). "Minimization problem". Research problems. Bulletin of the American Mathematical Society . 62 (3): 270. doi: 10.1090/S0002-9904-1956-10021-9 .
- ↑ Finch, S. R.; Wetzel, J. E. (2004). "Lost in a forest" (PDF). American Mathematical Monthly . 11 (8): 645–654. doi:10.2307/4145038. JSTOR 4145038. MR 2091541.
- ↑ Williams, S. W. (2000). "Million buck problems" (PDF). National Association of Mathematicians Newsletter. 31 (2): 1–3.
- ↑ Ward, John W. (2008). "Exploring the Bellman Forest Problem" (PDF). Retrieved 2020-12-14.