Portal:Mathematics
The Mathematics Portal
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.
Plots of logarithm functions, with three commonly used bases. The special points logb b = 1 are indicated by dotted lines, and all curves intersect in logb 1 = 0.
In mathematics, the logarithm of a number is the exponent by which another fixed value, the base, must be raised to produce that number. For example, the logarithm of 1000 to base 10 is 3, because 1000 is 10 to the 3rd power: 1000 = 103 = 10 × 10 × 10. More generally, if x = by, then y is the logarithm of x to base b, written logb x = y, so log10 1000 = 3. As a single-variable function, the logarithm to base b is the inverse of exponentiation with base b.
The logarithm base 10 is called the decimal or common logarithm and is commonly used in science and engineering. The natural logarithm has the number e ≈ 2.718 as its base; its use is widespread in mathematics and physics because of its very simple derivative. The binary logarithm uses base 2 and is widely used in computer science, information theory, music theory, and photography. When the base is unambiguous from the context or irrelevant it is often omitted, and the logarithm is written log x. (Full article...)
Georg Ferdinand Ludwig Philipp Cantor (/ˈkæntɔːr/ KAN-tor; German: [ˈɡeːɔʁk ˈfɛʁdinant ˈluːtvɪç ˈfɪ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 of which he was well aware. He also repeatedly plagiarized the work of Richard Dedekind.
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 Konstantin 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...)
Johannes Kepler (27 December 1571 – 15 November 1630) was a German polymath who was an astronomer, mathematician, astrologer, natural philosopher and music theorist. 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. The variety and impact of his work made Kepler one of the founders and fathers of modern astronomy, the scientific method, natural science, 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. (Full article...)
The Quine–Putnam indispensability argument is an argument in the philosophy of mathematics for the existence of abstract mathematical objects such as numbers and sets, a position known as mathematical Platonism. It was named after the philosophers Willard Van Orman Quine and Hilary Putnam, and is one of the most important arguments in the philosophy of mathematics.
Although elements of the indispensability argument may have originated with thinkers such as Gottlob Frege and Kurt Gödel, Quine's development of the argument was unique for introducing to it a number of his philosophical positions such as naturalism, confirmational holism, and the criterion of ontological commitment. Putnam gave Quine's argument its first detailed formulation in his 1971 book Philosophy of Logic. He later came to disagree with various aspects of Quine's thinking, however, and formulated his own indispensability argument based on the no miracles argument in the philosophy of science. A standard form of the argument in contemporary philosophy is credited to Mark Colyvan; whilst being influenced by both Quine and Putnam, it differs in important ways from their formulations. It is presented in the Stanford Encyclopedia of Philosophy: (Full article...)- Christopher Collan Morcom (13 July 1911 – 13 February 1930) was an English student mathematician, scientist and astronomer. He is known for being a childhood friend of Alan Turing, the founder of modern computer science. Morcom has been described as Turing's first love, but this affection is not known to have been reciprocated. The two bonded over mathematics and science, and their relationship is depicted in the 2014 film The Imitation Game, which contains several inaccuracies.
Morcom was born in Fockbury, Worcestershire, to a wealthy family involved in the arts and sciences; his father was an engineer and his mother, Frances Isobel Morcom, was a sculptor. He was the maternal grandson of Sir Joseph Swan, an inventor of the incandescent light bulb. Morcom was educated at King's Mead School in Seaford, East Sussex, from 1922 to 1925, and at Sherborne School in Dorset from 1925 to 1929. He excelled at Sherborne and was awarded several scholarships and prizes. In December 1929 he was awarded a scholarship at Trinity College, Cambridge, but died before he could begin his studies there. (Full article...)
Shen Kuo (Chinese: 沈括; 1031–1095) or Shen Gua, courtesy name Cunzhong (存中) and pseudonym Mengqi (now usually given as Mengxi) Weng (夢溪翁), was a Chinese polymath, scientist, and statesman of the Northern Song dynasty. Shen was a master in many fields of study including mathematics, optics, and horology. In his career as a civil servant, he became a finance minister, governmental state inspector, head official for the Bureau of Astronomy in the Song court, Assistant Minister of Imperial Hospitality, and also served as an academic chancellor. At court his political allegiance was to the Reformist faction known as the New Policies Group, headed by Chancellor Wang Anshi (1021–1085).
In his Dream Pool Essays or Dream Torrent Essays (夢溪筆談; Mengxi Bitan) of 1088, Shen was the first to describe the magnetic needle compass, which would be used for navigation (first described in Europe by Alexander Neckam in 1187). Shen discovered the concept of true north in terms of magnetic declination towards the north pole, with experimentation of suspended magnetic needles and "the improved meridian determined by Shen's [astronomical] measurement of the distance between the pole star and true north". This was the decisive step in human history to make compasses more useful for navigation, and may have been a concept unknown in Europe for another four hundred years (evidence of German sundials made circa 1450 show markings similar to Chinese geomancers' compasses in regard to declination). (Full article...)
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's work subsequently went into at least 12 other printings in Dutch, English, French and Latin. (Full article...)
An actuary is a professional with advanced mathematical skills who deals with the measurement and management of risk and uncertainty. 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. The name of the corresponding academic discipline is actuarial science.
While the concept of insurance dates to antiquity, the concepts needed to scientifically measure and mitigate risks have their origins in 17th-century studies of probability and annuities. Actuaries in the 21st century require analytical skills, business knowledge, and an understanding of human behavior and information systems; actuaries use this knowledge to design programs that manage risk, by determining if the implementation of strategies proposed for mitigating potential risks does not exceed the expected cost of those risks actualized. The steps needed to become an actuary, including education and licensing, are specific to a given country, with various additional requirements applied by regional administrative units; however, almost all processes impart universal principles of risk assessment, statistical analysis, and risk mitigation, involving rigorously structured training and examination schedules, taking many years to complete. (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...)
É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...)
Archimedes of Syracuse (/ˌɑːrkɪˈmiːdiːz/ AR-kih-MEE-deez; c. 287 – c. 212 BC) was an Ancient Greek mathematician, physicist, engineer, astronomer, and inventor from the city of Syracuse in Sicily. Although few details of his life are known, based on his surviving work, he is considered one of the leading scientists in classical antiquity, and one of the greatest mathematicians of all time. Archimedes anticipated modern calculus and analysis by applying the concept of the infinitesimals and the method of exhaustion to derive and rigorously prove many geometrical theorems, including 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. In astronomy, he made measurements of the apparent diameter of the Sun and the size of the universe. He is also said to have built a planetarium device that demonstrated the movements of the known celestial bodies, and may have been a precursor to the Antikythera mechanism. 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...)
The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group S̃3
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...)
Zhang Heng (Chinese: 張衡; AD 78 – 139), courtesy name Pingzi, 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...)
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, 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 manipulations of the Rubik's Cube form the Rubik's Cube group.
In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set. The following conditions must hold: the operation is associative, it has an identity element, and every element of the set has an inverse element. For example, the integers with the addition operation form a group.
The concept of a group was elaborated for handling, in a unified way, many mathematical structures such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. (Full article...)
.jpg)
.jpg)
Selected image –
Simpson's paradox (also known as the Yule–Simpson effect) states that an observed association between two variables can reverse when considered at separate levels of a third variable (or, conversely, that the association can reverse when separate groups are combined). Shown here is an illustration of the paradox for quantitative data. In the graph the overall association between X and Y is negative (as X increases, Y tends to decrease when all of the data is considered, as indicated by the negative slope of the dashed line); but when the blue and red points are considered separately (two levels of a third variable, color), the association between X and Y appears to be positive in each subgroup (positive slopes on the blue and red lines — note that the effect in real-world data is rarely this extreme). Named after British statistician Edward H. Simpson, who first described the paradox in 1951 (in the context of qualitative data), similar effects had been mentioned by Karl Pearson (and coauthors) in 1899, and by Udny Yule in 1903. One famous real-life instance of Simpson's paradox occurred in the UC Berkeley gender-bias case of the 1970s, in which the university was sued for gender discrimination because it had a higher admission rate for male applicants to its graduate schools than for female applicants (and the effect was statistically significant). The effect was reversed, however, when the data was split by department: most departments showed a small but significant bias in favor of women. The explanation was that women tended to apply to competitive departments with low rates of admission even among qualified applicants, whereas men tended to apply to less-competitive departments with high rates of admission among qualified applicants. (Note that splitting by department was a more appropriate way of looking at the data since it is individual departments, not the university as a whole, that admit graduate students.)
Good articles –
Partition of a directed graph into a minimum feedback arc set (red dashed edges) and a maximum acyclic subgraph (blue solid edges)
In graph theory and graph algorithms, a feedback arc set or feedback edge set in a directed graph is a subset of the edges of the graph that contains at least one edge out of every cycle in the graph. Removing these edges from the graph breaks all of the cycles, producing an acyclic subgraph of the given graph, often called a directed acyclic graph. A feedback arc set with the fewest possible edges is a minimum feedback arc set and its removal leaves a maximum acyclic subgraph; weighted versions of these optimization problems are also used. If a feedback arc set is minimal, meaning that removing any edge from it produces a subset that is not a feedback arc set, then it has an additional property: reversing all of its edges, rather than removing them, produces a directed acyclic graph.
Feedback arc sets have applications in circuit analysis, chemical engineering, deadlock resolution, ranked voting, ranking competitors in sporting events, mathematical psychology, ethology, and graph drawing. Finding minimum feedback arc sets and maximum acyclic subgraphs is NP-hard; it can be solved exactly in exponential time, or in fixed-parameter tractable time. In polynomial time, the minimum feedback arc set can be approximated to within a polylogarithmic approximation ratio, and maximum acyclic subgraphs can be approximated to within a constant factor. Both are hard to approximate closer than some constant factor, an inapproximability result that can be strengthened under the unique games conjecture. For tournament graphs, the minimum feedback arc set can be approximated more accurately, and for planar graphs both problems can be solved exactly in polynomial time. (Full article...)
Numbers written with Cistercian numerals. From left to right: 1 in units place, 2 in tens place (20), 3 in hundreds place (300), 4 in thousands place (4,000), then compound numbers 5,555, 6,789, 9,394.
The medieval Cistercian numerals, or "ciphers" in nineteenth-century parlance, were developed by the Cistercian monastic order in the early thirteenth century at about the time that Arabic numerals were introduced to northwestern Europe. They are more compact than Arabic or Roman numerals, with a single glyph able to indicate any integer from 1 to 9,999.
Digits are based on a horizontal or vertical stave, with the position of the digit on the stave indicating its place value (units, tens, hundreds or thousands). These digits are compounded on a single stave to indicate more complex numbers. The Cistercians eventually abandoned the system in favor of the Arabic numerals, but marginal use outside the order continued until the early twentieth century. (Full article...)
A polyhedron and its midsphere. A viewer situated at a polyhedron vertex would see the red circle surrounding that vertex as the horizon on the sphere.
In geometry, the midsphere or intersphere of a convex polyhedron is a sphere which is tangent to every edge of the polyhedron. Not every polyhedron has a midsphere, but the uniform polyhedra, including the regular, quasiregular and semiregular polyhedra and their duals (Catalan solids) all have midspheres. The radius of the midsphere is called the midradius. A polyhedron that has a midsphere is said to be midscribed about this sphere.
When a polyhedron has a midsphere, one can form two perpendicular circle packings on the midsphere, one corresponding to the adjacencies between vertices of the polyhedron, and the other corresponding in the same way to its polar polyhedron, which has the same midsphere. The length of each polyhedron edge is the sum of the distances from its two endpoints to their corresponding circles in this circle packing. (Full article...)
The Rado graph, as numbered by Ackermann (1937) and Rado (1964)
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with probability one) by choosing independently at random for each pair of its vertices whether to connect the vertices by an edge. The names of this graph honor Richard Rado, Paul Erdős, and Alfréd Rényi, mathematicians who studied it in the early 1960s; it appears even earlier in the work of Wilhelm Ackermann (1937). The Rado graph can also be constructed non-randomly, as a graph whose vertices are hereditarily finite sets (finite sets whose elements are hereditarily finite) with edges representing set membership, as a graph whose vertices are natural numbers and whose edges are given by the BIT predicate that uses the smaller of two numbers as an index into the binary representation of the other number, or as a graph of certain prime numbers that are connected by edges when one number is a square modulo another.
Every finite or countably infinite graph is an induced subgraph of the Rado graph, and can be found as an induced subgraph by a greedy algorithm that builds up the subgraph one vertex at a time. The Rado graph is uniquely defined, among countable graphs, by an extension property that guarantees the correctness of this algorithm: no matter which vertices have already been chosen to form part of the induced subgraph, and no matter what pattern of adjacencies is needed to extend the subgraph by one more vertex, there will always exist another vertex with that pattern of adjacencies that the greedy algorithm can choose. (Full article...)
Using the Pythagorean theorem to compute two-dimensional Euclidean distance
In mathematics, the Euclidean distance between two points in a Euclidean space is the length of the line segment between them. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem, and therefore is occasionally called the Pythagorean distance.
These names come from the ancient Greek mathematicians Euclid and Pythagoras. In the Greek deductive geometry exemplified by Euclid's Elements, distances were not represented as numbers but line segments of the same length, which were considered "equal". The notion of distance is inherent in the compass tool used to draw a circle, whose points all have the same distance from a common center point. The connection from the Pythagorean theorem to distance calculation was not made until the 18th century. (Full article...)
The red graph is the dual graph of the blue graph, and vice versa.
In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each pair of faces in G that are separated from each other by an edge, and a self-loop when the same face appears on both sides of an edge. Thus, each edge e of G has a corresponding dual edge, whose endpoints are the dual vertices corresponding to the faces on either side of e. The definition of the dual depends on the choice of embedding of the graph G, so it is a property of plane graphs (graphs that are already embedded in the plane) rather than planar graphs (graphs that may be embedded but for which the embedding is not yet known). For planar graphs generally, there may be multiple dual graphs, depending on the choice of planar embedding of the graph.
Historically, the first form of graph duality to be recognized was the association of the Platonic solids into pairs of dual polyhedra. Graph duality is a topological generalization of the geometric concepts of dual polyhedra and dual tessellations, and is in turn generalized combinatorially by the concept of a dual matroid. Variations of planar graph duality include a version of duality for directed graphs, and duality for graphs embedded onto non-planar two-dimensional surfaces. (Full article...)- In graph theory, a cop-win graph is an undirected graph on which the pursuer (cop) can always win a pursuit–evasion game against a robber, with the players taking alternating turns in which they can choose to move along an edge of a graph or stay put, until the cop lands on the robber's vertex. Finite cop-win graphs are also called dismantlable graphs or constructible graphs, because they can be dismantled by repeatedly removing a dominated vertex (one whose closed neighborhood is a subset of another vertex's neighborhood) or constructed by repeatedly adding such a vertex. The cop-win graphs can be recognized in polynomial time by a greedy algorithm that constructs a dismantling order. They include the chordal graphs, and the graphs that contain a universal vertex. (Full article...)
- Ri Jong-yol (Korean: 리정렬; born 1998) is a North Korean defector and child prodigy of mathematics. After winning silver at the 2016 International Mathematical Olympiad in Hong Kong, he made his way to the South Korean consulate general, where he took refuge for two months. Chinese authorities eventually allowed him to leave Hong Kong on a flight to Seoul. He legally changed his name to Lee Jung-ho (이정호) after receiving South Korean citizenship. (Full article...)
Five types of parallelohedron. Top: cube, hexagonal prism, rhombic dodecahedron. Bottom: elongated dodecahedron, truncated octahedron. The colors partition the edges into zones; for each zone, the faces containing edges of that color form a belt. Choosing one edge of each color produces a system of generators for each polyhedron.
In geometry, a parallelohedron or Fedorov polyhedron is a convex polyhedron that can be translated without rotations to fill Euclidean space, producing a honeycomb in which all copies of the polyhedron meet face-to-face. Evgraf Fedorov identified the five types of parallelohedron in 1885 in his studies of crystallographic systems. They are the cube, hexagonal prism, rhombic dodecahedron, elongated dodecahedron, and truncated octahedron.
Each parallelohedron is centrally symmetric with symmetric faces, making it a special case of a zonohedron. Each parallelohedron is also a stereohedron, a polyhedron that tiles space so that all tiles are symmetric. The centers of the tiles in a tiling of space by parallelohedra form a Bravais lattice, and every Bravais lattice can be formed in this way. Adjusting the lengths of parallel edges in a parallelohedron, or performing an affine transformation of the parallelohedron, results in another parallelohedron of the same combinatorial type. It is possible to choose this adjustment so that the tiling by parallelohedra is the Voronoi diagram of its Bravais lattice, and so that the resulting parallelohedra become special cases of the plesiohedra. (Full article...)
A unit cube with a hole cut through it, large enough to allow Prince Rupert's cube to pass
In geometry, Prince Rupert's cube is the largest cube that can pass through a hole cut through a unit cube without splitting it into separate pieces. Its side length is approximately 1.06, 6% larger than the side length 1 of the unit cube through which it passes. The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution.
Prince Rupert's cube is named after Prince Rupert of the Rhine, who asked whether a cube could be passed through a hole made in another cube of the same size without splitting the cube into two pieces. A positive answer was given by John Wallis. Approximately 100 years later, Pieter Nieuwland found the largest possible cube that can pass through a hole in a unit cube. (Full article...)
The convex hull of the red set is the blue and red convex set.
In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.
Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points.
The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of computational geometry. They can be solved in time for two or three dimensional point sets, and in time matching the worst-case output complexity given by the upper bound theorem in higher dimensions. (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...)
In the news
- 6 October 2026 – OpenAI bulk release of mathematical papers
- OpenAI releases 377 results on open problems in mathematics in areas such as algebra, number theory, combinatorics and theoretical computer science. (The New York Times)
Did you know (auto-generated) –
- ... that Caltech students called their calculus books "Tommy 1" and "Tommy 2"?
- ... that the father of Lithuanian scientific forestry also directed theatre, organized a school, compiled maps, and wrote a dictionary of plants, a mathematics textbook, and a collection of poetry?
- ... that Livingstone Luboobi claimed that he chose to teach himself double mathematics at A-level because there was no teacher available?
- ... that formal semantics uses logic and mathematics to study language?
- ... that people in Madagascar perform algebra on tree seeds in order to tell the future?
- ... that the symbol for equality in mathematics was not used for 61 years after its introduction, and was later popularized by Isaac Newton?
- ... that Eugene Parker described the mathematics behind his theory of solar wind as just "four lines of algebra"?
- ... that Peter Nagy based his song "Profesor Indigo" on his former math teacher?
More did you know –
- ...that the line separating the numerator and denominator of a fraction is called a solidus if written as a diagonal line or a vinculum if written as a horizontal line?
- ...that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type the complete works of William Shakespeare?
- ... that there are 115,200 solutions to the ménage problem of permuting six female-male couples at a twelve-person table so that men and women alternate and are seated away from their partners?
- ... that mathematician Paul Erdős called the Hadwiger conjecture, a still-open generalization of the four-color problem, "one of the deepest unsolved problems in graph theory"?
- ...that the six permutations of the vector (1,2,3) form a regular hexagon in 3d space, the 24 permutations of (1,2,3,4) form a truncated octahedron in four dimensions, and both are examples of permutohedra?
- ...that Ostomachion is a mathematical treatise attributed to Archimedes on a 14-piece tiling puzzle similar to tangram?
- ...that some functions can be written as an infinite sum of trigonometric polynomials and that this sum is called the Fourier series of that function?
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
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 CP1.
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.
Topics in mathematics
General
Foundations
Number theory
Discrete mathematics
Algebra
Analysis
Geometry and topology
Index of mathematics articles
| ARTICLE INDEX: | |
| MATHEMATICIANS: |
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 Essays Subprojects Related projects
|
Things you can do
|
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 -
Wikiquote
Collection of quotations -
Wikisource
Free-content library -
Wikiversity
Free learning tools -
Wiktionary
Dictionary and thesaurus
