Portal:Mathematics

• 
  Abacus, a ancient hand-operated calculating.
• 
  Portrait of Emmy Noether, around 1900.
• 
  Euler's identity

Mathematics is a field of study that discovers and organizes methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). (Full article...)

Featured articles

• 

  

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

  

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

  

  The first 15,000 partial sums of 0 + 1 − 2 + 3 − 4 + ... The graph is situated with positive integers to the right and negative integers to the left.

  
  
  In mathematics, 1 − 2 + 3 − 4 + ··· is an infinite series whose terms are the successive positive integers, given alternating signs. Using sigma summation notation the sum of the first m terms of the series can be expressed as
  $$\sum _{n=1}^{m}n(-1)^{n-1}.$$
  
  The infinite series diverges, meaning that its sequence of partial sums, (1, −1, 2, −2, 3, ...), does not tend towards any finite limit. Nonetheless, in the mid-18th century, Leonhard Euler wrote what he admitted to be a paradoxical equation:
  $$1-2+3-4+\cdots ={\frac {1}{4}}.$$ (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...)
• 
  
  

  

  Archimedes Thoughtful by 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 considered one of the leading scientists in classical antiquity. Regarded as 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...)
• 
  In classical mechanics, the Laplace–Runge–Lenz vector (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...)
• 

  

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

  
  
  In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).
  It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,
  and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.
  
  The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)
• 

  

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

  

  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 based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific 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 that leads to 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" leading 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...)
• 
  
  

  

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

  
  Algebra is the branch of mathematics that studies certain abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations, such as addition and multiplication.
  
  Elementary algebra is the main form of algebra taught in schools. It examines mathematical statements using variables for unspecified values and seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field that investigates linear equations and combinations of them called systems of linear equations. It provides methods to find the values that solve all equations in the system at the same time, and to study the set of these solutions. (Full article...)
• 
  
  

  

  A stamp of Zhang Heng issued by China Post in 1955

  
  Zhang Heng (Chinese: 張衡; AD 78–139), formerly romanized Chang Heng, was a Chinese polymathic scientist and statesman who lived during the Eastern Han dynasty. Educated in the capital cities of Luoyang and Chang'an, he achieved success as an astronomer, mathematician, seismologist, hydraulic engineer, inventor, geographer, cartographer, ethnographer, artist, poet, philosopher, politician, and literary scholar.
  
  Zhang Heng began his career as a minor civil servant in Nanyang. Eventually, he became Chief Astronomer, Prefect of the Majors for Official Carriages, and then Palace Attendant at the imperial court. His uncompromising stance on historical and calendrical issues led to his becoming a controversial figure, preventing him from rising to the status of Grand Historian. His political rivalry with the palace eunuchs during the reign of Emperor Shun (r. 125–144) led to his decision to retire from the central court to serve as an administrator of Hejian Kingdom in present-day Hebei. Zhang returned home to Nanyang for a short time, before being recalled to serve in the capital once more in 138. He died there a year later, in 139. (Full article...)
• 
  
  

  

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

  
  Johannes Kepler (/ˈkɛplər/; German: [joˈhanəs ˈkɛplɐ, -nɛs -] ^ⓘ; 27 December 1571 – 15 November 1630) was a German astronomer, mathematician, astrologer, natural philosopher and writer on music. He is a key figure in the 17th-century Scientific Revolution, best known for his laws of planetary motion, and his books Astronomia nova, Harmonice Mundi, and Epitome Astronomiae Copernicanae, influencing among others Isaac Newton, providing one of the foundations for his theory of universal gravitation. The variety and impact of his work made Kepler one of the founders and fathers of modern astronomy, the scientific method, natural and modern science. He has been described as the "father of science fiction" for his novel Somnium.
  
  Kepler was a mathematics teacher at a seminary school in Graz, where he became an associate of Prince Hans Ulrich von Eggenberg. Later he became an assistant to the astronomer Tycho Brahe in Prague, and eventually the imperial mathematician to Emperor Rudolf II and his two successors Matthias and Ferdinand II. He also taught mathematics in Linz, and was an adviser to General Wallenstein.
  Additionally, he did fundamental work in the field of optics, being named the father of modern optics, in particular for his Astronomiae pars optica. He also invented an improved version of the refracting telescope, the Keplerian telescope, which became the foundation of the modern refracting telescope, while also improving on the telescope design by Galileo Galilei, who mentioned Kepler's discoveries in his work. (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...)
• 

  

  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...)
• 
  General relativity, also known as the general theory of relativity, and as Einstein's theory of gravity, is the geometric theory of gravitation published by Albert Einstein in 1915 and is the current description of gravitation in modern physics. General relativity generalizes special relativity and refines Newton's law of universal gravitation, providing a unified description of gravity as a geometric property of space and time, or four-dimensional spacetime. In particular, the curvature of spacetime is directly related to the energy and momentum of whatever present matter and radiation. The relation is specified by the Einstein field equations, a system of second-order partial differential equations.
  
  Newton's law of universal gravitation, which describes classical gravity, can be seen as a prediction of general relativity for the almost flat spacetime geometry around stationary mass distributions. Some predictions of general relativity, however, are beyond Newton's law of universal gravitation in classical physics. These predictions concern the passage of time, the geometry of space, the motion of bodies in free fall, and the propagation of light, and include gravitational time dilation, gravitational lensing, the gravitational redshift of light, the Shapiro time delay and singularities/black holes. So far, all tests of general relativity have been shown to be in agreement with the theory. The time-dependent solutions of general relativity enable us to talk about the history of the universe and have provided the modern framework for cosmology, thus leading to the discovery of the Big Bang and cosmic microwave background radiation. Despite the introduction of a number of alternative theories, general relativity continues to be the simplest theory consistent with experimental data. (Full article...)

Good articles

• 

  

  Graphical demonstration of the convergence of the sum 1/2 + 1/3 + 1/7 + 1/43 + ... to 1. 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. Squares with side lengths 1/1807 or smaller are too small to see in the figure and are not shown.

  
  In number theory, Sylvester's sequence is an integer sequence in which each term is the product of the previous terms, plus one. Its first few terms are
  :2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in the OEIS).
  
  Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its terms. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms. (Full article...)
• 

  

  Dyadic rationals in the interval from 0 to 1

  
  In mathematics, a dyadic rational or binary rational is a number that can be expressed as a fraction whose denominator is a power of two. For example, 1/2, 3/2, and 3/8 are dyadic rationals, but 1/3 is not. These numbers are important in computer science because they are the only ones with finite binary representations. Dyadic rationals also have applications in weights and measures, musical time signatures, and early mathematics education. They can accurately approximate any real number.
  
  The sum, difference, or product of any two dyadic rational numbers is another dyadic rational number, given by a simple formula. However, division of one dyadic rational number by another does not always produce a dyadic rational result. Mathematically, this means that the dyadic rational numbers form a ring, lying between the ring of integers and the field of rational numbers. This ring may be denoted $\mathbb {Z} [{\tfrac {1}{2}}]$. (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...)
• 
  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...)
• 

  

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

  

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

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

  

  Schwarz lantern on display in the German Museum of Technology, Berlin

  
  
  In mathematics, the Schwarz lantern is a polyhedral approximation to a cylinder, used as a pathological example of the difficulty of defining the area of a smooth (curved) surface as the limit of the areas of polyhedra. It is formed by stacked rings of isosceles triangles, arranged within each ring in the same pattern as an antiprism. The resulting shape can be folded from paper, and is named after mathematician Hermann Schwarz and for its resemblance to a cylindrical paper lantern. It is also known as Schwarz's boot, Schwarz's polyhedron, or the Chinese lantern.
  
  As Schwarz showed, for the surface area of a polyhedron to converge to the surface area of a curved surface, it is not sufficient to simply increase the number of rings and the number of isosceles triangles per ring. Depending on the relation of the number of rings to the number of triangles per ring, the area of the lantern can converge to the area of the cylinder, to a limit arbitrarily larger than the area of the cylinder, or to infinity—in other words, the area can diverge. The Schwarz lantern demonstrates that sampling a curved surface by close-together points and connecting them by small triangles is inadequate to ensure an accurate approximation of area, in contrast to the accurate approximation of arc length by inscribed polygonal chains. (Full article...)
• 

  

  The complete graph K₄ has ten matchings, corresponding to the value T(4) = 10 of the fourth telephone number.

  
  In mathematics, the telephone numbers or the involution numbers form a sequence of integers that count the ways n people can be connected by person-to-person telephone calls. These numbers also describe the number of matchings (the Hosoya index) of a complete graph on n vertices, the number of permutations on n elements that are involutions, the sum of absolute values of coefficients of the Hermite polynomials, the number of standard Young tableaux with n cells, and the sum of the degrees of the irreducible representations of the symmetric group. Involution numbers were first studied in 1800 by Heinrich August Rothe, who gave a recurrence equation by which they may be calculated, giving the values (starting from n = 0) (Full article...)
• 

  

  Example of a directed acyclic graph

  
  In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to information science (citation networks) to computation (scheduling).
  
  Directed acyclic graphs are also called acyclic directed graphs or acyclic digraphs. (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...)
• 
  In mathematics and computer science, the BIT predicate, sometimes written ${\text{BIT}}(i,j)$, is a predicate that tests whether the $j$th bit of the number $i$ (starting from the least significant digit) is 1, when $i$ is written as a binary number. Its mathematical applications include modeling the membership relation of hereditarily finite sets, and defining the adjacency relation of the Rado graph. In computer science, it is used for efficient representations of set data structures using bit vectors, in defining the private information retrieval problem from communication complexity, and in descriptive complexity theory to formulate logical descriptions of complexity classes. (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...)

Did you know

• ... that Green Day's "Wake Me Up When September Ends" became closely associated with the aftermath of Hurricane Katrina?
• ... that Catechumen, a Christian first-person shooter, was funded only in the aftermath of the Columbine High School massacre?
• ... that in 1940 Xu Ruiyun became the first Chinese woman to receive a PhD in mathematics?
• ... that subgroup distortion theory, introduced by Misha Gromov in 1993, can help encode text?
• ... that mathematician Daniel Larsen was the youngest contributor to the New York Times crossword puzzle?
• ... that the word algebra is derived from an Arabic term for the surgical treatment of bonesetting?
• ... that the British National Hospital Service Reserve trained volunteers to carry out first aid in the aftermath of a nuclear or chemical attack?
• ... that Ukrainian baritone Danylo Matviienko, who holds a master's degree in mathematics, appeared as Demetrius in Britten's opera A Midsummer Night's Dream at the Oper Frankfurt?

Did you know...

• ...that the axiom of choice is logically independent of the other axioms of Zermelo–Fraenkel set theory?
• ...that the Pythagorean Theorem generalizes to any three similar shapes on the three sides of a right-angled triangle?
• ...that the orthocenter, circumcenter, centroid and the centre of the nine-point circle all lie on one line, the Euler line?
• ...that an arbitrary quadrilateral will tessellate?
• ...that it has not been proven whether or not every even integer greater than two can be expressed as the sum of two primes?
• ...that the sum of the first n odd numbers divided by the sum of the next n odd numbers is always equal to one third?
• ...that i to the power of i, where i is the square root of -1, is a real number?

Featured pictures

• 
  Mandelbrot set, start, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 10, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Lorenz attractor at Chaos theory, by Wikimol (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 13, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 12, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Tetrahedral group at Symmetry group, by Debivort (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Lyapunov fractal, by BernardH (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 1, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Radian, by Lucas V. Barbosa (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 9, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbulb, by Ondřej Karlík (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Topological knots, by Jkasd (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Non-uniform rational B-spline, by Greg L (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 2, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Helicatenoid, by Wickerprints (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 7, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Hypotrochoid, by Sam Derbyshire (edited by Anevrisme and Perhelion) (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Breeder, by Protious/Hyperdeath (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Fields Medal, front, by Stefan Zachow (edited by King of Hearts) (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Line integral of scalar field, by Lucas V. Barbosa (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 6, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, by Simpsons contributor (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 5, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Cellular automata at Reflector (cellular automaton), by Simpsons contributor (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Missing square puzzle, by Fibonacci (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 3, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 14, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Anscombe's quartet, by Schutz (edited by Avenue) (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 11, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 4, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Desargues' theorem, by Dynablast (edited by Jujutacular and Julia W) (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Fields Medal, back, by Stefan Zachow (edited by King of Hearts) (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Mandelbrot set, step 8, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
• 
  Proof of the Pythagorean theorem, by Joaquim Alves Gaspar (from Wikipedia:Featured pictures/Sciences/Mathematics)

Get involved

For editor resources and to collaborate with other editors on improving Wikipedia's Mathematics-related articles, visit WikiProject Mathematics.

Categories

» Category:Mathematics, Category:People

Topics

» Lists of mathematics topics, Glossary of areas of mathematics, History of mathematics

Index of 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

Vital articles

» subpages: Level 4 Mathematics articles, Level 5 Mathematics articles

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