Jump to content

Portal:Mathematics

Page semi-protected
From Wikipedia, the free encyclopedia

Portal topics - (Random portal)

Activities
Culture
Geography
Health
History
Mathematics
Nature
People
Philosophy
Religion
Society
Technology
edit 

The Mathematics Portal

Shortcuts

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 are displayed here, which represent some of the best content on English Wikipedia.
More featured articles
edit 

Selected image – show another

truncated icosahedron with black pentagonal faces and white hexagonal faces, beside a similar-looking 1970s soccer ball
truncated icosahedron with black pentagonal faces and white hexagonal faces, beside a similar-looking 1970s soccer ball
Here a polyhedron called a truncated icosahedron (left) is compared to the classic Adidas Telstar–style football (or soccer ball). The familiar 32-panel ball design, consisting of 12 black pentagonal and 20 white hexagonal panels, was first introduced by the Danish manufacturer Select Sport, based loosely on the geodesic dome designs of Buckminster Fuller; it was popularized by the selection of the Adidas Telstar as the official match ball of the 1970 FIFA World Cup. The polyhedron is also the shape of the Buckminsterfullerene (or "Buckyball") carbon molecule initially predicted theoretically in the late 1960s and first generated in the laboratory in 1985. Like all polyhedra, the vertices (corner points), edges (lines between these points), and faces (flat surfaces bounded by the lines) of this solid obey the Euler characteristic, V − E + F = 2 (here, 60 − 90 + 32 = 2). The icosahedron from which this solid is obtained by truncating (or "cutting off") each vertex (replacing each by a pentagonal face), has 12 vertices, 30 edges, and 20 faces; it is one of the five regular solids, or Platonic solids—named after Plato, whose school of philosophy in ancient Greece held that the classical elements (earth, water, air, fire, and a fifth element called aether) were associated with these regular solids. The fifth element was known in Latin as the "quintessence", a hypothesized uncorruptible material (in contrast to the other four terrestrial elements) filling the heavens and responsible for celestial phenomena. That such idealized mathematical shapes as polyhedra actually occur in nature (e.g., in crystals and other molecular structures) was discovered by naturalists and physicists in the 19th and 20th centuries, largely independently of the ancient philosophies.

Good articles – load new batch

  These are Good articles, which meet a core set of high editorial standards.
  • Image 1 The graph of a function, drawn in black, and a tangent line to that graph, drawn in red. The slope of the tangent line is equal to the derivative of the function at the marked point. In mathematics, the derivative is a fundamental tool that quantifies the sensitivity to change of a function's output with respect to its input. The derivative of a function of a single variable at a chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation of the function near that input value. For this reason, the derivative is often described as the instantaneous rate of change, the ratio of the instantaneous change in the dependent variable to that of the independent variable. The process of finding a derivative is called differentiation. There are multiple different notations for differentiation. Leibniz notation, named after Gottfried Wilhelm Leibniz, is represented as the ratio of two differentials, whereas prime notation is written by adding a prime mark. Higher order notations represent repeated differentiation, and they are usually denoted in Leibniz notation by adding superscripts to the differentials, and in prime notation by adding additional prime marks. The higher order derivatives can be applied in physics; for example, while the first derivative of the position of a moving object with respect to time is the object's velocity, how the position changes as time advances, the second derivative is the object's acceleration, how the velocity changes as time advances. (Full article...)

    The graph of a function, drawn in black, and a tangent line to that graph, drawn in red. The slope of the tangent line is equal to the derivative of the function at the marked point.

    In mathematics, the derivative is a fundamental tool that quantifies the sensitivity to change of a function's output with respect to its input. The derivative of a function of a single variable at a chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation of the function near that input value. For this reason, the derivative is often described as the instantaneous rate of change, the ratio of the instantaneous change in the dependent variable to that of the independent variable. The process of finding a derivative is called differentiation.

    There are multiple different notations for differentiation. Leibniz notation, named after Gottfried Wilhelm Leibniz, is represented as the ratio of two differentials, whereas prime notation is written by adding a prime mark. Higher order notations represent repeated differentiation, and they are usually denoted in Leibniz notation by adding superscripts to the differentials, and in prime notation by adding additional prime marks. The higher order derivatives can be applied in physics; for example, while the first derivative of the position of a moving object with respect to time is the object's velocity, how the position changes as time advances, the second derivative is the object's acceleration, how the velocity changes as time advances. (Full article...)
  • Image 2 The integer number line, a set of infinitely many points with integer distances. According to the Erdős–Anning theorem, any such set lies on a line. The Erdős–Anning theorem states that, whenever an infinite number of points in the plane all have integer distances, the points lie on a straight line. The same result holds in higher dimensional Euclidean spaces. The theorem cannot be strengthened to give a finite bound on the number of points: there exist arbitrarily large finite sets of points that are not on a line and have integer distances. The theorem is named after Paul Erdős and Norman H. Anning, who published a proof of it in 1945. Erdős later supplied a simpler proof, which can also be used to check whether a point set forms an Erdős–Diophantine graph, an inextensible system of integer points with integer distances. The Erdős–Anning theorem inspired the Erdős–Ulam problem on the existence of dense point sets with rational distances. (Full article...)
    The integer number line, a set of infinitely many points with integer distances. According to the Erdős–Anning theorem, any such set lies on a line.

    The Erdős–Anning theorem states that, whenever an infinite number of points in the plane all have integer distances, the points lie on a straight line. The same result holds in higher dimensional Euclidean spaces.
    The theorem cannot be strengthened to give a finite bound on the number of points: there exist arbitrarily large finite sets of points that are not on a line and have integer distances.

    The theorem is named after Paul Erdős and Norman H. Anning, who published a proof of it in 1945. Erdős later supplied a simpler proof, which can also be used to check whether a point set forms an Erdős–Diophantine graph, an inextensible system of integer points with integer distances. The Erdős–Anning theorem inspired the Erdős–Ulam problem on the existence of dense point sets with rational distances. (Full article...)
  • Image 3 In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances. Equivalently, every homomorphism from the unit distance graph of the plane to itself must be an isometry of the plane. The theorem is named after Frank S. Beckman and Donald A. Quarles Jr., who published this result in 1953; it was later rediscovered by other authors and re-proved in multiple ways. Analogous theorems for rational subsets of Euclidean spaces, or for non-Euclidean geometry, are also known. (Full article...)
    In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances. Equivalently, every homomorphism from the unit distance graph of the plane to itself must be an isometry of the plane. The theorem is named after Frank S. Beckman and Donald A. Quarles Jr., who published this result in 1953; it was later rediscovered by other authors and re-proved in multiple ways. Analogous theorems for rational subsets of Euclidean spaces, or for non-Euclidean geometry, are also known. (Full article...)
  • Image 4 An ideal regular octahedron in the Poincaré ball model of hyperbolic space (sphere at infinity not shown). All dihedral angles of this shape are right angles. In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space. The Platonic solids and Archimedean solids have ideal versions, with the same combinatorial structure as their more familiar Euclidean versions. Several uniform hyperbolic honeycombs divide hyperbolic space into cells of these shapes, much like the familiar division of Euclidean space into cubes. However, not all polyhedra can be represented as ideal polyhedra – a polyhedron can be ideal only when it can be represented in Euclidean geometry with all its vertices on a circumscribed sphere. Using linear programming, it is possible to test whether a polyhedron has an ideal version, in polynomial time. (Full article...)

    An ideal regular octahedron in the Poincaré ball model of hyperbolic space (sphere at infinity not shown). All dihedral angles of this shape are right angles.

    In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space.

    The Platonic solids and Archimedean solids have ideal versions, with the same combinatorial structure as their more familiar Euclidean versions. Several uniform hyperbolic honeycombs divide hyperbolic space into cells of these shapes, much like the familiar division of Euclidean space into cubes. However, not all polyhedra can be represented as ideal polyhedra – a polyhedron can be ideal only when it can be represented in Euclidean geometry with all its vertices on a circumscribed sphere. Using linear programming, it is possible to test whether a polyhedron has an ideal version, in polynomial time. (Full article...)
  • Image 5 The Laves graph In geometry and crystallography, the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three equal-length segments meet at 120° angles at each point, and all cycles use ten or more segments. It is the shortest possible triply periodic graph, relative to the volume of its fundamental domain. One arrangement of the Laves graph uses one out of every eight of the points in the integer lattice as its points, and connects all pairs of these points that are nearest neighbors, at distance '"`UNIQ--postMath-00000009-QINU`"'. It can also be defined, divorced from its geometry, as an abstract undirected graph, a covering graph of the complete graph on four vertices. H. S. M. Coxeter (1955) named this graph after Fritz Laves, who first wrote about it as a crystal structure in 1932. It has also been called the K4 crystal, (10,3)-a network, diamond twin, triamond, and the srs net. The regions of space nearest each vertex of the graph are congruent 17-sided polyhedra that tile space. Its edges lie on diagonals of the regular skew polyhedron, a surface with six squares meeting at each integer point of space. (Full article...)
    The Laves graph

    In geometry and crystallography, the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three equal-length segments meet at 120° angles at each point, and all cycles use ten or more segments. It is the shortest possible triply periodic graph, relative to the volume of its fundamental domain. One arrangement of the Laves graph uses one out of every eight of the points in the integer lattice as its points, and connects all pairs of these points that are nearest neighbors, at distance . It can also be defined, divorced from its geometry, as an abstract undirected graph, a covering graph of the complete graph on four vertices.
    H. S. M. Coxeter (1955) named this graph after Fritz Laves, who first wrote about it as a crystal structure in 1932. It has also been called the K4 crystal, (10,3)-a network, diamond twin, triamond, and the srs net. The regions of space nearest each vertex of the graph are congruent 17-sided polyhedra that tile space. Its edges lie on diagonals of the regular skew polyhedron, a surface with six squares meeting at each integer point of space. (Full article...)
  • Image 6 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...)
    A Halin graph with 21 vertices
    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...)
  • Image 7 The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects. It claims that rationally we should believe in mathematical objects such as numbers because they are indispensable to scientific explanations of empirical phenomena. An altered form of the Quine–Putnam indispensability argument, it differs from that argument in its increased focus on specific explanations instead of whole theories and in its shift towards inference to the best explanation as a justification for belief in mathematical objects rather than confirmational holism. Specific explanations proposed as examples of mathematical explanations in science include why periodical cicadas have prime-numbered life cycles, why bee honeycomb has a hexagonal structure, and the solution to the Seven Bridges of Königsberg problem. Objections to the argument include the idea that mathematics is only used as a representational device, even when it features in scientific explanations; that mathematics does not need to be true to be explanatory because it could be a useful fiction; and that the argument is circular and so begs the question in favour of mathematical objects. (Full article...)
    The explanatory indispensability argument is an argument in the philosophy of mathematics for the existence of mathematical objects. It claims that rationally we should believe in mathematical objects such as numbers because they are indispensable to scientific explanations of empirical phenomena. An altered form of the Quine–Putnam indispensability argument, it differs from that argument in its increased focus on specific explanations instead of whole theories and in its shift towards inference to the best explanation as a justification for belief in mathematical objects rather than confirmational holism.

    Specific explanations proposed as examples of mathematical explanations in science include why periodical cicadas have prime-numbered life cycles, why bee honeycomb has a hexagonal structure, and the solution to the Seven Bridges of Königsberg problem. Objections to the argument include the idea that mathematics is only used as a representational device, even when it features in scientific explanations; that mathematics does not need to be true to be explanatory because it could be a useful fiction; and that the argument is circular and so begs the question in favour of mathematical objects. (Full article...)
  • Image 8 Title page of De quinque corporibus regularibus De quinque corporibus regularibus (sometimes called Libellus de quinque corporibus regularibus) is a book on the geometry of polyhedra written in the 1480s or early 1490s by Italian painter and mathematician Piero della Francesca. It is a manuscript, in the Latin language; its title means [the little book] on the five regular solids. It is one of three books known to have been written by della Francesca. Along with the Platonic solids, De quinque corporibus regularibus includes descriptions of five of the thirteen Archimedean solids, and of several other irregular polyhedra coming from architectural applications. It was the first of what would become many books connecting mathematics to art through the construction and perspective drawing of polyhedra, including Luca Pacioli's 1509 Divina proportione (which incorporated without credit an Italian translation of della Francesca's work). (Full article...)
    Title page of De quinque corporibus regularibus

    De quinque corporibus regularibus (sometimes called Libellus de quinque corporibus regularibus) is a book on the geometry of polyhedra written in the 1480s or early 1490s by Italian painter and mathematician Piero della Francesca. It is a manuscript, in the Latin language; its title means [the little book] on the five regular solids. It is one of three books known to have been written by della Francesca.

    Along with the Platonic solids, De quinque corporibus regularibus includes descriptions of five of the thirteen Archimedean solids, and of several other irregular polyhedra coming from architectural applications. It was the first of what would become many books connecting mathematics to art through the construction and perspective drawing of polyhedra, including Luca Pacioli's 1509 Divina proportione (which incorporated without credit an Italian translation of della Francesca's work). (Full article...)
  • Image 9 The 13 possible strict weak orderings on a set of three elements {a, b, c} In number theory and enumerative combinatorics, the ordered Bell numbers or Fubini numbers count the weak orderings on a set of '"`UNIQ--postMath-0000000A-QINU`"' elements. Weak orderings arrange their elements into a sequence allowing ties, such as might arise as the outcome of a horse race. The ordered Bell numbers were studied in the 19th century by Arthur Cayley and William Allen Whitworth. They are named after Eric Temple Bell, who wrote about the Bell numbers, which count the partitions of a set; the ordered Bell numbers count partitions that have been equipped with a total order. Their alternative name, the Fubini numbers, comes from a connection to Guido Fubini and Fubini's theorem on equivalent forms of multiple integrals. Because weak orderings have many names, ordered Bell numbers may also be called by those names, for instance as the numbers of preferential arrangements or the numbers of asymmetric generalized weak orders. (Full article...)
    The 13 possible strict weak orderings on a set of three elements {a, b, c}

    In number theory and enumerative combinatorics, the ordered Bell numbers or Fubini numbers count the weak orderings on a set of elements. Weak orderings arrange their elements into a sequence allowing ties, such as might arise as the outcome of a horse race.

    The ordered Bell numbers were studied in the 19th century by Arthur Cayley and William Allen Whitworth. They are named after Eric Temple Bell, who wrote about the Bell numbers, which count the partitions of a set; the ordered Bell numbers count partitions that have been equipped with a total order. Their alternative name, the Fubini numbers, comes from a connection to Guido Fubini and Fubini's theorem on equivalent forms of multiple integrals. Because weak orderings have many names, ordered Bell numbers may also be called by those names, for instance as the numbers of preferential arrangements or the numbers of asymmetric generalized weak orders. (Full article...)
  • Image 10 Measuring the width of a Reuleaux triangle as the distance between parallel supporting lines. Because this distance does not depend on the direction of the lines, the Reuleaux triangle is a curve of constant width. In geometry, a curve of constant width is a simple closed curve in the plane whose width (the distance between parallel supporting lines) is the same in all directions. The shape bounded by a curve of constant width is a body of constant width or an orbiform, the name given to these shapes by Leonhard Euler. Standard examples are the circle and the Reuleaux triangle. These curves can also be constructed using circular arcs centered at crossings of an arrangement of lines, as the involutes of certain curves, or by intersecting circles centered on a partial curve. Every body of constant width is a convex set, its boundary crossed at most twice by any line, and if the line crosses perpendicularly it does so at both crossings, separated by the width. By Barbier's theorem, the body's perimeter is exactly π times its width, but its area depends on its shape, with the Reuleaux triangle having the smallest possible area for its width and the circle the largest. Every superset of a body of constant width includes pairs of points that are farther apart than the width, and every curve of constant width includes at least six points of extreme curvature. Although the Reuleaux triangle is not smooth, curves of constant width can always be approximated arbitrarily closely by smooth curves of the same constant width. (Full article...)
    Measuring the width of a Reuleaux triangle as the distance between parallel supporting lines. Because this distance does not depend on the direction of the lines, the Reuleaux triangle is a curve of constant width.

    In geometry, a curve of constant width is a simple closed curve in the plane whose width (the distance between parallel supporting lines) is the same in all directions. The shape bounded by a curve of constant width is a body of constant width or an orbiform, the name given to these shapes by Leonhard Euler. Standard examples are the circle and the Reuleaux triangle. These curves can also be constructed using circular arcs centered at crossings of an arrangement of lines, as the involutes of certain curves, or by intersecting circles centered on a partial curve.

    Every body of constant width is a convex set, its boundary crossed at most twice by any line, and if the line crosses perpendicularly it does so at both crossings, separated by the width. By Barbier's theorem, the body's perimeter is exactly π times its width, but its area depends on its shape, with the Reuleaux triangle having the smallest possible area for its width and the circle the largest. Every superset of a body of constant width includes pairs of points that are farther apart than the width, and every curve of constant width includes at least six points of extreme curvature. Although the Reuleaux triangle is not smooth, curves of constant width can always be approximated arbitrarily closely by smooth curves of the same constant width. (Full article...)
  • Image 11 In geometry, the Dehn invariant is a value used to determine whether one polyhedron can be cut into pieces and reassembled ("dissected") into another, and whether a polyhedron or its dissections can tile space. It is named after Max Dehn, who used it to solve Hilbert's third problem by proving that certain polyhedra with equal volume cannot be dissected into each other. Two polyhedra have a dissection into polyhedral pieces that can be reassembled into either one, if and only if their volumes and Dehn invariants are equal. Having Dehn invariant zero is a necessary (but not sufficient) condition for being a space-filling polyhedron, and a polyhedron can be cut up and reassembled into a space-filling polyhedron if and only if its Dehn invariant is zero. The Dehn invariant of a self-intersection-free flexible polyhedron is invariant as it flexes. Dehn invariants are also an invariant for dissection in higher dimensions, and (with volume) a complete invariant in four dimensions. (Full article...)
    In geometry, the Dehn invariant is a value used to determine whether one polyhedron can be cut into pieces and reassembled ("dissected") into another, and whether a polyhedron or its dissections can tile space. It is named after Max Dehn, who used it to solve Hilbert's third problem by proving that certain polyhedra with equal volume cannot be dissected into each other.

    Two polyhedra have a dissection into polyhedral pieces that can be reassembled into either one, if and only if their volumes and Dehn invariants are equal. Having Dehn invariant zero is a necessary (but not sufficient) condition for being a space-filling polyhedron, and a polyhedron can be cut up and reassembled into a space-filling polyhedron if and only if its Dehn invariant is zero. The Dehn invariant of a self-intersection-free flexible polyhedron is invariant as it flexes. Dehn invariants are also an invariant for dissection in higher dimensions, and (with volume) a complete invariant in four dimensions. (Full article...)
  • Image 12 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...)
    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...)
More good articles

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

edit 

More did you know – view different entries

Did you know...
Did you know...
More did you know facts
Showing 7 items out of 75
edit 

Selected article – show another


Carl Friedrich Gauss
Image credit: C.A. Jensen (1792-1870)

Carl Friedrich Gauss (30 April 1777 – 23 February 1855) was a German mathematician and scientist of profound genius who contributed significantly to many fields, including number theory, analysis, differential geometry, geodesy, electricity, magnetism, astronomy and optics. Known as "the prince of mathematicians" and "greatest mathematician since antiquity", Gauss had a remarkable influence in many fields of mathematics and science and is ranked as one of history's most influential mathematicians.

Gauss was a child prodigy, of whom there are many anecdotes pertaining to his astounding precocity while a mere toddler, and made his first ground-breaking mathematical discoveries while still a teenager. He completed Disquisitiones Arithmeticae, his magnum opus, at the age of twenty-one (1798), though it wasn't published until 1801. This work was fundamental in consolidating number theory as a discipline and has shaped the field to the present day. (Full article...)

View all selected articles
edit 

Subcategories

Full category tree. Select [►] to view subcategories.
Mathematics
Mathematics by country
Fields of mathematics
Mathematics-related lists
Mathematicians
Women in mathematics
Works about mathematics
Mathematics and art
Bruhat family
Choquet family
Mathematical classification systems
Mathematical concepts
Mathematical constants
Mathematics and culture
Eponyms in mathematics
Mathematical examples
FL-Class Polyhedra articles
History of mathematics
Mathematics occupations
Mathematical notation
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
More mathematics categories
edit 

Topics in mathematics

General Foundations Number theory Discrete mathematics


Algebra Analysis Geometry and topology Applied mathematics
Source
edit 

Index of mathematics articles

ARTICLE INDEX:
MATHEMATICIANS:
edit 
edit 

WikiProjects

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

In other Wikimedia projects

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

More portals

Retrieved from "https://en.wikipedia.org/w/index.php?title=Portal:Mathematics&oldid=1281709757"