Portal talk:Mathematics/Archive2020
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This page is an archive of past discussions. 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. |
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)
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
In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a function between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices.
Homomorphisms generalize various notions of graph colorings and allow the expression of an important class of constraint satisfaction problems, such as certain scheduling or frequency assignment problems.
The fact that homomorphisms can be composed leads to rich algebraic structures: a preorder on graphs, a distributive lattice, and a category (one for undirected graphs and one for directed graphs).
The computational complexity of finding a homomorphism between given graphs is prohibitive in general, but a lot is known about special cases that are solvable in polynomial time. Boundaries between tractable and intractable cases have been an active area of research. (Full article...) -
Image 2
Arnold Ephraim Ross (August 24, 1906 – September 25, 2002) was a mathematician and educator who founded the Ross Mathematics Program, a number theory summer program for gifted high school students. He was born in Chicago, but spent his youth in Odesa, Ukraine, where he studied with Samuil Shatunovsky. Ross returned to Chicago and enrolled in University of Chicago graduate coursework under E. H. Moore, despite his lack of formal academic training. He received his Ph.D. and married his wife, Bee, in 1931.
Ross taught at several institutions including St. Louis University before becoming chair of University of Notre Dame's mathematics department in 1946. He started a teacher training program in mathematics that evolved into the Ross Mathematics Program in 1957 with the addition of high school students. The program moved with him to Ohio State University when he became their department chair in 1963. Though forced to retire in 1976, Ross ran the summer program until 2000. He had worked with over 2,000 students during more than forty summers. (Full article...) -
Image 3
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, by symmetrizing the membership relation of the hereditarily finite sets, by applying the BIT predicate to the binary representations of the natural numbers, or as an infinite Paley graph that has edges connecting pairs of prime numbers congruent to 1 mod 4 that are quadratic residues modulo each other.
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...) -
Image 4
Computational chemistry is a branch of chemistry that uses computer simulations to assist in solving chemical problems. It uses methods of theoretical chemistry incorporated into computer programs to calculate the structures and properties of molecules, groups of molecules, and solids. The importance of this subject stems from the fact that, with the exception of some relatively recent findings related to the hydrogen molecular ion (dihydrogen cation), achieving an accurate quantum mechanical depiction of chemical systems analytically, or in a closed form, is not feasible. The complexity inherent in the many-body problem exacerbates the challenge of providing detailed descriptions of quantum mechanical systems. While computational results normally complement information obtained by chemical experiments, it can occasionally predict unobserved chemical phenomena. (Full article...) -
Image 5
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...) -
Image 6
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...) -
Image 7
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...) -
Image 8
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...) -
Image 9A hidden Markov model (HMM) is a Markov model in which the observations are dependent on a latent (or "hidden") Markov process (referred to as ). An HMM requires that there be an observable process whose outcomes depend on the outcomes of in a known way. Since cannot be observed directly, the goal is to learn about state of by observing By definition of being a Markov model, an HMM has an additional requirement that the outcome of at time must be "influenced" exclusively by the outcome of at and that the outcomes of and at must be conditionally independent of at given at time Estimation of the parameters in an HMM can be performed using maximum likelihood. For linear chain HMMs, the Baum–Welch algorithm can be used to estimate the parameters.
Hidden Markov models are known for their applications to thermodynamics, statistical mechanics, physics, chemistry, economics, finance, signal processing, information theory, pattern recognition—such as speech, handwriting, gesture recognition, part-of-speech tagging, musical score following, partial discharges and bioinformatics. (Full article...) -
Image 10Mathematical economics is the application of mathematical methods to represent theories and analyze problems in economics. Often, these applied methods are beyond simple geometry, and may include differential and integral calculus, difference and differential equations, matrix algebra, mathematical programming, or other computational methods. Proponents of this approach claim that it allows the formulation of theoretical relationships with rigor, generality, and simplicity.
Mathematics allows economists to form meaningful, testable propositions about wide-ranging and complex subjects which could less easily be expressed informally. Further, the language of mathematics allows economists to make specific, positive claims about controversial or contentious subjects that would be impossible without mathematics. Much of economic theory is currently presented in terms of mathematical economic models, a set of stylized and simplified mathematical relationships asserted to clarify assumptions and implications. (Full article...) -
Image 11
Pythagoras of Samos (Ancient Greek: Πυθαγόρας ὁ Σάμιος, romanized: Pythagóras ho Sámios, lit. 'Pythagoras the Samian', or simply Πυθαγόρας; Πυθαγόρης in Ionian Greek; c. 570 – c. 495 BC) was an ancient Ionian Greek philosopher, polymath and the eponymous founder of Pythagoreanism. His political and religious teachings were well known in Magna Graecia and influenced the philosophies of Plato, Aristotle, and, through them, the West in general. Knowledge of his life is clouded by legend; modern scholars disagree regarding Pythagoras's education and influences, but they do agree that, around 530 BC, he travelled to Croton in southern Italy, where he founded a school in which initiates were sworn to secrecy and lived a communal, ascetic lifestyle. This lifestyle entailed a number of dietary prohibitions, traditionally said to have included aspects of vegetarianism.
The teaching most securely identified with Pythagoras is metempsychosis, or the "transmigration of souls", which holds that every soul is immortal and, upon death, enters into a new body. He may have also devised the doctrine of musica universalis, which holds that the planets move according to mathematical equations and thus resonate to produce an inaudible symphony of music. Scholars debate whether Pythagoras developed the numerological and musical teachings attributed to him, or if those teachings were developed by his later followers, particularly Philolaus of Croton. Following Croton's decisive victory over Sybaris in around 510 BC, Pythagoras's followers came into conflict with supporters of democracy, and Pythagorean meeting houses were burned. Pythagoras may have been killed during this persecution, or he may have escaped to Metapontum and died there. (Full article...) -
Image 12
José Félix Mendieta Villarroel (born 15 November 1958) is a Bolivian politician and trade unionist who served as a member of the Chamber of Deputies from Cochabamba, representing circumscription 28 from 2010 to 2015.
Though educated in pedagogy, Mendieta spent most of his career in commercial driving, climbing the ranks of the sector's trade unions to eventually become general secretary of the Sacaba Mixed Motor Transport Union. Though traditionally conservative, under the leadership of figures like Mendieta, many of the country's drivers' unions were reoriented towards the left. (Full article...) -
Image 13Stars is a wood engraving print created by the Dutch artist M. C. Escher in 1948, depicting two chameleons in a polyhedral cage floating through space.
The compound of three octahedra used for the central cage in Stars had been studied before in mathematics, and Escher likely learned of it from the book Vielecke und Vielflache by Max Brückner. Escher used similar compound polyhedral forms in several other works, including Crystal (1947), Study for Stars (1948), Double Planetoid (1949), and Waterfall (1961). (Full article...) -
Image 14
Kawasaki's theorem or Kawasaki–Justin theorem is a theorem in the mathematics of paper folding that describes the crease patterns with a single vertex that may be folded to form a flat figure. It states that the pattern is flat-foldable if and only if alternatingly adding and subtracting the angles of consecutive folds around the vertex gives an alternating sum of zero.
Crease patterns with more than one vertex do not obey such a simple criterion, and are NP-hard to fold.
The theorem is named after one of its discoverers, Toshikazu Kawasaki. However, several others also contributed to its discovery, and it is sometimes called the Kawasaki–Justin theorem or Husimi's theorem after other contributors, Jacques Justin and Kôdi Husimi. (Full article...) -
Image 15
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.
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)