Portal talk:Mathematics/Archive2020

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:

• 

  

  The cover page of Ars Conjectandi

  
  
  Ars Conjectandi (Latin for "The Art of Conjecturing") is a book on combinatorics and mathematical probability written by Jacob Bernoulli and published in 1713, eight years after his death, by his nephew, Niklaus Bernoulli. The seminal work consolidated, apart from many combinatorial topics, many central ideas in probability theory, such as the very first version of the law of large numbers: indeed, it is widely regarded as the founding work of that subject. It also addressed problems that today are classified in the twelvefold way and added to the subjects; consequently, it has been dubbed an important historical landmark in not only probability but all combinatorics by a plethora of mathematical historians. The importance of this early work had a large impact on both contemporary and later mathematicians; for example, Abraham de Moivre.
  
  Bernoulli wrote the text between 1684 and 1689, including the work of mathematicians such as Christiaan Huygens, Gerolamo Cardano, Pierre de Fermat, and Blaise Pascal. He incorporated fundamental combinatorial topics such as his theory of permutations and combinations (the aforementioned problems from the twelvefold way) as well as those more distantly connected to the burgeoning subject: the derivation and properties of the eponymous Bernoulli numbers, for instance. Core topics from probability, such as expected value, were also a significant portion of this important work. (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 $n$ 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...)
• 

  

  Two intersecting families of two-element subsets of a four-element set. The sets in the left family all contain the bottom left element. The sets in the right family avoid this element.

  
  In mathematics, the Erdős–Ko–Rado theorem limits the number of sets in a family of sets for which every two sets have at least one element in common. Paul Erdős, Chao Ko, and Richard Rado proved the theorem in 1938, but did not publish it until 1961. It is part of the field of combinatorics, and one of the central results of extremal set theory.
  The theorem applies to families of sets that all have the same size, $r$, and are all subsets of some larger set of size $n$. One way to construct a family of sets with these parameters, each two sharing an element, is to choose a single element to belong to all the subsets, and then form all of the subsets that contain the chosen element. The Erdős–Ko–Rado theorem states that when $n$ is large enough for the problem to be nontrivial ($n\geq 2r$) this construction produces the largest possible intersecting families. When $n=2r$ there are other equally-large families, but for larger values of $n$ only the families constructed in this way can be largest. (Full article...)
• 
  
  

  

  Title page of the second (1523) edition

  
  Summa de arithmetica, geometria, proportioni et proportionalita (Summary of arithmetic, geometry, proportions and proportionality) is a book on mathematics written by Luca Pacioli and first published in 1494. It contains a comprehensive summary of Renaissance mathematics, including practical arithmetic, basic algebra, basic geometry and accounting, written for use as a textbook and reference work.
  
  Written in vernacular Italian, the Summa is the first printed work on algebra, and it contains the first published description of the double-entry bookkeeping system. It set a new standard for writing and argumentation about algebra, and its impact upon the subsequent development and standardization of professional accounting methods was so great that Pacioli is sometimes referred to as the "father of accounting". (Full article...)
• 
  
  

  

  Rejewski, c. 1932

  
  Marian Adam Rejewski (Polish: [ˈmarjan rɛˈjɛfskʲi] ; 16 August 1905 – 13 February 1980) was a Polish mathematician and cryptologist who in late 1932 reconstructed the sight-unseen German military Enigma cipher machine, aided by limited documents obtained by French military intelligence.
  
  Over the next nearly seven years, Rejewski and fellow mathematician-cryptologists Jerzy Różycki and Henryk Zygalski, working at the Polish General Staff's Cipher Bureau, developed techniques and equipment for decrypting the Enigma ciphers, even as the Germans introduced modifications to their Enigma machines and encryption procedures. Rejewski's contributions included the cryptologic card catalog and the cryptologic bomb. (Full article...)
• 
  In the C++ programming language, decltype is a keyword used to query the type of an expression. Introduced in C++11, its primary intended use is in generic programming, where it is often difficult, or even impossible, to express types that depend on template parameters.
  
  As generic programming techniques became increasingly popular throughout the 1990s, the need for a type-deduction mechanism was recognized. Many compiler vendors implemented their own versions of the operator, typically called typeof, and some portable implementations with limited functionality, based on existing language features were developed. In 2002, Bjarne Stroustrup proposed that a standardized version of the operator be added to the C++ language, and suggested the name "decltype", to reflect that the operator would yield the "declared type" of an expression. (Full article...)
• 

  

  A polyhedron and its midsphere. The red circles are the boundaries of spherical caps within which the surface of the sphere can be seen from each vertex.

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

  

  Equilateral form of the Cairo tiling

  
  In geometry, a Cairo pentagonal tiling is a tessellation of the Euclidean plane by congruent convex pentagons, formed by overlaying two tessellations of the plane by hexagons and named for its use as a paving design in Cairo. It is also called MacMahon's net after Percy Alexander MacMahon, who depicted it in his 1921 publication New Mathematical Pastimes. John Horton Conway called it a 4-fold pentille.
  
  Infinitely many different pentagons can form this pattern, belonging to two of the 15 families of convex pentagons that can tile the plane. Their tilings have varying symmetries; all are face-symmetric. One particular form of the tiling, dual to the snub square tiling, has tiles with the minimum possible perimeter among all pentagonal tilings. Another, overlaying two flattened tilings by regular hexagons, is the form used in Cairo and has the property that every edge is collinear with infinitely many other edges. (Full article...)
• 

  

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

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

  

  A Doyle spiral of type (8,16) printed in 1911 in Popular Science as an illustration of phyllotaxis. One of its spiral arms is shaded.

  
  In the mathematics of circle packing, a Doyle spiral is a pattern of non-crossing circles in the plane in which each circle is surrounded by a ring of six tangent circles. These patterns contain spiral arms formed by circles linked through opposite points of tangency, with their centers on logarithmic spirals of three different shapes.
  
  Doyle spirals are named after mathematician Peter G. Doyle, who made an important contribution to their mathematical construction in the late 1980s or early 1990s. However, their study in phyllotaxis (the mathematics of plant growth) dates back to the early 1900s. (Full article...)
• 

  

  The Theil–Sen estimator of a set of sample points with outliers (black line) compared to the non-robust ordinary least squares line for the same set (blue). The dashed green line represents the ground truth from which the samples were generated.

  
  In non-parametric statistics, the Theil–Sen estimator is a method for robustly fitting a line to sample points in the plane (simple linear regression) by choosing the median of the slopes of all lines through pairs of points. It has also been called Sen's slope estimator, slope selection, the single median method, the Kendall robust line-fit method, and the Kendall–Theil robust line. It is named after Henri Theil and Pranab K. Sen, who published papers on this method in 1950 and 1968 respectively, and after Maurice Kendall because of its relation to the Kendall tau rank correlation coefficient.
  
  Theil-Sen regression has several advantages over Ordinary least squares regression. It is insensitive to outliers. It can be used for significance tests even when residuals are not normally distributed. It can be significantly more accurate than non-robust simple linear regression (least squares) for skewed and heteroskedastic data, and competes well against least squares even for normally distributed data in terms of statistical power. It has been called "the most popular nonparametric technique for estimating a linear trend". There are fast algorithms for efficiently computing the parameters. (Full article...)
• 
  Advanced Placement (AP) Statistics (also known as AP Stats) is a college-level high school statistics course offered in the United States through the College Board's Advanced Placement program. This course is equivalent to a one semester, non-calculus-based introductory college statistics course and is normally offered to sophomores, juniors and seniors in high school.
  
  One of the College Board's more recent additions, the AP Statistics exam was first administered in May 1996 to supplement the AP program's math offerings, which had previously consisted of only AP Calculus AB and BC. In the United States, enrollment in AP Statistics classes has increased at a higher rate than in any other AP class. (Full article...)
• 

  

  A graph with a universal vertex, u

  
  In graph theory, a universal vertex is a vertex of an undirected graph that is adjacent to all other vertices of the graph. It may also be called a dominating vertex, as it forms a one-element dominating set in the graph. A graph that contains a universal vertex may be called a cone, and its universal vertex may be called the apex of the cone. This terminology should be distinguished from the unrelated usage of these words for universal quantifiers in the logic of graphs, and for apex graphs.
  
  Graphs that contain a universal vertex include the stars, trivially perfect graphs, and friendship graphs. For wheel graphs (the graphs of pyramids), and graphs of higher-dimensional pyramidal polytopes, the vertex at the apex of the pyramid is universal. When a graph contains a universal vertex, it is a cop-win graph, and almost all cop-win graphs contain a universal vertex. (Full article...)
• 

  

  The logo of the International Mathematical Olympiad

  
  
  The International Mathematical Olympiad (IMO) is a mathematical olympiad for pre-university students, and is the oldest of the International Science Olympiads. It is "the most prestigious" mathematical competition in the world. The first IMO was held in Romania in 1959. It has since been held annually, except in 1980. More than 100 countries participate. Each country sends a team of up to six students, plus one team leader, one deputy leader, and observers.
  
  The content ranges from extremely difficult algebra and pre-calculus problems to problems in branches of mathematics not conventionally covered in secondary or high school and often not at university level either, such as projective and complex geometry, functional equations, combinatorics, and well-grounded number theory, of which extensive knowledge of theorems is required. Calculus, though allowed in solutions, is never required, as there is a principle that anyone with a basic understanding of mathematics should understand the problems, even if the solutions require a great deal more knowledge. Supporters of this principle claim that this allows more universality and creates an incentive to find elegant, deceptively simple-looking problems which nevertheless require a certain level of ingenuity, often times a great deal of ingenuity to net all points for a given IMO problem. (Full article...)
• 

  

  Three quadrisecants of a trefoil knot

  
  In geometry, a quadrisecant or quadrisecant line of a space curve is a line that passes through four points of the curve. This is the largest possible number of intersections that a generic space curve can have with a line, and for such curves the quadrisecants form a discrete set of lines. Quadrisecants have been studied for curves of several types:

  • Knots and links in knot theory, when nontrivial, always have quadrisecants, and the existence and number of quadrisecants has been studied in connection with knot invariants including the minimum total curvature and the ropelength of a knot.
  • The number of quadrisecants of a non-singular algebraic curve in complex projective space can be computed by a formula derived by Arthur Cayley.
  • Quadrisecants of arrangements of skew lines touch subsets of four lines from the arrangement. They are associated with ruled surfaces and the Schläfli double six configuration.

  (Full article...)

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

Unfinished selected pictures

dcljr, please see the added captions:

1. Special:Diff/987171957
2. Special:Diff/987172036
3. Special:Diff/987172086
4. Special:Diff/987172114

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)