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.

---

• 

  

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

  

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

  

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

  

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

  

  Portrait by Jakob Emanuel Handmann, 1753

  
  Leonhard Euler (/ˈɔɪlər/ OY-lər, German: [ˈleːɔnhaʁt ˈʔɔʏlɐ] , Swiss Standard German: [ˈleːɔnhart ˈɔʏlər]; 15 April 1707 – 18 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician, and engineer who founded the studies of graph theory and topology and made pioneering and influential discoveries in many other branches of mathematics such as analytic number theory, complex analysis, and infinitesimal calculus. He introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is also known for his work in mechanics, fluid dynamics, optics, astronomy, and music theory.
  
  Euler is held to be one of the greatest, most prolific mathematicians in history and the greatest of the 18th century. Several great mathematicians who produced their work after Euler's death have recognised his importance in the field as shown by quotes attributed to many of them: Pierre-Simon Laplace expressed Euler's influence on mathematics by stating, "Read Euler, read Euler, he is the master of us all." Carl Friedrich Gauss wrote: "The study of Euler's works will remain the best school for the different fields of mathematics, and nothing else can replace it." His 866 publications as well as his correspondences are being collected in the Opera Omnia Leonhard Euler which, when completed, will consist of 81 quartos. He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia. (Full article...)
• 

  

  The manipulations of the Rubik's Cube form the Rubik's Cube group.

  
  In mathematics, a group is a set with an operation that satisfies the following constraints: the operation is associative and 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...)
• 
  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...)
• 
  
  

  

  Damage from Hurricane Katrina in 2005. Actuaries need to estimate long-term levels of such damage in order to accurately price property insurance, set appropriate reserves, and design appropriate reinsurance and capital management strategies.

  
  An actuary is a professional with advanced mathematical skills who deals with the measurement and management of risk and uncertainty. The name of the corresponding field is actuarial science which covers rigorous mathematical calculations in areas of life expectancy and life insurance. These risks can affect both sides of the balance sheet and require asset management, liability management, and valuation skills. Actuaries provide assessments of financial security systems, with a focus on their complexity, their mathematics, and their mechanisms.
  
  While the concept of insurance dates to antiquity, the concepts needed to scientifically measure and mitigate risks have their origins in the 17th century studies of probability and annuities. Actuaries of the 21st century require analytical skills, business knowledge, and an understanding of human behavior and information systems to design and manage programs that control risk. The actual steps needed to become an actuary are usually country-specific; however, almost all processes share a rigorous schooling or examination structure and take many years to complete. (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...)
• 
  
  

  

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

  

  
  Josiah Willard Gibbs (/ɡɪbz/; February 11, 1839 – April 28, 1903) was an American scientist who made significant theoretical contributions to physics, chemistry, and mathematics. His work on the applications of thermodynamics was instrumental in transforming physical chemistry into a rigorous deductive science. Together with James Clerk Maxwell and Ludwig Boltzmann, he created statistical mechanics (a term that he coined), explaining the laws of thermodynamics as consequences of the statistical properties of ensembles of the possible states of a physical system composed of many particles. Gibbs also worked on the application of Maxwell's equations to problems in physical optics. As a mathematician, he created modern vector calculus (independently of the British scientist Oliver Heaviside, who carried out similar work during the same period) and described the Gibbs phenomenon in the theory of Fourier analysis.
  
  In 1863, Yale University awarded Gibbs the first American doctorate in engineering. After a three-year sojourn in Europe, Gibbs spent the rest of his career at Yale, where he was a professor of mathematical physics from 1871 until his death in 1903. Working in relative isolation, he became the earliest theoretical scientist in the United States to earn an international reputation and was praised by Albert Einstein as "the greatest mind in American history." In 1901, Gibbs received what was then considered the highest honor awarded by the international scientific community, the Copley Medal of the Royal Society of London, "for his contributions to mathematical physics." (Full article...)
• 
  
  

  

  Cantor, c. 1910

  
  Georg Ferdinand Ludwig Philipp Cantor (/ˈkæntɔːr/ KAN-tor, German: [ˈɡeːɔʁk ˈfɛʁdinant ˈluːtvɪç ˈfiːlɪp ˈkantoːɐ̯]; 3 March [O.S. 19 February] 1845 – 6 January 1918) was a mathematician who played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between the members of two sets, defined infinite and well-ordered sets, and proved that the real numbers are more numerous than the natural numbers. Cantor's method of proof of this theorem implies the existence of an infinity of infinities. He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact he was well aware of.
  
  Originally, Cantor's theory of transfinite numbers was regarded as counter-intuitive – even shocking. This caused it to encounter resistance from mathematical contemporaries such as Leopold Kronecker and Henri Poincaré and later from Hermann Weyl and L. E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections; see Controversy over Cantor's theory. Cantor, a devout Lutheran Christian, believed the theory had been communicated to him by God. Some Christian theologians (particularly neo-Scholastics) saw Cantor's work as a challenge to the uniqueness of the absolute infinity in the nature of God – on one occasion equating the theory of transfinite numbers with pantheism – a proposition that Cantor vigorously rejected. Not all theologians were against Cantor's theory; prominent neo-scholastic philosopher Constantin Gutberlet was in favor of it and Cardinal Johann Baptist Franzelin accepted it as a valid theory (after Cantor made some important clarifications). (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...)

Selected image –

illustration of a closed loop (a circle) and progressively more knotted loops

Knot theory

Credit: Jkasd

This is a chart of all prime knots having seven or fewer crossings (not including mirror images) along with the unknot (or "trivial knot"), a closed loop that is not a prime knot. The knots are labeled with Alexander-Briggs notation. Many of these knots have special names, including the trefoil knot (3₁) and figure-eight knot (4₁). Knot theory is the study of knots viewed as different possible embeddings of a 1-sphere (a circle) in three-dimensional Euclidean space (R³). These mathematical objects are inspired by real-world knots, such as knotted ropes or shoelaces, but don't have any free ends and so cannot be untied. (Two other closely related mathematical objects are braids, which can have loose ends, and links, in which two or more knots may be intertwined.) One way of distinguishing one knot from another is by the number of times its two-dimensional depiction crosses itself, leading to the numbering shown in the diagram above. The prime knots play a role very similar to prime numbers in number theory; in particular, any given (non-trivial) knot can be uniquely expressed as a "sum" of prime knots (a series of prime knots spliced together) or is itself prime. Early knot theory enjoyed a brief period of popularity among physicists in the late 19th century after William Thomson suggested that atoms are knots in the luminiferous aether. This led to the first serious attempts to catalog all possible knots (which, along with links, now number in the billions). In the early 20th century, knot theory was recognized as a subdiscipline within geometric topology. Scientific interest was resurrected in the latter half of the 20th century by the need to understand knotting problems in organic chemistry, including the behavior of DNA, and the recognition of connections between knot theory and quantum field theory.

Good articles –

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

---

• 
  
  

  

  8x8 Rook's graph

  
  In graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's graph represents a square on a chessboard, and there is an edge between any two squares sharing a row (rank) or column (file), the squares that a rook can move between. These graphs can be constructed for chessboards of any rectangular shape. Although rook's graphs have only minor significance in chess lore, they are more important in the abstract mathematics of graphs through their alternative constructions: rook's graphs are the Cartesian product of two complete graphs, and are the line graphs of complete bipartite graphs. The square rook's graphs constitute the two-dimensional Hamming graphs.
  
  Rook's graphs are highly symmetric, having symmetries taking every vertex to every other vertex. In rook's graphs defined from square chessboards, more strongly, every two edges are symmetric, and every pair of vertices is symmetric to every other pair at the same distance in moves (making the graph distance-transitive). For rectangular chessboards whose width and height are relatively prime, the rook's graphs are circulant graphs. With one exception, the rook's graphs can be distinguished from all other graphs using only two properties: the numbers of triangles each edge belongs to, and the existence of a unique 4-cycle connecting each nonadjacent pair of vertices. (Full article...)
• 

  

  A 1-forest (a maximal pseudoforest), formed by three 1-trees

  
  In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.
  
  The names are justified by analogy to the more commonly studied trees and forests. (A tree is a connected graph with no cycles; a forest is a disjoint union of trees.) Gabow and Tarjan attribute the study of pseudoforests to Dantzig's 1963 book on linear programming, in which pseudoforests arise in the solution of certain network flow problems. Pseudoforests also form graph-theoretic models of functions and occur in several algorithmic problems. Pseudoforests are sparse graphs – their number of edges is linearly bounded in terms of their number of vertices (in fact, they have at most as many edges as they have vertices) – and their matroid structure allows several other families of sparse graphs to be decomposed as unions of forests and pseudoforests. The name "pseudoforest" comes from Picard & Queyranne (1982). (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...)
• 

  

  
  Jessen's icosahedron, sometimes called Jessen's orthogonal icosahedron, is a non-convex polyhedron with the same numbers of vertices, edges, and faces as the regular icosahedron. It is named for Børge Jessen, who studied it in 1967. In 1971, a family of nonconvex polyhedra including this shape was independently discovered and studied by Adrien Douady under the name six-beaked shaddock; later authors have applied variants of this name more specifically to Jessen's icosahedron.
  
  The faces of Jessen's icosahedron meet only in right angles, even though it has no orientation where they are all parallel to the coordinate planes. It is a "shaky polyhedron", meaning that (like a flexible polyhedron) it is not infinitesimally rigid. Outlining the edges of this polyhedron with struts and cables produces a widely-used tensegrity structure, also called the six-bar tensegrity, tensegrity icosahedron, or expanded octahedron. (Full article...)
• 
  Vedic Mathematics is a book written by Indian Shankaracharya Bharati Krishna Tirtha and first published in 1965. It contains a list of mathematical techniques which were falsely claimed to contain advanced mathematical knowledge. The book was posthumously published under its deceptive title by editor V. S. Agrawala, who noted in the foreword that the claim of Vedic origin, made by the original author and implied by the title, was unsupported.
  
  Neither Krishna Tirtha nor Agrawala were able to produce sources, and scholars unanimously note it to be a compendium of methods for increasing the speed of elementary mathematical calculations sharing no overlap with historical mathematical developments during the Vedic period. Nonetheless, there has been a proliferation of publications in this area and multiple attempts to integrate the subject into mainstream education at the state level by right-wing Hindu nationalist governments. (Full article...)
• 
  
  

  

  Ross in 1970

  
  Arnold Ephraim Ross (August 24, 1906 – September 25, 2002) was a mathematician and educator who founded the Ross Mathematics Program, a number theory summer program for gifted high school students. He was born in Chicago, but spent his youth in Odesa, Ukraine, where he studied with Samuil Shatunovsky. Ross returned to Chicago and enrolled in University of Chicago graduate coursework under E. H. Moore, despite his lack of formal academic training. He received his Ph.D. and married his wife, Bee, in 1931.
  
  Ross taught at several institutions including St. Louis University before becoming chair of University of Notre Dame's mathematics department in 1946. He started a teacher training program in mathematics that evolved into the Ross Mathematics Program in 1957 with the addition of high school students. The program moved with him to Ohio State University when he became their department chair in 1963. Though forced to retire in 1976, Ross ran the summer program until 2000. He had worked with over 2,000 students during more than forty summers. (Full article...)
• 
  Paterson's worms are a family of cellular automata devised in 1971 by Mike Paterson and John Horton Conway to model the behaviour and feeding patterns of certain prehistoric worms. In the model, a worm moves between points on a triangular grid along line segments, representing food. Its turnings are determined by the configuration of eaten and uneaten line segments adjacent to the point at which the worm currently is. Despite being governed by simple rules the behaviour of the worms can be extremely complex, and the ultimate fate of one variant is still unknown.
  
  The worms were studied in the early 1970s by Paterson, Conway and Michael Beeler, described by Beeler in June 1973, and presented in November 1973 in Martin Gardner's "Mathematical Games" column in Scientific American. (Full article...)
• 
  Ronald Paul "Ron" Fedkiw (born February 27, 1968) is a full professor in the Stanford University department of computer science and a leading researcher in the field of computer graphics, focusing on topics relating to physically based simulation of natural phenomena and machine learning. His techniques have been employed in many motion pictures. He has earned recognition at the 80th Academy Awards and the 87th Academy Awards as well as from the National Academy of Sciences.
  
  His first Academy Award was awarded for developing techniques that enabled many technically sophisticated adaptations including the visual effects in 21st century movies in the Star Wars, Harry Potter, Terminator, and Pirates of the Caribbean franchises. Fedkiw has designed a platform that has been used to create many of the movie world's most advanced special effects since it was first used on the T-X character in Terminator 3: Rise of the Machines. His second Academy Award was awarded for computer graphics techniques for special effects for large scale destruction. Although he has won an Oscar for his work, he does not design the visual effects that use his technique. Instead, he has developed a system that other award-winning technicians and engineers have used to create visual effects for some of the world's most expensive and highest-grossing movies. (Full article...)
• 
  The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer $n$ that is 2 or more, there exist positive integers $x$, $y$, and $z$ for which $${\frac {4}{n}}={\frac {1}{x}}+{\frac {1}{y}}+{\frac {1}{z}}.$$
  In other words, the number $4/n$ can be written as a sum of three positive unit fractions.
  
  The conjecture is named after Paul Erdős and Ernst G. Straus, who formulated it in 1948, but it is connected to much more ancient mathematics; sums of unit fractions, like the one in this problem, are known as Egyptian fractions, because of their use in ancient Egyptian mathematics. The Erdős–Straus conjecture is one of many conjectures by Erdős, and one of many unsolved problems in mathematics concerning Diophantine equations. (Full article...)
• 
  
  

  

  Equilateral form of the Cairo tiling

  
  In geometry, a Cairo pentagonal tiling is a tessellation of the Euclidean plane by congruent convex pentagons, formed by overlaying two tessellations of the plane by hexagons and named for its use as a paving design in Cairo. It is also called MacMahon's net after Percy Alexander MacMahon, who depicted it in his 1921 publication New Mathematical Pastimes. John Horton Conway called it a 4-fold pentille.
  
  Infinitely many different pentagons can form this pattern, belonging to two of the 15 families of convex pentagons that can tile the plane. Their tilings have varying symmetries; all are face-symmetric. One particular form of the tiling, dual to the snub square tiling, has tiles with the minimum possible perimeter among all pentagonal tilings. Another, overlaying two flattened tilings by regular hexagons, is the form used in Cairo and has the property that every edge is collinear with infinitely many other edges. (Full article...)
• 
  In mathematics, the factorial of a non-negative integer $n$, denoted by $n!$, is the product of all positive integers less than or equal to $n$. The factorial of $n$ also equals the product of $n$ with the next smaller factorial:
  $$<br>{\begin{aligned}n!&=n\times (n-1)\times (n-2)\times (n-3)\times \cdots \times 3\times 2\times 1\\<br>&=n\times (n-1)!\\<br>\end{aligned}}$$
  For example,
  $$5!=5\times 4!=5\times 4\times 3\times 2\times 1=120.$$
  The value of 0! is 1, according to the convention for an empty product.
  
  Factorials have been discovered in several ancient cultures, notably in Indian mathematics in the canonical works of Jain literature, and by Jewish mystics in the Talmudic book Sefer Yetzirah. The factorial operation is encountered in many areas of mathematics, notably in combinatorics, where its most basic use counts the possible distinct sequences – the permutations – of $n$ distinct objects: there are $n!$. In mathematical analysis, factorials are used in power series for the exponential function and other functions, and they also have applications in algebra, number theory, probability theory, and computer science. (Full article...)
• 

  

  A Halin graph

  
  In graph theory, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle.
  The tree must have at least four vertices, none of which has exactly two neighbors; it should be drawn in the plane so none of its edges cross (this is called a planar embedding), and the cycle
  connects the leaves in their clockwise ordering in this embedding. Thus, the cycle forms the outer face of the Halin graph, with the tree inside it.
  
  Halin graphs are named after German mathematician Rudolf Halin, who studied them in 1971.
  The cubic Halin graphs – the ones in which each vertex touches exactly three edges – had already been studied over a century earlier by Kirkman.
  Halin graphs are polyhedral graphs, meaning that every Halin graph can be used to form the vertices and edges of a convex polyhedron, and the polyhedra formed from them have been called roofless polyhedra or domes. (Full article...)

Did you know (auto-generated) –

• ... that despite a mathematical model deeming the ice cream bar flavour Goody Goody Gum Drops impossible, it was still created?
• ... that more than 60 scientific papers authored by mathematician Paul Erdős were published posthumously?
• ... that a folded paper lantern shows that certain mathematical definitions of surface area are incorrect?
• ... 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 museum director Alena Aladava rebuilt the Belarusian national art collection in the aftermath of the Second World War?
• ... that the mathematical infinity symbol ∞ may be derived from the Roman numerals for 1000 or for 100 million?
• ... that Catechumen, a Christian first-person shooter, was funded only in the aftermath of the Columbine High School massacre?
• ... that The Math Myth advocates for American high schools to stop requiring advanced algebra?

More did you know –

Did you know...

• ... 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?
• ... that an equitable coloring of a graph, in which the numbers of vertices of each color are as nearly equal as possible, may require far more colors than a graph coloring without this constraint?
• ... that no matter how biased a coin one uses, flipping a coin to determine whether each edge is present or absent in a countably infinite graph will always produce the same graph, the Rado graph?
• ...that it is possible to stack identical dominoes off the edge of a table to create an arbitrarily large overhang?
• ...that in Floyd's algorithm for cycle detection, the tortoise and hare move at very different speeds, but always finish at the same spot?
• ...that in graph theory, a pseudoforest can contain trees and pseudotrees, but cannot contain any butterflies, diamonds, handcuffs, or bicycles?

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

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