Portal talk:Mathematics/Archive2020

This is an archive of past discussions about Portal:Mathematics. Do not edit the contents of this page. If you wish to start a new discussion or revive an old one, please do so on the current talk page.

2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022

Duplicate "Did you know"

Number 34 and Number 43 in “Did you know” of Mathematics Portal are the same. — Preceding unsigned comment added by AshrithSagar (talk • contribs) 08:22, 5 June 2020 (UTC)

I have replaced #43. - dcljr (talk) 09:42, 7 June 2020 (UTC)

WP:RECOG discussion

dcljr, what do you think about automating the "Selected article" section using {{Transclude list item excerpts as random slideshow}}? This can be done after JL-Bot populates the section #Recognized content above. For an example of how it works, see Portal:Sports and its list of articles populated by the bot. —⁠andrybak (talk) 18:14, 8 June 2020 (UTC)

Have not had a chance to look into this. Hang on… - dcljr (talk) 07:22, 10 June 2020 (UTC)

Dcljr, JL-Bot has updated the section above. 48 featured and good articles in total. Perhaps, more templates and categories could be added to the current list, which I made from Wikipedia:WikiProject_Council/Directory/Science#Mathematics. —⁠andrybak (talk) 16:38, 18 June 2020 (UTC)

The bot output has been moved to Portal:Mathematics/Recognized content. —⁠andrybak (talk) 15:12, 5 November 2020 (UTC)

Here's a demo of how this would look like:

Image 1
A unit distance graph with 16 vertices and 40 edges

In mathematics, particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points whenever the distance between them is exactly one. To distinguish these graphs from a broader definition that allows some non-adjacent pairs of vertices to be at distance one, they may also be called strict unit distance graphs or faithful unit distance graphs. As a hereditary family of graphs, they can be characterized by forbidden induced subgraphs. The unit distance graphs include the cactus graphs, the matchstick graphs and penny graphs, and the hypercube graphs. The generalized Petersen graphs are non-strict unit distance graphs.

An unsolved problem of Paul Erdős asks how many edges a unit distance graph on $n$ vertices can have. The best known lower bound is slightly above linear in $n$ —far from the upper bound, proportional to $n^{4/3}$ . The number of colors required to color unit distance graphs is also unknown (the Hadwiger–Nelson problem): some unit distance graphs require five colors, and every unit distance graph can be colored with seven colors. For every algebraic number there is a unit distance graph with two vertices that must be that distance apart. According to the Beckman–Quarles theorem, the only plane transformations that preserve all unit distance graphs are the isometries. (Full article...)
Image 2
Mathematics in art: Albrecht Dürer's copper plate engraving Melencolia I, 1514. Mathematical references include a compass for geometry, a magic square and a truncated rhombohedron, while measurement is indicated by the scales and hourglass.

Mathematics and art are related in a variety of ways. Mathematics has itself been described as an art motivated by beauty. Mathematics can be discerned in arts such as music, dance, painting, architecture, sculpture, and textiles. This article focuses, however, on mathematics in the visual arts.

Mathematics and art have a long historical relationship. Artists have used mathematics since the 4th century BC when the Greek sculptor Polykleitos wrote his Canon, prescribing proportions conjectured to have been based on the ratio 1:√2 for the ideal male nude. Persistent popular claims have been made for the use of the golden ratio in ancient art and architecture, without reliable evidence. In the Italian Renaissance, Luca Pacioli wrote the influential treatise De divina proportione (1509), illustrated with woodcuts by Leonardo da Vinci, on the use of the golden ratio in art. Another Italian painter, Piero della Francesca, developed Euclid's ideas on perspective in treatises such as De Prospectiva Pingendi, and in his paintings. The engraver Albrecht Dürer made many references to mathematics in his work Melencolia I. In modern times, the graphic artist M. C. Escher made intensive use of tessellation and hyperbolic geometry, with the help of the mathematician H. S. M. Coxeter, while the De Stijl movement led by Theo van Doesburg and Piet Mondrian explicitly embraced geometrical forms. Mathematics has inspired textile arts such as quilting, knitting, cross-stitch, crochet, embroidery, weaving, Turkish and other carpet-making, as well as kilim. In Islamic art, symmetries are evident in forms as varied as Persian girih and Moroccan zellige tilework, Mughal jali pierced stone screens, and widespread muqarnas vaulting. (Full article...)
Image 3
An $m \times n$ matrix: the $m$ rows are horizontal and the $n$ columns are vertical. Each element of a matrix is often denoted by a variable with two subscripts. For example, $a 2,1$ represents the element at the second row and first column of the matrix.

In mathematics, a matrix (pl.: matrices) is a rectangular array or table of numbers, symbols, or expressions, with elements or entries arranged in rows and columns, which is used to represent a mathematical object or property of such an object.

For example,
${\begin{bmatrix}1&9&-13\\20&5&-6\end{bmatrix}}$
is a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a "⁠ $2\times 3$ ⁠ matrix", or a matrix of dimension ⁠ $2\times 3$ ⁠. (Full article...)
Image 4
Four opaque sets for a unit square. Upper left: its boundary, length 4. Upper right: Three sides, length 3. Lower left: a Steiner tree of the vertices, length $1+{\sqrt {3}}\approx 2.732$ . Lower right: the conjectured optimal solution, length ${\sqrt {2}}+{\tfrac {1}{2}}{\sqrt {6}}\approx 2.639$ .

In discrete geometry, an opaque set is a system of curves or other set in the plane that blocks all lines of sight across a polygon, circle, or other shape. Opaque sets have also been called barriers, beam detectors, opaque covers, or (in cases where they have the form of a forest of line segments or other curves) opaque forests. Opaque sets were introduced by Stefan Mazurkiewicz in 1916, and the problem of minimizing their total length was posed by Frederick Bagemihl in 1959.

For instance, visibility through a unit square can be blocked by its four boundary edges, with length 4, but a shorter opaque forest blocks visibility across the square with length ${\sqrt {2}}+{\tfrac {1}{2}}{\sqrt {6}}\approx 2.639$ . It is unproven whether this is the shortest possible opaque set for the square, and for most other shapes this problem similarly remains unsolved. The shortest opaque set for any bounded convex set in the plane has length at most the perimeter of the set, and at least half the perimeter. For the square, a slightly stronger lower bound than half the perimeter is known. Another convex set whose opaque sets are commonly studied is the unit circle, for which the shortest connected opaque set has length $2+\pi$ . Without the assumption of connectivity, the shortest opaque set for the circle has length at least $\pi$ and at most $4.7998$ . (Full article...)
Image 5
The Metallic Metals Act was a fictional piece of legislation included in a 1947 American opinion survey conducted by Sam Gill and published in the March 14, 1947, issue of Tide magazine. When given four possible replies, 70% of respondents claimed to have an opinion on the act. It has become a classic example of the risks of meaningless responses to closed-ended questions and prompted the study of the pseudo-opinion phenomenon. (Full article...)
Image 6
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 7
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...)
Image 8
A Garden of Eden in Conway's Game of Life, discovered by R. Banks in 1971. The cells outside the image are all dead (white).

In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise in any other way.
John Tukey named these configurations after the Garden of Eden in Abrahamic religions, which was created out of nowhere.

A Garden of Eden is determined by the state of every cell in the automaton (usually a one- or two-dimensional infinite square lattice of cells). However, for any Garden of Eden there is a finite pattern (a subset of cells and their states, called an orphan) with the same property of having no predecessor, no matter how the remaining cells are filled in.
A configuration of the whole automaton is a Garden of Eden if and only if it contains an orphan.
For one-dimensional cellular automata, orphans and Gardens of Eden can be found by an efficient algorithm, but for higher dimensions this is an undecidable problem. Nevertheless, computer searches have succeeded in finding these patterns in Conway's Game of Life. (Full article...)
Image 9
Diagram of the three utilities problem on a plane. All lines are connected, but two of them are crossing.

The three utilities problem, also known as water, gas and electricity, is a mathematical puzzle that asks for non-crossing connections to be drawn between three houses and three utility companies on a plane. When posing it in the early 20th century, Henry Dudeney wrote that it was already an old problem. It is an impossible puzzle: it is not possible to connect all nine lines without any of them crossing. Versions of the problem on nonplanar surfaces such as a torus or Möbius strip, or that allow connections to pass through other houses or utilities, can be solved.

This puzzle can be formalized as a problem in topological graph theory by asking whether the complete bipartite graph $K_{3,3}$ , with vertices representing the houses and utilities and edges representing their connections, has a graph embedding in the plane. The impossibility of the puzzle corresponds to the fact that $K_{3,3}$ is not a planar graph. Multiple proofs of this impossibility are known, and form part of the proof of Kuratowski's theorem characterizing planar graphs by two forbidden subgraphs, one of which is $K_{3,3}$ . The question of minimizing the number of crossings in drawings of complete bipartite graphs is known as Turán's brick factory problem, and for $K_{3,3}$ the minimum number of crossings is one. (Full article...)
Image 10

Lasker in 1929

Emanuel Lasker (German pronunciation: [eˈmaːnuɛl ˈlaskɐ] ; December 24, 1868 – January 11, 1941) was a German chess player, mathematician, and philosopher. He was the second World Chess Champion, holding the title for 27 years, from 1894 to 1921, the longest reign of any officially recognised World Chess Champion, winning 6 World Chess Championships. In his prime, Lasker was one of the most dominant champions.

His contemporaries used to say that Lasker used a "psychological" approach to the game, and even that he sometimes deliberately played inferior moves to confuse opponents. Recent analysis, however, indicates that he was ahead of his time and used a more flexible approach than his contemporaries, which mystified many of them. Lasker knew contemporary analyses of openings well but disagreed with many of them. He published chess magazines and five chess books, but later players and commentators found it difficult to draw lessons from his methods. (Full article...)
Image 11
Graph of the equation $y = 1/ x$ . Here, $e$ is the unique number larger than 1 that makes the shaded area under the curve equal to 1.

The number $e$ is a mathematical constant approximately equal to 2.71828 that is the base of the natural logarithm and exponential function. It is sometimes called Euler's number, after the Swiss mathematician Leonhard Euler, though this can invite confusion with Euler numbers, or with Euler's constant, a different constant typically denoted $\gamma$ . Alternatively, $e$ can be called Napier's constant after John Napier. The Swiss mathematician Jacob Bernoulli discovered the constant while studying compound interest.

The number $e$ is of great importance in mathematics, alongside 0, 1, $π$ , and $i$ . All five appear in one formulation of Euler's identity $e^{i\pi }+1=0$ and play important and recurring roles across mathematics. Like the constant $π$ , $e$ is irrational, meaning that it cannot be represented as a ratio of integers, and moreover it is transcendental, meaning that it is not a root of any non-zero polynomial with rational coefficients. To 30 decimal places, the value of $e$ is: (Full article...)
Image 12
Two right triangles with the two legs of the top one equal to the leg and hypotenuse of the bottom one. For these lengths, $a^{2}$ , $b^{2}$ , and $c^{2}$ form an arithmetic progression separated by a gap of $d^{2}$ . It is not possible for all four lengths $a$ , $b$ , $c$ , and $d$ to be integers.

Fermat's right triangle theorem is a non-existence proof in number theory, published in 1670 among the works of Pierre de Fermat, soon after his death. It is the only complete proof given by Fermat. It has many equivalent formulations, one of which was stated (but not proved) in 1225 by Fibonacci. In its geometric forms, it states:
- A right triangle in the Euclidean plane for which all three side lengths are rational numbers cannot have an area that is the square of a rational number. The area of a rational-sided right triangle is called a congruent number, so no congruent number can be square.
- A right triangle and a square with equal areas cannot have all sides commensurate with each other.
- There do not exist two integer-sided right triangles in which the two legs of one triangle are the leg and hypotenuse of the other triangle.
More abstractly, as a result about Diophantine equations (integer or rational-number solutions to polynomial equations), it is equivalent to the statements that:
- If three square numbers form an arithmetic progression, then the gap between consecutive numbers in the progression (called a congruum) cannot itself be square.
- The only rational points on the elliptic curve $y^{2}=x(x-1)(x+1)$ are the three trivial points with $x\in \{-1,0,1\}$ and $y=0$ .
- The quartic equation $x^{4}-y^{4}=z^{2}$ has no nonzero integer solution.
An immediate consequence of the last of these formulations is that Fermat's Last Theorem is true in the special case that its exponent is 4. (Full article...)
Image 13
A depiction of how site isolation separated different websites into different processes

Site isolation is a web browser security feature that groups websites into sandboxed processes by their associated origins. This technique enables the process sandbox to block cross-origin bypasses that would otherwise be exposed by exploitable vulnerabilities in the sandboxed process.

The feature was first proposed publicly by Charles Reis and others, although Microsoft was independently working on implementation in the Gazelle research browser at the same time. The approach initially failed to gain traction due to the large engineering effort required to implement it in a fully featured browser, and concerns around the real-world performance impact of potentially unbounded process use. In 2018, following the discovery of the Spectre and Meltdown vulnerabilities to the public, Google accelerated the work, culminating in a 2019 release of the feature. In 2021, Firefox also launched their own version of site isolation which they had been working on under the codename Project Fission. (Full article...)
Image 14
The Euclid–Euler theorem is a theorem in number theory that relates perfect numbers to Mersenne primes. It states that an even number is perfect if and only if it has the form $2 p -1 (2 p - 1)$ , where $2 p - 1$ is a prime number. The theorem is named after mathematicians Euclid and Leonhard Euler, who respectively proved the "if" and "only if" aspects of the theorem.

It has been conjectured that there are infinitely many Mersenne primes. Although the truth of this conjecture remains unknown, it is equivalent, by the Euclid–Euler theorem, to the conjecture that there are infinitely many even perfect numbers. However, it is also unknown whether there exists even a single odd perfect number. (Full article...)
Image 15
A double bubble. Note that the surface separating the small lower bubble from the large bubble bulges into the large bubble.

In the mathematical theory of minimal surfaces, the double bubble theorem states that the shape that encloses and separates two given volumes and has the minimum possible surface area is a standard double bubble: three spherical surfaces meeting at angles of 120° on a common circle. The double bubble theorem was formulated and thought to be true in the 19th century, and became a "serious focus of research" by 1989, but was not proven until 2002.

The proof combines multiple ingredients. Compactness of rectifiable currents (a generalized definition of surfaces) shows that a solution exists. A symmetry argument proves that the solution must be a surface of revolution, and it can be further restricted to having a bounded number of smooth pieces. Jean Taylor's proof of Plateau's laws describes how these pieces must be shaped and connected to each other, and a final case analysis shows that, among surfaces of revolution connected in this way, only the standard double bubble has locally-minimal area. (Full article...)

—⁠andrybak (talk) 15:14, 5 November 2020 (UTC)

Unfinished selected pictures

dcljr, please see the added captions:

If that's enough, I'll remove the disclaimer and add these pictures to the rotation on the portal's page. —⁠andrybak (talk) 13:29, 5 November 2020 (UTC)

I did it, thanks. (I still plan to do additional copyediting/expansion of the description text for each, but what's currently there will do for now.) - dcljr (talk) 02:16, 6 November 2020 (UTC)