Portal:Mathematics

The Mathematics Portal

Euclid

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.

---

• 
  
  

  

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

  

  Rejewski, c. 1932

  
  Marian Adam Rejewski (Polish: [ˈmarjan rɛˈjɛfskʲi] ; 16 August 1905 – 13 February 1980) was a Polish mathematician and cryptologist who in late 1932 reconstructed the sight-unseen German military Enigma cipher machine, aided by limited documents obtained by French military intelligence.
  
  Over the next nearly seven years, Rejewski and fellow mathematician-cryptologists Jerzy Różycki and Henryk Zygalski, working at the Polish General Staff's Cipher Bureau, developed techniques and equipment for decrypting the Enigma ciphers, even as the Germans introduced modifications to their Enigma machines and encryption procedures. Rejewski's contributions included the cryptologic card catalog and the cryptologic bomb. (Full article...)
• 
  General relativity, also known as the general theory of relativity and 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 matter and radiation are present. 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...)
• 
  
  

  

  Portrait by August Köhler, c. 1910

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

  

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

  

  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 (numbers), 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, they are 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...)
• 
  
  

  

  Archimedes Thoughtful
  by Domenico Fetti (1620)

  
  Archimedes of Syracuse (/ˌɑːrkɪˈmiːdiːz/ AR-kim-EE-deez; c. 287 – c. 212 BC) was an Ancient Greek mathematician, physicist, engineer, astronomer, and inventor from the ancient city of Syracuse in Sicily. Although few details of his life are known, he is regarded as one of the leading scientists in classical antiquity. Considered the greatest mathematician of ancient history, and one of the greatest of all time, Archimedes anticipated modern calculus and analysis by applying the concept of the infinitely small and the method of exhaustion to derive and rigorously prove a range of geometrical theorems. These include the area of a circle, the surface area and volume of a sphere, the area of an ellipse, the area under a parabola, the volume of a segment of a paraboloid of revolution, the volume of a segment of a hyperboloid of revolution, and the area of a spiral.
  
  Archimedes' other mathematical achievements include deriving an approximation of pi, defining and investigating the Archimedean spiral, and devising a system using exponentiation for expressing very large numbers. He was also one of the first to apply mathematics to physical phenomena, working on statics and hydrostatics. Archimedes' achievements in this area include a proof of the law of the lever, the widespread use of the concept of center of gravity, and the enunciation of the law of buoyancy known as Archimedes' principle. He is also credited with designing innovative machines, such as his screw pump, compound pulleys, and defensive war machines to protect his native Syracuse from invasion. (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...)
• 
  
  

  

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

  

  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 primitive lifestyle.
  
  Between 1978 and 1995, Kaczynski murdered three people and injured 23 others 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 for the abolition of industrial society. (Full article...)
• 

  

  Logic studies valid forms of inference like modus ponens.

  
  
  Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises due to the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. It examines arguments expressed in natural language while formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics.
  
  Logic studies arguments, which consist of a set of premises together with a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" to the conclusion "I don't have to work". Premises and conclusions express propositions or claims that can be true or false. An important feature of propositions is their internal structure. For example, complex propositions are made up of simpler propositions linked by logical vocabulary like $\land$ (and) or $\to$ (if...then). Simple propositions also have parts, like "Sunday" or "work" in the example. The truth of a proposition usually depends on the meanings of all of its parts. However, this is not the case for logically true propositions. They are true only because of their logical structure independent of the specific meanings of the individual parts. (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 an 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": it 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...)
• 
  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...)

Selected image –

colored ball with "hair" (representing a vector field on a sphere)

Hairy ball theorem

Credit: The Evil Midnight Uploader what Uploads at Midnight

This image illustrates a failed attempt to comb the "hair" on a ball flat, leaving a tuft sticking out at each pole. The hairy ball theorem of algebraic topology states that whenever one attempts to comb a hairy ball, there will always be at least one point on the ball at which a tuft of hair sticks out. More precisely, it states that there is no nonvanishing continuous tangent-vector field on an even-dimensional n‑sphere (an ordinary sphere in three-dimensional space is known as a "2-sphere"). This is not true of certain other three-dimensional shapes, such as a torus (doughnut shape) which can be combed flat. The theorem was first stated by Henri Poincaré in the late 19th century and proved in 1912 by L. E. J. Brouwer. If one idealizes the wind in the Earth's atmosphere as a tangent-vector field, then the hairy ball theorem implies that given any wind at all on the surface of the Earth, there must at all times be a cyclone somewhere. Note, however, that wind can move vertically in the atmosphere, so the idealized case is not meteorologically sound. (What is true is that for every "shell" of atmosphere around the Earth, there must be a point on the shell where the wind is not moving horizontally.) The theorem also has implications in computer modeling (including video game design), in which a common problem is to compute a non-zero 3-D vector that is orthogonal (i.e., perpendicular) to a given one; the hairy ball theorem implies that there is no single continuous function that accomplishes this task.

Good articles –

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

---

• 
  In order theory and model theory, branches of mathematics, Cantor's isomorphism theorem states that every two countable dense unbounded linear orders are order-isomorphic. For instance, Minkowski's question-mark function produces an isomorphism (a one-to-one order-preserving correspondence) between the numerical ordering of the rational numbers and the numerical ordering of the dyadic rationals.
  
  The theorem is named after Georg Cantor, who first published it in 1895, using it to characterize the (uncountable) ordering on the real numbers. It can be proved by a back-and-forth method that is also sometimes attributed to Cantor but was actually published later, by Felix Hausdorff. The same back-and-forth method also proves that countable dense unbounded orders are highly symmetric, and can be applied to other kinds of structures. However, Cantor's original proof only used the "going forth" half of this method. In terms of model theory, the isomorphism theorem can be expressed by saying that the first-order theory of unbounded dense linear orders is countably categorical, meaning that it has only one countable model, up to logical equivalence. (Full article...)
• 
  
  

  

  Whitehead c. 1924

  
  Alfred North Whitehead OM FRS FBA (15 February 1861 – 30 December 1947) was an English mathematician and philosopher. He created the philosophical school known as process philosophy, which has been applied in a wide variety of disciplines, including ecology, theology, education, physics, biology, economics, and psychology.
  
  In his early career Whitehead wrote primarily on mathematics, logic, and physics. He wrote the three-volume Principia Mathematica (1910–1913), with his former student Bertrand Russell. Principia Mathematica is considered one of the twentieth century's most important works in mathematical logic, and placed 23rd in a list of the top 100 English-language nonfiction books of the twentieth century by Modern Library. (Full article...)
• 
  
  

  

  Francis Amasa Walker

  
  Francis Amasa Walker (July 2, 1840 – January 5, 1897) was an American economist, statistician, journalist, educator, academic administrator, and an officer in the Union Army.
  
  Walker was born into a prominent Boston family, the son of the economist and politician Amasa Walker, and he graduated from Amherst College at the age of 20. He received a commission to join the 15th Massachusetts Infantry and quickly rose through the ranks as an assistant adjutant general. Walker fought in the Peninsula, Bristoe, Overland, and Richmond-Petersburg Campaigns before being captured by Confederate forces and held at the infamous Libby Prison. In July 1866, he was awarded the honorary grade of brevet brigadier general United States Volunteers, to rank from March 13, 1865, when he was 24 years old. (Full article...)
• 
  Fermat's Last Tango is a 2000 off-Broadway musical about the proof of Fermat's Last Theorem, written by husband and wife Joshua Rosenblum (music, lyrics) and Joanne Sydney Lessner (book, lyrics). The musical presents a fictionalized version of the real life story of Andrew Wiles, and has been praised for the accuracy of the mathematical content. The original production at the York Theatre received mixed reviews, but the musical was well received by mathematical audiences. A video of the original production has been distributed by the Clay Mathematics Institute and shown at several mathematical conferences and similar occasions. The musical has also been translated into Portuguese. (Full article...)
• 
  
  

  

  1963 statue of Anania Shirakatsi holding a globe at the entrance of the Matenadaran

  
  Anania Shirakatsi (Old Armenian: Անանիա Շիրակացի, Anania Širakac’i, anglicized: Ananias of Shirak) was a 7th-century Armenian polymath and natural philosopher, author of extant works covering mathematics, astronomy, geography, chronology, and other fields. Little is known for certain of his life outside of his own writings, but he is considered the father of the exact and natural sciences in Armenia—the first Armenian mathematician, astronomer, and cosmographer.
  
  A part of the Armenian Hellenizing School and one of the few secular scholars in medieval Armenia, Anania was educated primarily by Tychicus, in Trebizond. He composed science textbooks and the first known geographic work in classical Armenian (Ashkharhatsuyts), which provides detailed information about Greater Armenia, Persia and the Caucasus (Georgia and Caucasian Albania). (Full article...)
• 

  

  Graphical demonstration that 1 = 1/2 + 1/3 + 1/11 + 1/23 + 1/31 + 1/(2×3×11×23×31). Each row of k squares of side length 1/k has total area 1/k, and all the squares together exactly cover a larger square with area 1. The bottom row of 47058 squares with side length 1/47058 is too small to see in the figure and is not shown.

  
  In number theory, Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972, although other mathematicians had considered similar problems around the same time.
  
  The initial terms of Sylvester's sequence almost solve this problem, except that the last chosen term equals one plus the product of the others, rather than being a proper divisor. Sun (1983) showed that there is at least one solution to the (proper) Znám problem for each $k\geq 5$. Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values. (Full article...)
• 

  

  A well-covered graph, the intersection graph of the nine diagonals of a hexagon. The three red vertices form one of its 14 equal-sized maximal independent sets, and the six blue vertices form the complementary minimal vertex cover.

  
  In graph theory, a well-covered graph is an undirected graph in which the minimal vertex covers all have the same size. Here, a vertex cover is a set of vertices that touches all edges, and it is minimal if removing any vertex from it would leave some edge uncovered. Equivalently, well-covered graphs are the graphs in which all maximal independent sets have equal size. Well-covered graphs were defined and first studied by Michael D. Plummer in 1970.
  
  The well-covered graphs include all complete graphs, balanced complete bipartite graphs, and the rook's graphs whose vertices represent squares of a chessboard and edges represent moves of a chess rook. Known characterizations of the well-covered cubic graphs, well-covered claw-free graphs, and well-covered graphs of high girth allow these graphs to be recognized in polynomial time, but testing whether other kinds of graph are well-covered is a coNP-complete problem. (Full article...)
• 

  

  Natural patterns form as wind blows sand in the dunes of the Namib Desert. The crescent shaped dunes and the ripples on their surfaces repeat wherever there are suitable conditions.

  
  Patterns in nature are visible regularities of form found in the natural world. These patterns recur in different contexts and can sometimes be modelled mathematically. Natural patterns include symmetries, trees, spirals, meanders, waves, foams, tessellations, cracks and stripes. Early Greek philosophers studied pattern, with Plato, Pythagoras and Empedocles attempting to explain order in nature. The modern understanding of visible patterns developed gradually over time.
  
  In the 19th century, the Belgian physicist Joseph Plateau examined soap films, leading him to formulate the concept of a minimal surface. The German biologist and artist Ernst Haeckel painted hundreds of marine organisms to emphasise their symmetry. Scottish biologist D'Arcy Thompson pioneered the study of growth patterns in both plants and animals, showing that simple equations could explain spiral growth. In the 20th century, the British mathematician Alan Turing predicted mechanisms of morphogenesis which give rise to patterns of spots and stripes. The Hungarian biologist Aristid Lindenmayer and the French American mathematician Benoît Mandelbrot showed how the mathematics of fractals could create plant growth patterns. (Full article...)
• 

  

  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 single point of singularity. If two disjoint simple smooth closed curves evolve, they remain disjoint until one of them collapses to a point.
  The circle is the only simple closed curve that maintains its shape under the curve-shortening flow, but some curves that cross themselves or have infinite length keep their shape, including the grim reaper curve, an infinite curve that translates upwards, and spirals that rotate while remaining the same size and shape. (Full article...)
• 

  

  16 polygonalizations of a set of six points

  
  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.
  
  Every point set that does not lie on a single line has at least one polygonalization, which can be found in polynomial time. For points in convex position, there is only one, but for some other point sets there can be exponentially many. Finding an optimal polygonalization under several natural optimization criteria is a hard problem, including as a special case the travelling salesman problem. The complexity of counting all polygonalizations remains unknown. (Full article...)
• 

  

  A three-page book embedding of the complete graph K₅. Because it is not a planar graph, it is not possible to embed this graph without crossings on fewer pages, so its book thickness is three.

  
  In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings in a book, a collection of half-planes all having the same line as their boundary. Usually, the vertices of the graph are required to lie on this boundary line, called the spine, and the edges are required to stay within a single half-plane. The book thickness of a graph is the smallest possible number of half-planes for any book embedding of the graph. Book thickness is also called pagenumber, stacknumber or fixed outerthickness. Book embeddings have also been used to define several other graph invariants including the pagewidth and book crossing number.
  
  Every graph with n vertices has book thickness at most $\lceil n/2\rceil$, and this formula gives the exact book thickness for complete graphs. The graphs with book thickness one are the outerplanar graphs. The graphs with book thickness at most two are the subhamiltonian graphs, which are always planar; more generally, every planar graph has book thickness at most four. All minor-closed graph families, and in particular the graphs with bounded treewidth or bounded genus, also have bounded book thickness. It is NP-hard to determine the exact book thickness of a given graph, with or without knowing a fixed vertex ordering along the spine of the book. Testing the existence of a three-page book embedding of a graph, given a fixed ordering of the vertices along the spine of the embedding, has unknown computational complexity: it is neither known to be solvable in polynomial time nor known to be NP-hard. (Full article...)
• 

  

  A homomorphism from the flower snark J₅ into the cycle graph C₅.
  It is also a retraction onto the subgraph on the central five vertices. Thus J₅ is in fact homo­mor­phi­cally equivalent to the core C₅.

  
  In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a function between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices.
  
  Homomorphisms generalize various notions of graph colorings and allow the expression of an important class of constraint satisfaction problems, such as certain scheduling or frequency assignment problems.
  The fact that homomorphisms can be composed leads to rich algebraic structures: a preorder on graphs, a distributive lattice, and a category (one for undirected graphs and one for directed graphs).
  The computational complexity of finding a homomorphism between given graphs is prohibitive in general, but a lot is known about special cases that are solvable in polynomial time. Boundaries between tractable and intractable cases have been an active area of research. (Full article...)

Did you know (auto-generated) –

• ... that owner Matthew Benham influenced both Brentford FC in the UK and FC Midtjylland in Denmark to use mathematical modelling to recruit undervalued football players?
• ... that museum director Alena Aladava rebuilt the Belarusian national art collection in the aftermath of the Second World War?
• ... that in 1940 Xu Ruiyun became the first Chinese woman to receive a PhD in mathematics?
• ... that Catechumen, a Christian first-person shooter, was funded only in the aftermath of the Columbine High School massacre?
• ... that Donn Piatt threw his mathematics teacher out of the window?
• ... that more than 60 scientific papers authored by mathematician Paul Erdős were published posthumously?
• ... that ten-sided gaming dice have kite-shaped faces?
• ... that after Florida schools banned 54 mathematics books, Chaz Stevens petitioned that they also ban the Bible?

More did you know –

Did you know...

• ... that mathematician Paul Erdős called the Hadwiger conjecture, a still-open generalization of the four-color problem, "one of the deepest unsolved problems in graph theory"?
• ...that the six permutations of the vector (1,2,3) form a regular hexagon in 3d space, the 24 permutations of (1,2,3,4) form a truncated octahedron in four dimensions, and both are examples of permutohedra?
• ...that Ostomachion is a mathematical treatise attributed to Archimedes on a 14-piece tiling puzzle similar to tangram?
• ...that some functions can be written as an infinite sum of trigonometric polynomials and that this sum is called the Fourier series of that function?
• ...that the identity elements for arithmetic operations make use of the only two whole numbers that are neither composites nor prime numbers, 0 and 1?
• ...that as of April 2010 only 35 even numbers have been found that are not the sum of two primes which are each in a Twin Primes pair? ref
• ...the Piphilology record (memorizing digits of Pi) is 70000 as of Mar 2015?

Selected article –

Alan Turing memorial statue in Sackville Park Image credit: User:Lmno

Alan Mathison Turing, OBE (June 23, 1912 – June 7, 1954), was an English mathematician, logician, and cryptographer.

Turing is often considered to be the father of modern computer science. Turing provided an influential formalisation of the concept of the algorithm and computation with the Turing machine, formulating the now widely accepted "Turing" version of the Church–Turing thesis, namely that any practical computing model has either the equivalent or a subset of the capabilities of a Turing machine. With the Turing test, he made a significant and characteristically provocative contribution to the debate regarding artificial intelligence: whether it will ever be possible to say that a machine is conscious and can think. He later worked at the National Physical Laboratory, creating one of the first designs for a stored-program computer, although it was never actually built. In 1947 he moved to the University of Manchester to work, largely on software, on the Manchester Mark I then emerging as one of the world's earliest true computers.

During World War II, Turing worked at Bletchley Park, Britain's codebreaking centre, and was for a time head of Hut 8, the section responsible for German Naval cryptanalysis. He devised a number of techniques for breaking German ciphers, including the method of the bombe, an electromechanical machine which could find settings for the Enigma machine. (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

Works about mathematics

Mathematics and art

Mathematical classification systems

Mathematical concepts

Mathematical constants

Mathematics and culture

Eponyms in mathematics

Mathematical examples

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