Portal:Mathematics

The Mathematics Portal

Carl Friedrich Gauss

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...)

Featured articles –

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

---

• 

  

  
  É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...)
• 
  
  

  

  Bust of Shen at the Beijing Ancient Observatory

  
  Shen Kuo (Chinese: 沈括; 1031–1095) or Shen Gua, courtesy name Cunzhong (存中) and pseudonym Mengqi (now usually given as Mengxi) Weng (夢溪翁), was a Chinese polymath, scientist, and statesman of the Song dynasty (960–1279). Shen was a master in many fields of study including mathematics, optics, and horology. In his career as a civil servant, he became a finance minister, governmental state inspector, head official for the Bureau of Astronomy in the Song court, Assistant Minister of Imperial Hospitality, and also served as an academic chancellor. At court his political allegiance was to the Reformist faction known as the New Policies Group, headed by Chancellor Wang Anshi (1021–1085).
  
  In his Dream Pool Essays or Dream Torrent Essays (夢溪筆談; Mengxi Bitan) of 1088, Shen was the first to describe the magnetic needle compass, which would be used for navigation (first described in Europe by Alexander Neckam in 1187). Shen discovered the concept of true north in terms of magnetic declination towards the north pole, with experimentation of suspended magnetic needles and "the improved meridian determined by Shen's [astronomical] measurement of the distance between the pole star and true north". This was the decisive step in human history to make compasses more useful for navigation, and may have been a concept unknown in Europe for another four hundred years (evidence of German sundials made circa 1450 show markings similar to Chinese geomancers' compasses in regard to declination). (Full article...)
• 

  

  The weighing pans of this balance scale contain zero objects, divided into two equal groups.

  
  In mathematics, zero is a even number. In other words, its parity—the quality of an integer being even or odd—is even. This can be easily verified based on the definition of "even": zero is an integer multiple of 2, specifically 0 × 2. As a result, zero shares all the properties that characterize even numbers: for example, 0 is neighbored on both sides by odd numbers, any decimal integer has the same parity as its last digit—so, since 10 is even, 0 will be even, and if y is even then y + x has the same parity as x—indeed, 0 + x and x always have the same parity.
  
  Zero also fits into the patterns formed by other even numbers. The parity rules of arithmetic, such as even − even = even, require 0 to be even. Zero is the additive identity element of the group of even integers, and it is the starting case from which other even natural numbers are recursively defined. Applications of this recursion from graph theory to computational geometry rely on zero being even. Not only is 0 divisible by 2, it is divisible by every power of 2, which is relevant to the binary numeral system used by computers. In this sense, 0 is the "most even" number of all. (Full article...)
• 
  
  

  

  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 which opposes all forms of technology, rejecting leftism, and advocating a nature-centered form of anarchism. (Full article...)
• 
  
  

  

  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...)
• 

  

  
  Richard Phillips Feynman (/ˈfaɪnmən/; May 11, 1918 – February 15, 1988) was an American theoretical physicist. He is best known for his work in the path integral formulation of quantum mechanics, the theory of quantum electrodynamics, the physics of the superfluidity of supercooled liquid helium, and in particle physics, for which he proposed the parton model. For his contributions to the development of quantum electrodynamics, Feynman received the Nobel Prize in Physics in 1965 jointly with Julian Schwinger and Shin'ichirō Tomonaga.
  
  Feynman developed a widely used pictorial representation scheme for the mathematical expressions describing the behavior of subatomic particles, which later became known as Feynman diagrams. During his lifetime, Feynman became one of the best-known scientists in the world. In a 1999 poll of 130 leading physicists worldwide by the British journal Physics World, he was ranked the seventh-greatest physicist of all time. (Full article...)
• 
  In algebraic geometry and theoretical physics, mirror symmetry is a relationship between geometric objects called Calabi–Yau manifolds. The term refers to a situation where two Calabi–Yau manifolds look very different geometrically but are nevertheless equivalent when employed as extra dimensions of string theory.
  
  Early cases of mirror symmetry were discovered by physicists. Mathematicians became interested in this relationship around 1990 when Philip Candelas, Xenia de la Ossa, Paul Green, and Linda Parkes showed that it could be used as a tool in enumerative geometry, a branch of mathematics concerned with counting the number of solutions to geometric questions. Candelas and his collaborators showed that mirror symmetry could be used to count rational curves on a Calabi–Yau manifold, thus solving a longstanding problem. Although the original approach to mirror symmetry was based on physical ideas that were not understood in a mathematically precise way, some of its mathematical predictions have since been proven rigorously. (Full article...)
• 

  

  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 to base b is the inverse function of exponentiation with base b. That means that the logarithm of a number x to the base b is the exponent to which b must be raised to produce x. For example, since 1000 = 10³, the logarithm base $10$ of 1000 is 3, or log₁₀ (1000) = 3. The logarithm of x to base b is denoted as log_b (x), or without parentheses, log_b x. When the base is clear from the context or is irrelevant it is sometimes written log x.
  
  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 ≈ 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 frequently used in computer science. (Full article...)
• 

  

  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...)
• 

  

  High-precision test of general relativity by the Cassini space probe (artist's impression): radio signals sent between the Earth and the probe (green wave) are delayed by the warping of spacetime (blue lines) due to the Sun's mass.

  
  
  General relativity is a theory of gravitation developed by Albert Einstein between 1907 and 1915. The theory of general relativity says that the observed gravitational effect between masses results from their warping of spacetime.
  
  By the beginning of the 20th century, Newton's law of universal gravitation had been accepted for more than two hundred years as a valid description of the gravitational force between masses. In Newton's model, gravity is the result of an attractive force between massive objects. Although even Newton was troubled by the unknown nature of that force, the basic framework was extremely successful at describing motion. (Full article...)
• 
  
  

  

  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 proved Noether's first and second theorems, which are fundamental in mathematical physics. She 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...)
• 
  
  

  

  Hilary Putnam

  
  The Quine–Putnam indispensability argument is an argument in the philosophy of mathematics for the existence of abstract mathematical objects such as numbers and sets, a position known as mathematical platonism. It was named after the philosophers Willard Van Orman Quine and Hilary Putnam, and is one of the most important arguments in the philosophy of mathematics.
  
  Although elements of the indispensability argument may have originated with thinkers such as Gottlob Frege and Kurt Gödel, Quine's development of the argument was unique for introducing to it a number of his philosophical positions such as naturalism, confirmational holism, and the criterion of ontological commitment. Putnam gave Quine's argument its first detailed formulation in his 1971 book Philosophy of Logic. He later came to disagree with various aspects of Quine's thinking, however, and formulated his own indispensability argument based on the no miracles argument in the philosophy of science. A standard form of the argument in contemporary philosophy is credited to Mark Colyvan; whilst being influenced by both Quine and Putnam, it differs in important ways from their formulations. It is presented in the Stanford Encyclopedia of Philosophy: (Full article...)
• 
  In classical mechanics, the Laplace–Runge–Lenz (LRL) vector is a vector used chiefly to describe the shape and orientation of the orbit of one astronomical body around another, such as a binary star or a planet revolving around a star. For two bodies interacting by Newtonian gravity, the LRL vector is a constant of motion, meaning that it is the same no matter where it is calculated on the orbit; equivalently, the LRL vector is said to be conserved. More generally, the LRL vector is conserved in all problems in which two bodies interact by a central force that varies as the inverse square of the distance between them; such problems are called Kepler problems.
  
  The hydrogen atom is a Kepler problem, since it comprises two charged particles interacting by Coulomb's law of electrostatics, another inverse-square central force. The LRL vector was essential in the first quantum mechanical derivation of the spectrum of the hydrogen atom, before the development of the Schrödinger equation. However, this approach is rarely used today. (Full article...)
• 
  
  

  

  The title page of a 1634 version of Hues' Tractatus de globis in the collection of the Biblioteca Nacional de Portugal

  
  Robert Hues (1553 – 24 May 1632) was an English mathematician and geographer. He attended St. Mary Hall at Oxford, and graduated in 1578. Hues became interested in geography and mathematics, and studied navigation at a school set up by Walter Raleigh. During a trip to Newfoundland, he made observations which caused him to doubt the accepted published values for variations of the compass. Between 1586 and 1588, Hues travelled with Thomas Cavendish on a circumnavigation of the globe, performing astronomical observations and taking the latitudes of places they visited. Beginning in August 1591, Hues and Cavendish again set out on another circumnavigation of the globe. During the voyage, Hues made astronomical observations in the South Atlantic, and continued his observations of the variation of the compass at various latitudes and at the Equator. Cavendish died on the journey in 1592, and Hues returned to England the following year.
  
  In 1594, Hues published his discoveries in the Latin work Tractatus de globis et eorum usu (Treatise on Globes and Their Use) which was written to explain the use of the terrestrial and celestial globes that had been made and published by Emery Molyneux in late 1592 or early 1593, and to encourage English sailors to use practical astronomical navigation. Hues' work subsequently went into at least 12 other printings in Dutch, English, French and Latin. (Full article...)
• 

  

  The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group S̃₃

  
  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...)

Selected image –

graph of an increasing curve showing cumulative share of income earned versus cumulative share of people from lowest to highest income

Lorenz curve

Credit: BenFrantzDale

A Lorenz curve shows the distribution of income in a population by plotting the percentage y of total income that is earned by the bottom x percent of households (or individuals). Developed by economist Max O. Lorenz in 1905 to describe income inequality, the curve is typically plotted with a diagonal line (reflecting a hypothetical "equal" distribution of incomes) for comparison. This leads naturally to a derived quantity called the Gini coefficient, first published in 1912 by Corrado Gini, which is the ratio of the area between the diagonal line and the curve (area A in this graph) to the area under the diagonal line (the sum of A and B); higher Gini coefficients reflect more income inequality. Lorenz's curve is a special kind of cumulative distribution function used to characterize quantities that follow a Pareto distribution, a type of power law. More specifically, it can be used to illustrate the Pareto principle, a rule of thumb stating that roughly 80% of the identified "effects" in a given phenomenon under study will come from 20% of the "causes" (in the first decade of the 20th century Vilfredo Pareto showed that 80% of the land in Italy was owned by 20% of the population). As this so-called "80–20 rule" implies a specific level of inequality (i.e., a specific power law), more or less extreme cases are possible. For example, in the United States in the first half of the 2010s, 95% of the financial wealth was held by the top 20% of wealthiest households (in 2010), the top 1% of individuals held approximately 40% of the wealth (2012), and the top 1% of income earners received approximately 20% of the pre-tax income (2013). Observations such as these have brought income and wealth inequality into popular consciousness and have given rise to various slogans about "the 1%" versus "the 99%".

Good articles –

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

---

• 

  

  Hendrik Antoon Lorentz (right) after whom the Lorentz group is named and Albert Einstein whose special theory of relativity is the main source of application. Photo taken by Paul Ehrenfest 1921.

  
  
  The Lorentz group is a Lie group of symmetries of the spacetime of special relativity. This group can be realized as a collection of matrices, linear transformations, or unitary operators on some Hilbert space; it has a variety of representations. This group is significant because special relativity together with quantum mechanics are the two physical theories that are most thoroughly established, and the conjunction of these two theories is the study of the infinite-dimensional unitary representations of the Lorentz group. These have both historical importance in mainstream physics, as well as connections to more speculative present-day theories. (Full article...)
• 

  

  Graph of the equation y = 1/x. Here, e is the unique number larger than 1 that makes the shaded area under the curve equal to 1.

  
  The number e is a mathematical constant approximately equal to 2.71828 that is the base of the natural logarithm and exponential function. It is sometimes called Euler's number, after the Swiss mathematician Leonhard Euler, though this can invite confusion with Euler numbers, or with Euler's constant, a different constant typically denoted $\gamma$. Alternatively, e can be called Napier's constant after John Napier. The Swiss mathematician Jacob Bernoulli discovered the constant while studying compound interest.
  
  The number e is of great importance in mathematics, alongside 0, 1, π, and i. All five appear in one formulation of Euler's identity $e^{i\pi }+1=0$ and play important and recurring roles across mathematics. Like the constant π, e is irrational, meaning that it cannot be represented as a ratio of integers, and moreover it is transcendental, meaning that it is not a root of any non-zero polynomial with rational coefficients. To 30 decimal places, the value of e is: (Full article...)
• 

  

  Two greedy colorings of the same crown graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors.

  
  In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings can be found in linear time, but they do not, in general, use the minimum number of colors possible.
  
  Different choices of the sequence of vertices will typically produce different colorings of the given graph, so much of the study of greedy colorings has concerned how to find a good ordering. There always exists an ordering that produces an optimal coloring, but although such orderings can be found for many special classes of graphs, they are hard to find in general. Commonly used strategies for vertex ordering involve placing higher-degree vertices earlier than lower-degree vertices, or choosing vertices with fewer available colors in preference to vertices that are less constrained. (Full article...)
• 

  

  
  In geometry, a Schönhardt polyhedron is a polyhedron with the same combinatorial structure as a regular octahedron, but with dihedral angles that are non-convex along three disjoint edges. Because it has no interior diagonals, it cannot be triangulated into tetrahedra without adding new vertices. It has the fewest vertices of any polyhedron that cannot be triangulated. It is named after the German mathematician Erich Schönhardt, who described it in 1928, although the artist Karlis Johansons had exhibited a related structure in 1921.
  
  One construction for the Schönhardt polyhedron starts with a triangular prism and twists the two equilateral triangle faces of the prism relative to each other, breaking each square face into two triangles separated by a non-convex edge. Some twist angles produce a jumping polyhedron whose two solid forms share the same face shapes. A 30° twist instead produces a shaky polyhedron, rigid but not infinitesimally rigid, whose edges form a tensegrity prism. (Full article...)
• 
  In mathematics, particularly algebraic topology and homology theory, the Mayer–Vietoris sequence is an algebraic tool to help compute algebraic invariants of topological spaces. The result is due to two Austrian mathematicians, Walther Mayer and Leopold Vietoris. The method consists of splitting a space into subspaces, for which the homology or cohomology groups may be easier to compute. The sequence relates the (co)homology groups of the space to the (co)homology groups of the subspaces. It is a natural long exact sequence, whose entries are the (co)homology groups of the whole space, the direct sum of the (co)homology groups of the subspaces, and the (co)homology groups of the intersection of the subspaces.
  
  The Mayer–Vietoris sequence holds for a variety of cohomology and homology theories, including simplicial homology and singular cohomology. In general, the sequence holds for those theories satisfying the Eilenberg–Steenrod axioms, and it has variations for both reduced and relative (co)homology. Because the (co)homology of most spaces cannot be computed directly from their definitions, one uses tools such as the Mayer–Vietoris sequence in the hope of obtaining partial information. Many spaces encountered in topology are constructed by piecing together very simple patches. Carefully choosing the two covering subspaces so that, together with their intersection, they have simpler (co)homology than that of the whole space may allow a complete deduction of the (co)homology of the space. In that respect, the Mayer–Vietoris sequence is analogous to the Seifert–van Kampen theorem for the fundamental group, and a precise relation exists for homology of dimension one. (Full article...)
• 

  

  Three of the ordinary lines in a 4 × 4 grid of points

  
  The Sylvester–Gallai theorem in geometry states that every finite set of points in the Euclidean plane has a line that passes through exactly two of the points or a line that passes through all of them. It is named after James Joseph Sylvester, who posed it as a problem in 1893, and Tibor Gallai, who published one of the first proofs of this theorem in 1944.
  
  A line that contains exactly two of a set of points is known as an ordinary line. Another way of stating the theorem is that every finite set of points that is not collinear has an ordinary line. According to a strengthening of the theorem, every finite point set (not all on one line) has at least a linear number of ordinary lines. An algorithm can find an ordinary line in a set of $n$ points in time $O(n\log n)$. (Full article...)
• 

  

  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...)
• 
  In mathematics, economics, and computer science, the Gale–Shapley algorithm (also known as the deferred acceptance algorithm, propose-and-reject algorithm, or Boston Pool algorithm) is an algorithm for finding a solution to the stable matching problem. It is named for David Gale and Lloyd Shapley, who published it in 1962, although it had been used for the National Resident Matching Program since the early 1950s. Shapley and Alvin E. Roth (who pointed out its prior application) won the 2012 Nobel Prize in Economics for work including this algorithm.
  
  The stable matching problem seeks to pair up equal numbers of participants of two types, using preferences from each participant. The pairing must be stable: no pair of participants should prefer each other to their assigned match. In each round of the Gale–Shapley algorithm, unmatched participants of one type propose a match to the next participant on their preference list. Each proposal is accepted if its recipient prefers it to their current match. The resulting procedure is a truthful mechanism from the point of view of the proposing participants, who receive their most-preferred pairing consistent with stability. In contrast, the recipients of proposals receive their least-preferred pairing. The algorithm can be implemented to run in time quadratic in the number of participants, and linear in the size of the input to the algorithm. (Full article...)
• 

  

  Six points in the unit square, with the smallest triangles (red) having area 1/8, the optimal area for this number of points. Other larger triangles are colored blue. These points are an affine transformation of a regular hexagon, but for larger numbers of points the optimal solution does not form a convex polygon.

  
  In discrete geometry and discrepancy theory, the Heilbronn triangle problem is a problem of placing points in the plane, avoiding triangles of small area. It is named after Hans Heilbronn, who conjectured that, no matter how points are placed in a given area, the smallest triangle area will be at most inversely proportional to the square of the number of points. His conjecture was proven false, but the asymptotic growth rate of the minimum triangle area remains unknown. (Full article...)
• 
  In number theory, a Wieferich prime is a prime number p such that p² divides 2^p − 1 − 1, therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides 2^p − 1 − 1. Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.
  
  Since then, connections between Wieferich primes and various other topics in mathematics have been discovered, including other types of numbers and primes, such as Mersenne and Fermat numbers, specific types of pseudoprimes and some types of numbers generalized from the original definition of a Wieferich prime. Over time, those connections discovered have extended to cover more properties of certain prime numbers as well as more general subjects such as number fields and the abc conjecture. (Full article...)
• 

  

  Fig. 1: A binary search tree of size 9 and depth 3, with 8 at the root.

  
  
  In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is linear with respect to the height of the tree.
  
  Binary search trees allow binary search for fast lookup, addition, and removal of data items. Since the nodes in a BST are laid out so that each comparison skips about half of the remaining tree, the lookup performance is proportional to that of binary logarithm. BSTs were devised in the 1960s for the problem of efficient storage of labeled data and are attributed to Conway Berners-Lee and David Wheeler. (Full article...)
• 

  

  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...)

Did you know (auto-generated) –

• ... that subgroup distortion theory, introduced by Misha Gromov in 1993, can help encode text?
• ... that people in Madagascar perform algebra on tree seeds in order to tell the future?
• ... that two members of the French parliament were killed when a delayed-action German bomb exploded in the town hall at Bapaume on 25 March 1917?
• ... that the British National Hospital Service Reserve trained volunteers to carry out first aid in the aftermath of a nuclear or chemical attack?
• ... 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 circle packings in the form of a Doyle spiral were used to model plant growth long before their mathematical investigation by Doyle?
• ... that after Florida schools banned 54 mathematics books, Chaz Stevens petitioned that they also ban the Bible?
• ... that the discovery of Descartes' theorem in geometry came from a too-difficult mathematics problem posed to a princess?

More did you know –

Did you know...

• ... that economists blame market failures on non-convexity?
• ... that, according to the pizza theorem, a circular pizza that is sliced off-center into eight equal-angled wedges can still be divided equally between two people?
• ... that the clique problem of programming a computer to find complete subgraphs in an undirected graph was first studied as a way to find groups of people who all know each other in social networks?
• ... that the Herschel graph is the smallest possible polyhedral graph that does not have a Hamiltonian cycle?
• ... that the Life without Death cellular automaton, a mathematical model of pattern formation, is a variant of Conway's Game of Life in which cells, once brought to life, never die?
• ... that one can list every positive rational number without repetition by breadth-first traversal of the Calkin–Wilf tree?
• ... that the Hadwiger conjecture implies that the external surface of any three-dimensional convex body can be illuminated by only eight light sources, but the best proven bound is that 16 lights are sufficient?

Selected article –

The region between two loxodromes on a geometric sphere. Image credit: Karthik Narayanaswami

The Riemann sphere is a way of extending the plane of complex numbers with one additional point at infinity, in a way that makes expressions such as

${\frac {1}{0}}=\infty$

well-behaved and useful, at least in certain contexts. It is named after 19th century mathematician Bernhard Riemann. It is also called the complex projective line, denoted CP¹.

On a purely algebraic level, the complex numbers with an extra infinity element constitute a number system known as the extended complex numbers. Arithmetic with infinity does not obey all of the usual rules of algebra, and so the extended complex numbers do not form a field. However, the Riemann sphere is geometrically and analytically well-behaved, even near infinity; it is a one-dimensional complex manifold, also called a Riemann surface.

In complex analysis, the Riemann sphere facilitates an elegant theory of meromorphic functions. The Riemann sphere is ubiquitous in projective geometry and algebraic geometry as a fundamental example of a complex manifold, projective space, and algebraic variety. It also finds utility in other disciplines that depend on analysis and geometry, such as quantum mechanics and other branches of physics. (Full article...)

View all selected articles

Subcategories

Algebra | Arithmetic | Analysis | Complex analysis | Applied mathematics | Calculus | Category theory | Chaos theory | Combinatorics | Dynamical systems | Fractals | Game theory | Geometry | Algebraic geometry | Graph theory | Group theory | Linear algebra | Mathematical logic | Model theory | Multi-dimensional geometry | Number theory | Numerical analysis | Optimization | Order theory | Probability and statistics | Set theory | Statistics | Topology | Algebraic topology | Trigonometry | Linear programming

---

Mathematics | History of mathematics | Mathematicians | Awards | Education | Literature | Notation | Organizations | Theorems | Proofs | Unsolved problems

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

Mathematics

Mathematics by country

Fields of mathematics

Mathematics-related lists

Mathematicians

Women in mathematics

Works about mathematics

Mathematics and art

Mathematical classification systems

Mathematical concepts

Mathematical constants

Mathematics and culture

Eponyms in mathematics

Mathematical examples

FL-Class Polyhedra articles

History of mathematics

Mathematical notation

Mathematical science occupations

Outlines of mathematics and logic

Philosophy of mathematics

Mathematical projects

Mathematical proofs

Pseudomathematics

Set index articles on mathematics

Mathematical terminology

Mathematical theorems

Mathematical tools

Mathematics stubs

Topics in mathematics

General	Foundations	Number theory	Discrete mathematics
Mathematicians History of mathematics Philosophy of mathematics Mathematical notation Mathematical beauty Mathematics education Glossary of mathematical symbols	Foundations of mathematics Mathematical logic Proof theory Gödel's incompleteness theorems Model theory Recursion theory Set theory Naive set theory Axiomatic set theory Category theory Topos theory	Number theory Algebraic number theory Analytic number theory Arithmetic Fundamental theorem of arithmetic Numbers Natural numbers Prime numbers Rational numbers Algebraic numbers	Discrete mathematics Combinatorics Combinatorial geometry Coding theory Combinatorial design Enumerative combinatorics Combinatorial optimization Graph theory Order theory Lattice theory Digital Signal Processing Theoretical computer science Computability theory Complexity theory
Algebra	Analysis	Geometry and topology	Applied mathematics
Algebra Elementary algebra Abstract algebra Group theory Ring theory Field theory Commutative algebra Geometric algebra Linear algebra Matrix theory Multilinear algebra Universal algebra Fundamental theorem of algebra	Analysis Calculus Fundamental theorem of calculus Vector calculus Geometric calculus Measure theory Real analysis Complex analysis Differential equations Ordinary differential equations Partial differential equations Integral equations Approximation theory Special functions Potential theory Harmonic analysis Fourier analysis Functional analysis Operator theory	Geometry Euclidean geometry Trigonometry Analytic geometry Non-Euclidean geometry Affine geometry Projective geometry Convex geometry Discrete geometry Algebraic geometry Differential geometry K theory Gauge theory Riemannian geometry Lie groups Topology General topology Algebraic topology Geometric topology Differential topology	Applied mathematics Mathematical modeling Mathematical physics Dynamical systems Control theory Calculus of variations Optimization Mathematical economics Game theory Mathematical finance Statistics Probability theory Stochastic processes Numerical analysis Cryptography Information theory

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

Related portals

WikiProjects

The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.

Project pages

• Participants
• Current activity
• Manual of style
• Conventions

Essays

• Advice on using Wikipedia for mathematics self-study
• Proofs

Subprojects

• PlanetMath Exchange (Talk)
• Graphics (Talk)
• Article assessment (Talk)

Related projects

Computer science | Cryptography | Game theory | Numbers | Physics | Science | Statistics

Things you can do

• Create a new article: List of requested articles
• Add a new image: Image requests
• Expand an article: Mathematics stubs
• Lend your expertise: Expert attention needed

In other Wikimedia projects

The following Wikimedia Foundation sister projects provide more on this subject:

• 

  Commons
  Free media repository

• 

  Wikibooks
  Free textbooks and manuals

• 

  Wikidata
  Free knowledge base

• 

  Wikinews
  Free-content news

• 

  Wikiquote
  Collection of quotations

• 

  Wikisource
  Free-content library

• 

  Wikiversity
  Free learning tools

• 

  Wiktionary
  Dictionary and thesaurus

More portals

Discover Wikipedia using portals

• 

  List of all portals

• 

  The arts portal

• 

  Biography portal

• 

  Current events portal

• 

  Geography portal

• 

  History portal

• 

  Mathematics portal

• 

  Science portal

• 

  Society portal

• 

  Technology portal

• 

  Random portal

• 

  WikiProject Portals