Portal:Mathematics

The Mathematics Portal

Mathematics is the study of representing and reasoning about abstract objects (such as numbers, points, spaces, sets, structures, and games). Mathematics is used throughout the world as an essential tool in many fields, including natural science, engineering, medicine, and the social sciences. Applied mathematics, the branch of mathematics concerned with application of mathematical knowledge to other fields, inspires and makes use of new mathematical discoveries and sometimes leads to the development of entirely new mathematical disciplines, such as statistics and game theory. Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, and practical applications for what began as pure mathematics are often discovered. (Full article...)

Refresh with new selections below (purge)

Featured articles – load new batch

Featured articles are displayed here, which represent some of the best content on English Wikipedia.

Image 1

A stamp of Zhang Heng issued by China Post in 1955

Zhang Heng (Chinese: 張衡; AD 78–139), formerly romanized Chang Heng, was a Chinese polymathic scientist and statesman who lived during the Eastern Han dynasty. Educated in the capital cities of Luoyang and Chang'an, he achieved success as an astronomer, mathematician, seismologist, hydraulic engineer, inventor, geographer, cartographer, ethnographer, artist, poet, philosopher, politician, and literary scholar.

Zhang Heng began his career as a minor civil servant in Nanyang. Eventually, he became Chief Astronomer, Prefect of the Majors for Official Carriages, and then Palace Attendant at the imperial court. His uncompromising stance on historical and calendrical issues led to his becoming a controversial figure, preventing him from rising to the status of Grand Historian. His political rivalry with the palace eunuchs during the reign of Emperor Shun (r. 125–144) led to his decision to retire from the central court to serve as an administrator of Hejian Kingdom in present-day Hebei. Zhang returned home to Nanyang for a short time, before being recalled to serve in the capital once more in 138. He died there a year later, in 139. (Full article...)
Image 2

Kaczynski after his arrest in 1996

Theodore John Kaczynski (/kəˈzɪnski/ kə-ZIN-skee; May 22, 1942 – June 10, 2023), also known as the Unabomber (/ˈjuːnəbɒmər/ YOO-nə-bom-ər), was an American mathematician and domestic terrorist. He was a mathematics prodigy, but abandoned his academic career in 1969 to pursue a reclusive primitive lifestyle.

Kaczynski murdered three people and injured 23 others between 1978 and 1995 in a nationwide mail bombing campaign against people he believed to be advancing modern technology and the destruction of the natural environment. He authored Industrial Society and Its Future, a 35,000-word manifesto and social critique opposing all forms of technology, rejecting leftism, and advocating a nature-centered form of anarchism. (Full article...)
Image 3

Émile Michel Hyacinthe Lemoine (French: [emil ləmwan]; 22 November 1840 – 21 February 1912) was a French civil engineer and a mathematician, a geometer in particular. He was educated at a variety of institutions, including the Prytanée National Militaire and, most notably, the École Polytechnique. Lemoine taught as a private tutor for a short period after his graduation from the latter school.

Lemoine is best known for his proof of the existence of the Lemoine point (or the symmedian point) of a triangle. Other mathematical work includes a system he called Géométrographie and a method which related algebraic expressions to geometric objects. He has been called a co-founder of modern triangle geometry, as many of its characteristics are present in his work. (Full article...)
Image 4
The manipulations of the Rubik's Cube form the Rubik's Cube group.

In mathematics, a group is a set with a binary operation that satisfies the following constraints: the operation is associative, it has an identity element, and every element of the set has an inverse element.

Many mathematical structures are groups endowed with other properties. For example, the integers with the addition operation form an infinite group, which is generated by a single element called ⁠ $1$ ⁠ (these properties characterize the integers in a unique way). (Full article...)
Image 5
General relativity, also known as the general theory of relativity, and as Einstein's theory of gravity, is the geometric theory of gravitation published by Albert Einstein in 1915 and is the current description of gravitation in modern physics. General relativity generalizes special relativity and refines Newton's law of universal gravitation, providing a unified description of gravity as a geometric property of space and time, or four-dimensional spacetime. In particular, the curvature of spacetime is directly related to the energy and momentum of whatever is
present, including matter and radiation. The relation is specified by the Einstein field equations, a system of second-order partial differential equations.

Newton's law of universal gravitation, which describes classical gravity, can be seen as a prediction of general relativity for the almost flat spacetime geometry around stationary mass distributions. Some predictions of general relativity, however, are beyond Newton's law of universal gravitation in classical physics. These predictions concern the passage of time, the geometry of space, the motion of bodies in free fall, and the propagation of light, and include gravitational time dilation, gravitational lensing, the gravitational redshift of light, the Shapiro time delay and singularities/black holes. So far, all tests of general relativity have been shown to be in agreement with the theory. The time-dependent solutions of general relativity enable us to talk about the history of the universe and have provided the modern framework for cosmology, thus leading to the discovery of the Big Bang and cosmic microwave background radiation. Despite the introduction of a number of alternative theories, general relativity continues to be the simplest theory consistent with experimental data. (Full article...)
Image 6

Title page of the first edition of Wright's Certaine Errors in Navigation (1599)

Edward Wright (baptised 8 October 1561; died November 1615) was an English mathematician and cartographer noted for his book Certaine Errors in Navigation (1599; 2nd ed., 1610), which for the first time explained the mathematical basis of the Mercator projection by building on the works of Pedro Nunes, and set out a reference table giving the linear scale multiplication factor as a function of latitude, calculated for each minute of arc up to a latitude of 75°. This was in fact a table of values of the integral of the secant function, and was the essential step needed to make practical both the making and the navigational use of Mercator charts.

Wright was born at Garveston in Norfolk and educated at Gonville and Caius College, Cambridge, where he became a fellow from 1587 to 1596. In 1589 the college granted him leave after Elizabeth I requested that he carry out navigational studies with a raiding expedition organised by the Earl of Cumberland to the Azores to capture Spanish galleons. The expedition's route was the subject of the first map to be prepared according to Wright's projection, which was published in Certaine Errors in 1599. The same year, Wright created and published the first world map produced in England and the first to use the Mercator projection since Gerardus Mercator's original 1569 map. (Full article...)
Image 7
The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group $S̃ 3$

The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects. In addition to this geometric description, the affine symmetric groups may be defined in other ways: as collections of permutations (rearrangements) of the integers ( $..., -2, -1, 0, 1, 2, ...$ ) that are periodic in a certain sense, or in purely algebraic terms as a group with certain generators and relations. They are studied in combinatorics and representation theory.

A finite symmetric group consists of all permutations of a finite set. Each affine symmetric group is an infinite extension of a finite symmetric group. Many important combinatorial properties of the finite symmetric groups can be extended to the corresponding affine symmetric groups. Permutation statistics such as descents and inversions can be defined in the affine case. As in the finite case, the natural combinatorial definitions for these statistics also have a geometric interpretation. (Full article...)
Image 8

One of Molyneux's celestial globes, which is displayed in Middle Temple Library – from the frontispiece of the Hakluyt Society's 1889 reprint of A Learned Treatise of Globes, both Cœlestiall and Terrestriall, one of the English editions of Robert Hues' Latin work Tractatus de Globis (1594)

Emery Molyneux (/ˈɛməri ˈmɒlɪnoʊ/ EM-ər-ee MOL-in-oh; died June 1598) was an English Elizabethan maker of globes, mathematical instruments and ordnance. His terrestrial and celestial globes, first published in 1592, were the first to be made in England and the first to be made by an Englishman.

Molyneux was known as a mathematician and maker of mathematical instruments such as compasses and hourglasses. He became acquainted with many prominent men of the day, including the writer Richard Hakluyt and the mathematicians Robert Hues and Edward Wright. He also knew the explorers Thomas Cavendish, Francis Drake, Walter Raleigh and John Davis. Davis probably introduced Molyneux to his own patron, the London merchant William Sanderson, who largely financed the construction of the globes. When completed, the globes were presented to Elizabeth I. Larger globes were acquired by royalty, noblemen and academic institutions, while smaller ones were purchased as practical navigation aids for sailors and students. The globes were the first to be made in such a way that they were unaffected by the humidity at sea, and they came into general use on ships. (Full article...)
Image 9
Plots of logarithm functions, with three commonly used bases. The special points $log b b = 1$ are indicated by dotted lines, and all curves intersect in $log b 1 = 0$ .

In mathematics, the logarithm of a number is the exponent by which another fixed value, the base, must be raised to produce that number. For example, the logarithm of $1000$ to base $10$ is $3$ , because $1000$ is $10$ to the $3$ rd power: $1000 = 10 3 = 10 \times 10 \times 10$ . More generally, if $x = b y$ , then $y$ is the logarithm of $x$ to base $b$ , written $log b x$ , so $log 10 1000 = 3$ . As a single-variable function, the logarithm to base $b$ is the inverse of exponentiation with base $b$ .

The logarithm base $10$ is called the decimal or common logarithm and is commonly used in science and engineering. The natural logarithm has the number $e \approx 2.718$ as its base; its use is widespread in mathematics and physics because of its very simple derivative. The binary logarithm uses base $2$ and is widely used in computer science, information theory, music theory, and photography. When the base is unambiguous from the context or irrelevant it is often omitted, and the logarithm is written $log x$ . (Full article...)
$Image 10 Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300). In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC). It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations. The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)$

Image 10
Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300).

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).
It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,
and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, $21$ is the GCD of $252$ and $105$ (as $252 = 21 \times 12$ and $105 = 21 \times 5)$ , and the same number $21$ is also the GCD of $105$ and $252 - 105 = 147$ . Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, $21 = 5 \times 105 + (-2) \times 252$ ). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)
Image 11
The number π (/paɪ/ ; spelled out as pi) is a mathematical constant, approximately equal to 3.14159, that is the ratio of a circle's circumference to its diameter. It appears in many formulae across mathematics and physics, and some of these formulae are commonly used for defining π, to avoid relying on the definition of the length of a curve.

The number π is an irrational number, meaning that it cannot be expressed exactly as a ratio of two integers, although fractions such as 22 7 {\displaystyle {\tfrac {22}{7}}} are commonly used to approximate it. Consequently, its decimal representation never ends, nor enters a permanently repeating pattern. It is a transcendental number, meaning that it cannot be a solution of an algebraic equation involving only finite sums, products, powers, and integers. The transcendence of π implies that it is impossible to solve the ancient challenge of squaring the circle with a compass and straightedge. The decimal digits of π appear to be randomly distributed, but no proof of this conjecture has been found. (Full article...)
Image 12
Figure 1: A solution (in purple) to Apollonius's problem. The given circles are shown in black.

In Euclidean plane geometry, Apollonius's problem is to construct circles that are tangent to three given circles in a plane (Figure 1). Apollonius of Perga (c. 262 BC – c. 190 BC) posed and solved this famous problem in his work Ἐπαφαί (Epaphaí, "Tangencies"); this work has been lost, but a 4th-century AD report of his results by Pappus of Alexandria has survived. Three given circles generically have eight different circles that are tangent to them (Figure 2), a pair of solutions for each way to divide the three given circles in two subsets (there are 4 ways to divide a set of cardinality 3 in 2 parts).

In the 16th century, Adriaan van Roomen solved the problem using intersecting hyperbolas, but this solution does not use only straightedge and compass constructions. François Viète found such a solution by exploiting limiting cases: any of the three given circles can be shrunk to zero radius (a point) or expanded to infinite radius (a line). Viète's approach, which uses simpler limiting cases to solve more complicated ones, is considered a plausible reconstruction of Apollonius' method. The method of van Roomen was simplified by Isaac Newton, who showed that Apollonius' problem is equivalent to finding a position from the differences of its distances to three known points. This has applications in navigation and positioning systems such as LORAN. (Full article...)
Image 13

Noether c. 1900–1910

Amalie Emmy Noether (US: /ˈnʌtər/, UK: /ˈnɜːtə/; German: [ˈnøːtɐ]; 23 March 1882 – 14 April 1935) was a German mathematician who made many important contributions to abstract algebra. She also proved Noether's first and second theorems, which are fundamental in mathematical physics. Noether was described by Pavel Alexandrov, Albert Einstein, Jean Dieudonné, Hermann Weyl and Norbert Wiener as the most important woman in the history of mathematics. As one of the leading mathematicians of her time, she developed theories of rings, fields, and algebras. In physics, Noether's theorem explains the connection between symmetry and conservation laws.

Noether was born to a Jewish family in the Franconian town of Erlangen; her father was the mathematician Max Noether. She originally planned to teach French and English after passing the required examinations but instead studied mathematics at the University of Erlangen, where her father lectured. After completing her doctorate in 1907 under the supervision of Paul Gordan, she worked at the Mathematical Institute of Erlangen without pay for seven years. At the time, women were largely excluded from academic positions. In 1915, she was invited by David Hilbert and Felix Klein to join the mathematics department at the University of Göttingen, a world-renowned center of mathematical research. The philosophical faculty objected, however, and she spent four years lecturing under Hilbert's name. Her habilitation was approved in 1919, allowing her to obtain the rank of Privatdozent. (Full article...)
Image 14

Elementary algebra studies which values solve equations formed using arithmetical operations.

Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations, such as addition and multiplication.

Elementary algebra is the main form of algebra taught in schools. It examines mathematical statements using variables for unspecified values and seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field that investigates linear equations and combinations of them called systems of linear equations. It provides methods to find the values that solve all equations in the system at the same time, and to study the set of these solutions. (Full article...)
Image 15

Portrait by August Köhler, c. 1910, after 1627 original

Johannes Kepler (/ˈkɛplər/; German: [joˈhanəs ˈkɛplɐ, -nɛs -] ; 27 December 1571 – 15 November 1630) was a German astronomer, mathematician, astrologer, natural philosopher and writer on music. He is a key figure in the 17th-century Scientific Revolution, best known for his laws of planetary motion, and his books Astronomia nova, Harmonice Mundi, and Epitome Astronomiae Copernicanae, influencing among others Isaac Newton, providing one of the foundations for his theory of universal gravitation. The variety and impact of his work made Kepler one of the founders and fathers of modern astronomy, the scientific method, natural and modern science. He has been described as the "father of science fiction" for his novel Somnium.

Kepler was a mathematics teacher at a seminary school in Graz, where he became an associate of Prince Hans Ulrich von Eggenberg. Later he became an assistant to the astronomer Tycho Brahe in Prague, and eventually the imperial mathematician to Emperor Rudolf II and his two successors Matthias and Ferdinand II. He also taught mathematics in Linz, and was an adviser to General Wallenstein.
Additionally, he did fundamental work in the field of optics, being named the father of modern optics, in particular for his Astronomiae pars optica. He also invented an improved version of the refracting telescope, the Keplerian telescope, which became the foundation of the modern refracting telescope, while also improving on the telescope design by Galileo Galilei, who mentioned Kepler's discoveries in his work. He is also known for postulating the Kepler conjecture. (Full article...)

More featured articles

edit

Selected image – show another

Quicksort

Credit: RolandH

Quicksort (also known as the partition-exchange sort) is an efficient sorting algorithm that works for items of any type for which a total order (i.e., "≤") relation is defined. This animation shows how the algorithm partitions the input array (here a random permutation of the numbers 1 through 33) into two smaller arrays based on a selected pivot element (bar marked in red, here always chosen to be the last element in the array under consideration), by swapping elements between the two sub-arrays so that those in the first (on the left) end up all smaller than the pivot element's value (horizontal blue line) and those in the second (on the right) all larger. The pivot element is then moved to a position between the two sub-arrays; at this point, the pivot element is in its final position and will never be moved again. The algorithm then proceeds to recursively apply the same procedure to each of the smaller arrays, partitioning and rearranging the elements until there are no sub-arrays longer than one element left to process. (As can be seen in the animation, the algorithm actually sorts all left-hand sub-arrays first, and then starts to process the right-hand sub-arrays.) First developed by Tony Hoare in 1959, quicksort is still a commonly used algorithm for sorting in computer applications. On the average, it requires

O (n log n)

comparisons to sort

n

items, which compares favorably to other popular sorting methods, including merge sort and heapsort. Unfortunately, on rare occasions (including cases where the input is already sorted or contains items that are all equal) quicksort requires a worst-case

O(n 2)

comparisons, while the other two methods remain

O(n log n)

in their worst cases. Still, when implemented well, quicksort can be about two or three times faster than its main competitors. Unlike merge sort, the standard implementation of quicksort does not preserve the order of equal input items (it is not stable), although stable versions of the algorithm do exist at the expense of requiring

O(n)

additional storage space. Other variations are based on different ways of choosing the pivot element (for example, choosing a random element instead of always using the last one), using more than one pivot, switching to an insertion sort when the sub-arrays have shrunk to a sufficiently small length, and using a three-way partitioning scheme (grouping items into those smaller, larger, and equal to the pivot—a modification that can turn the worst-case scenario of all-equal input values into the best case). Because of the algorithm's "divide and conquer" approach, parts of it can be done in parallel (in particular, the processing of the left and right sub-arrays can be done simultaneously). However, other sorting algorithms (including merge sort) experience much greater speed increases when performed in parallel.

More selected pictures

Good articles – load new batch

These are Good articles, which meet a core set of high editorial standards.

Image 1
Convergence of a convex curve to a circle under the curve-shortening flow. Inner curves (lighter color) are flowed versions of the outer curves. Time steps between curves are not uniform.

In mathematics, the curve-shortening flow is a process that modifies a smooth curve in the Euclidean plane by moving its points perpendicularly to the curve at a speed proportional to the curvature. The curve-shortening flow is an example of a geometric flow, and is the one-dimensional case of the mean curvature flow. Other names for the same process include the Euclidean shortening flow, geometric heat flow, and arc length evolution.

As the points of any smooth simple closed curve move in this way, the curve remains simple and smooth. It loses area at a constant rate, and its perimeter decreases as quickly as possible for any continuous curve evolution. If the curve is non-convex, its total absolute curvature decreases monotonically, until it becomes convex. Once convex, the isoperimetric ratio of the curve decreases as the curve converges to a circular shape, before collapsing to a singularity. If two disjoint simple smooth closed curves evolve, they remain disjoint until one of them collapses to a point. (Full article...)
Image 2

Detail of Averroes in a 14th-century painting by Andrea di Bonaiuto

Ibn Rushd (14 April 1126 – 11 December 1198), often Latinized as Averroes (English: /əˈvɛroʊiːz/), was an Andalusian polymath and jurist who wrote about many subjects, including philosophy, theology, medicine, astronomy, physics, psychology, mathematics, Islamic jurisprudence and law, and linguistics. The author of more than 100 books and treatises, his philosophical works include numerous commentaries on Aristotle, for which he was known in the Western world as The Commentator and Father of Rationalism.

Averroes was a strong proponent of Aristotelianism; he attempted to restore what he considered the original teachings of Aristotle and opposed the Neoplatonist tendencies of earlier Muslim thinkers, such as al-Farabi and Avicenna. He also defended the pursuit of philosophy against criticism by Ash'ari theologians such as Al-Ghazali. Averroes argued that philosophy was permissible in Islam and even compulsory among certain elites. He also argued scriptural text should be interpreted allegorically if it appeared to contradict conclusions reached by reason and philosophy. In Islamic jurisprudence, he wrote the Bidāyat al-Mujtahid on the differences between Islamic schools of law and the principles that caused their differences. In medicine, he proposed a new theory of stroke, described the signs and symptoms of Parkinson's disease for the first time, and might have been the first to identify the retina as the part of the eye responsible for sensing light. His medical book Al-Kulliyat fi al-Tibb, translated into Latin and known as the Colliget, became a textbook in Europe for centuries. (Full article...)
$Image 3 A perspective projection of a dodecahedral tessellation in H3. Note the recursive structure: each pentagon contains smaller pentagons, which contain smaller pentagons. This is an example of a subdivision rule arising from a finite universe (i.e. a closed 3-manifold). In mathematics, a finite subdivision rule is a recursive way of dividing a polygon or other two-dimensional shape into smaller and smaller pieces. Subdivision rules in a sense are generalizations of regular geometric fractals. Instead of repeating exactly the same design over and over, they have slight variations in each stage, allowing a richer structure while maintaining the elegant style of fractals. Subdivision rules have been used in architecture, biology, and computer science, as well as in the study of hyperbolic manifolds. Substitution tilings are a well-studied type of subdivision rule. (Full article...)$

Image 3
A perspective projection of a dodecahedral tessellation in H³. Note the recursive structure: each pentagon contains smaller pentagons, which contain smaller pentagons. This is an example of a subdivision rule arising from a finite universe (i.e. a closed 3-manifold).

In mathematics, a finite subdivision rule is a recursive way of dividing a polygon or other two-dimensional shape into smaller and smaller pieces. Subdivision rules in a sense are generalizations of regular geometric fractals. Instead of repeating exactly the same design over and over, they have slight variations in each stage, allowing a richer structure while maintaining the elegant style of fractals. Subdivision rules have been used in architecture, biology, and computer science, as well as in the study of hyperbolic manifolds. Substitution tilings are a well-studied type of subdivision rule. (Full article...)
Image 4
The small set expansion hypothesis or small set expansion conjecture in computational complexity theory is an unproven computational hardness assumption. Under the small set expansion hypothesis it is assumed to be computationally infeasible to distinguish between a certain class of expander graphs called "small set expanders" and other graphs that are very far from being small set expanders. This assumption implies the hardness of several other computational problems, and the optimality of certain known approximation algorithms.

The small set expansion hypothesis is related to the unique games conjecture, another unproven computational hardness assumption according to which accurately approximating the value of certain games is computationally infeasible. If the small set expansion hypothesis is true, then so is the unique games conjecture. (Full article...)
Image 5
The red graph is the dual graph of the blue graph, and vice versa.

In the mathematical discipline of graph theory, the dual graph of a planar graph $G$ is a graph that has a vertex for each face of $G$ . The dual graph has an edge for each pair of faces in $G$ that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge $e$ of $G$ has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of $e$ . The definition of the dual depends on the choice of embedding of the graph $G$ , so it is a property of plane graphs (graphs that are already embedded in the plane) rather than planar graphs (graphs that may be embedded but for which the embedding is not yet known). For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.

Historically, the first form of graph duality to be recognized was the association of the Platonic solids into pairs of dual polyhedra. Graph duality is a topological generalization of the geometric concepts of dual polyhedra and dual tessellations, and is in turn generalized combinatorially by the concept of a dual matroid. Variations of planar graph duality include a version of duality for directed graphs, and duality for graphs embedded onto non-planar two-dimensional surfaces. (Full article...)
Image 6

Fredrik Carl Mülertz Størmer (Norwegian pronunciation: [fʁɛdʁɪk kaːl ˈmʏlɐːt͡s ̍ˈʃtøːmɐː]) (3 September 1874 – 13 August 1957) was a Norwegian mathematician and astrophysicist. In mathematics, he is known for his work in number theory, including the calculation of $π$ and Størmer's theorem on consecutive smooth numbers. In physics, he is known for studying the movement of charged particles in the magnetosphere and the formation of aurorae, and for his book on these subjects, From the Depths of Space to the Heart of the Atom. He worked for many years as a professor of mathematics at the University of Oslo in Norway. A crater on the far side of the Moon is named after him. (Full article...)
Image 7
The Laves graph

In geometry and crystallography, the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three equal-length segments meet at 120° angles at each point, and all cycles use ten or more segments. It is the shortest possible triply periodic graph, relative to the volume of its fundamental domain. One arrangement of the Laves graph uses one out of every eight of the points in the integer lattice as its points, and connects all pairs of these points that are nearest neighbors, at distance ${\sqrt {2}}$ . It can also be defined, divorced from its geometry, as an abstract undirected graph, a covering graph of the complete graph on four vertices.
H. S. M. Coxeter (1955) named this graph after Fritz Laves, who first wrote about it as a crystal structure in 1932. It has also been called the K₄ crystal, (10,3)-a network, diamond twin, triamond, and the srs net. The regions of space nearest each vertex of the graph are congruent 17-sided polyhedra that tile space. Its edges lie on diagonals of the regular skew polyhedron, a surface with six squares meeting at each integer point of space. (Full article...)
Image 8

Lasker in 1929

Emanuel Lasker (German pronunciation: [eˈmaːnuɛl ˈlaskɐ] ; December 24, 1868 – January 11, 1941) was a German chess player, mathematician, and philosopher. He was the second World Chess Champion, holding the title for 27 years, from 1894 to 1921, the longest reign of any officially recognised World Chess Champion winning 6 World Chess Championships. In his prime, Lasker was one of the most dominant champions, and he is still generally regarded as one of the strongest players in history.

His contemporaries used to say that Lasker used a "psychological" approach to the game, and even that he sometimes deliberately played inferior moves to confuse opponents. Recent analysis, however, indicates that he was ahead of his time and used a more flexible approach than his contemporaries, which mystified many of them. Lasker knew contemporary analyses of openings well but disagreed with many of them. He published chess magazines and five chess books, but later players and commentators found it difficult to draw lessons from his methods. (Full article...)
Image 9
The Euclid–Euler theorem is a theorem in number theory that relates perfect numbers to Mersenne primes. It states that an even number is perfect if and only if it has the form $2 p -1 (2 p - 1)$ , where $2 p - 1$ is a prime number. The theorem is named after mathematicians Euclid and Leonhard Euler, who respectively proved the "if" and "only if" aspects of the theorem.

It has been conjectured that there are infinitely many Mersenne primes. Although the truth of this conjecture remains unknown, it is equivalent, by the Euclid–Euler theorem, to the conjecture that there are infinitely many even perfect numbers. However, it is also unknown whether there exists even a single odd perfect number. (Full article...)
Image 10
In this example, the alternating sum of angles (clockwise from the bottom) is 90° − 45° + 22.5° − 22.5° + 45° − 90° + 22.5° − 22.5° = 0°. Since it adds to zero, the crease pattern may be flat-folded.

Kawasaki's theorem or Kawasaki–Justin theorem is a theorem in the mathematics of paper folding that describes the crease patterns with a single vertex that may be folded to form a flat figure. It states that the pattern is flat-foldable if and only if alternatingly adding and subtracting the angles of consecutive folds around the vertex gives an alternating sum of zero.
Crease patterns with more than one vertex do not obey such a simple criterion, and are NP-hard to fold.

The theorem is named after one of its discoverers, Toshikazu Kawasaki. However, several others also contributed to its discovery, and it is sometimes called the Kawasaki–Justin theorem or Husimi's theorem after other contributors, Jacques Justin and Kôdi Husimi. (Full article...)
Image 11
The regular heptagon cannot be constructed using only a straightedge and compass construction; this can be proven using the field of constructible numbers.

In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics.

The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, and p-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many elements. (Full article...)
Image 12
Diagram of the three utilities problem on a plane. All lines are connected, but two of them are crossing.

The three utilities problem, also known as water, gas and electricity, is a mathematical puzzle that asks for non-crossing connections to be drawn between three houses and three utility companies on a plane. When posing it in the early 20th century, Henry Dudeney wrote that it was already an old problem. It is an impossible puzzle: it is not possible to connect all nine lines without any of them crossing. Versions of the problem on nonplanar surfaces such as a torus or Möbius strip, or that allow connections to pass through other houses or utilities, can be solved.

This puzzle can be formalized as a problem in topological graph theory by asking whether the complete bipartite graph $K_{3,3}$ , with vertices representing the houses and utilities and edges representing their connections, has a graph embedding in the plane. The impossibility of the puzzle corresponds to the fact that $K_{3,3}$ is not a planar graph. Multiple proofs of this impossibility are known, and form part of the proof of Kuratowski's theorem characterizing planar graphs by two forbidden subgraphs, one of which is $K_{3,3}$ . The question of minimizing the number of crossings in drawings of complete bipartite graphs is known as Turán's brick factory problem, and for $K_{3,3}$ the minimum number of crossings is one. (Full article...)

More good articles

Did you know (auto-generated) – load new batch

... that mathematician Daniel Larsen was the youngest contributor to the New York Times crossword puzzle?
... that in 1967 two mathematicians published PhD dissertations independently disproving the same thirteen-year-old conjecture?
... that Fairleigh Dickinson's upset victory over Purdue was the biggest upset in terms of point spread in NCAA tournament history, with Purdue being a 23+1⁄2-point favorite?
... that Kit Nascimento, a spokesperson for the government of Guyana during the aftermath of Jonestown, disagrees with current proposals to open the former Jonestown site as a tourist attraction?
... that the music of math rock band Jyocho has been alternatively described as akin to "madness" or "contemplative and melancholy"?
... that the identity of Cleo, who provided online answers to complex mathematics problems without showing any work, was revealed over a decade later in 2025?
... that after Archimedes first defined convex curves, mathematicians lost interest in their analysis until the 19th century, more than two millennia later?
... that despite published scholarship to the contrary, Andrew Planta neither received a doctorate nor taught mathematics at Erlangen?

edit

More did you know – view different entries

Did you know...

...that every natural number can be written as the sum of four squares?
...that the largest known prime number is nearly 41 million digits long?
...that the set of rational numbers is equal in size to the set of integers; that is, they can be put in one-to-one correspondence?
...that there are precisely six convex regular polytopes in four dimensions? These are analogs of the five Platonic solids known to the ancient Greeks.
...that it is unknown whether π and e are algebraically independent?
...that a nonconvex polygon with three convex vertices is called a pseudotriangle?
...that it is possible for a three-dimensional figure to have a finite volume but infinite surface area, such as Gabriel's Horn?

More did you know facts

Showing 7 items out of 75

edit

Selected article – show another

Fourteen ways of triangulating a hexagon
Image credit: User:Dmharvey

The Catalan numbers, named for the Belgian mathematician Eugène Charles Catalan, are a sequence of natural numbers that are important in combinatorial mathematics. The sequence begins:

1, 1, 2, 5, 14, 42, 132, ...

The Catalan numbers are solutions to numerous counting problems which often have a recursive flavour. In fact, one author lists over 60 different possible interpretations of these numbers. For example, the n^th Catalan number is the number of full binary trees with n internal nodes, or n+1 leaves. It is also the number of ways of associating n applications of a binary operator as well as the number of ways that a convex polygon with n + 2 sides can be cut into triangles by connecting vertices with straight lines. (Full article...)

View all selected articles

edit

Subcategories

Full category tree. Select [►] to view subcategories.

More mathematics categories

edit

Topics in mathematics

General

Foundations

Number theory

Discrete mathematics

Algebra

Analysis

Geometry and topology

Applied mathematics

edit

Index of mathematics articles

ARTICLE INDEX:	0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
MATHEMATICIANS:	A B C D E F G H I J K L M N O P Q R S T U V W X Y Z