User:SDZeroBot/NPP sorting/STEM/Mathematics
| Tutorial | Discussion | New page feed | Reviewers | Curation tool Suggestions | Coordination |
 | 27 unreviewed articles as of 30 January 2025
|
| Created | Article | Extract | Class | Creator (# edits) | Notes |
|---|---|---|---|---|---|
| 2024-08-20 | Max^n algorithm (A decisive algorithm that solves $n$-player general-sum games.) | In combinatorial game theory, the maxn algorithm is an algorithm that finds an equilibrium point for a search tree to favor a specific player in n-player games. The algorithm was designed by Luckhardt and Irani. | Stub | LeoDog896 (141) | |
| 2024-07-31 | Williamson theorem | In the context of linear algebra and symplectic geometry, the Williamson theorem concerns the diagonalization of positive definite matrices through symplectic matrices. | Stub | Luca Innocenti (450) | |
| 2024-08-13 | Median of the Trapezoid theorem (Geometry theorem about the median of a trapezoid) | The Median of the Trapezoid theorem states that the median of a trapezoid is equal in length to the average of the lengths of the two bases. This theorem is a fundamental concept in geometry and has various applications in mathematics, particularly in the study of quadrilaterals. | Start | SteveLosive (35) | |
| 2024-10-29 | Rational homology sphere (Manifold with the same rational homology groups as a sphere) | In algebraic topology, a rational homology -sphere is an -dimensional manifold with the same rational homology groups as the -sphere. These serve, among other things, to understand which information the rational homology groups of a space can or cannot measure and which attenuations result from neglecting torsion in comparison to the (integral) homology groups of the space. | Start | Samuel Adrian Antz (2029) | |
| 2024-10-29 | Rational homotopy sphere (Manifold with the same rational homotopy groups as a sphere) | In algebraic topology, a rational homotopy -sphere is an -dimensional manifold with the same rational homotopy groups as the -sphere. These serve, among other things, to understand which information the rational homotopy groups of a space can or cannot measure and which attenuations result from neglecting torsion in comparison to the (integral) homotopy groups of the space. | Start | Samuel Adrian Antz (2029) | |
| 2024-09-28 | Random feature | Random features (RF) are a technique used in machine learning to approximate kernel methods, introduced by Ali Rahimi and Ben Recht in their 2007 paper "Random Features for Large-Scale Kernel Machines", and extended by. RF uses a Monte Carlo approximation to kernel functions by randomly sampled feature maps. | C | Cosmia Nebula (8691) | |
| 2024-06-29 | Game form (Game theory concept) | In game theory and related fields, a game form, game frame, ruleset, or outcome function is the set of rules that govern a game and determine its outcome based on each player's choices. A game form differs from a game in that it does not stipulate the utilities or payoffs for each agent. | Start | Closed Limelike Curves (7273) | |
| 2024-10-18 | Model compression (Techniques for lossy compression of neural networks) | Model compression is a machine learning technique for reducing the size of trained models. Large models can achieve high accuracy, but often at the cost of significant resource requirements. Compression techniques aim to compress models without significant performance reduction. | C | Cosmia Nebula (8691) | |
| 2024-12-04 | Weierstrass Nullstellensatz (Theorem in mathematics) | In mathematics, the Weierstrass Nullstellensatz is a version of the intermediate value theorem over a real closed field. It says: | Stub | TakuyaMurata (89995) | |
| 2024-10-03 | List of mathematical objects | This is a list of mathematical objects, organized by branch. | Stub | Farkle Griffen (1726) | |
| 2024-10-05 | Weight initialization (Technique for setting initial values of trainable parameters in a neural network) | In deep learning, weight initialization describes the initial step in creating a neural network. A neural network contains trainable parameters that are modified during training: weight initialization is the pre-training step of assigning initial values to these parameters. | C | Cosmia Nebula (8691) | |
| 2024-06-23 | Agnew's theorem (Theorem about permutations that preserve convergence for all converging series) | Agnew's theorem, proposed by American mathematician Ralph Palmer Agnew, characterizes reorderings of terms of infinite series that preserve convergence for all series. | Start | UnladenSwallow (3176) | |
| 2024-10-20 | Integral of a correspondence | In mathematics, the integral of a correspondence is a generalization of the integration of single-valued functions to correspondences. | C | JoaoFrancisco1812 (160) | |
| 2024-08-24 | Non-physical true random number generator (Type of random number generator) | Non-physical true random number generator (NPTRNG), also known as non-physical nondeterministic random bit generator is a true random number generator that does not have access to dedicated hardware entropy source. NPTRNG uses a non-physical noise source that obtains entropy from system data, like outputs of application programming interface functions, residual information in the random access memory, system time or human input (e.g., mouse movements and keystrokes). | Start | Dimawik (2308) | |
| 2024-06-25 | Epanechnikov distribution (Continuous probability distribution) | In probability theory and statistics, the Epanechnikov distribution, also known as the Epanechnikov kernel, is a continuous probability distribution that is defined on a finite interval. It is named after V. A. Epanechnikov, who introduced it in 1969 in the context of kernel density estimation. | Start | Jonbarron (20) | |
| 2024-09-07 | Modified Kumaraswamy distribution (Continuous probability distribution) | Start | KallinAZ (17) | ||
| 2024-12-27 | Myerson value | The Myerson value is a solution concept in cooperative game theory. It is a generalization of the Shapley value to communication games on networks. The solution concept and the class of cooperative communication games it applies to was introduced by Roger Myerson in 1977. | C | JoaoFrancisco1812 (160) | |
| 2024-08-20 | Mill's Inequality (probabilistic inequality) | Mill's Inequality is a useful tail bound on Normally distributed random variables. \frac{\exp(-t^2/2)}{t} \le \frac{\exp(-t^2/2)}{t}</math> | Stub | Wqwt (961) | |
| 2024-08-28 | Cipher device | A cipher device was a term used by the US military in the first half of the 20th century to describe a manually operated cipher equipment that converted the plaintext into ciphertext or vice versa. A similar term, cipher machine, was used to describe the cipher equipment that required external power for operation. | Stub | Teemu Leisti (2878) | |
| 2024-12-28 | Principal equation form | In mathematics and, more specifically, in theory of equations, the principal form of an irreducible polynomial of degree at least three is a polynomial of the same degree n without terms of degrees n−1 and n−2, such that each root of either polynomial is a rational function of a root of the other polynomial. | C | Reformbenediktiner (720) | |
| 2024-10-28 | Eventually stable polynomial | A non-constant polynomial with coefficients in a field is said to be eventually stable if the number of irreducible factors of the -fold iteration of the polynomial is eventually constant as a function of . The terminology is due to R. | Start | Hydrohydro (14) | |
| 2024-12-20 | Extreme set | In mathematics, most commonly in convex geometry, an extreme set or face of a set in a vector space is a subset with the property that if for any two points some in-between point lies in , then we must have had . | Start | Rigmat (56) | |
| 2024-12-06 | Lie n-algebra | In mathematics, a Lie n-algebra is a generalization of a Lie algebra, a vector space with a bracket, to higher order operations. For example, in the case of a Lie 2-algebra, the Jacobi identity is replaced by an isomorphism called a Jacobiator. | Stub | TakuyaMurata (89995) | |
| 2024-12-08 | Two-proportion Z-test | The Two-proportion Z-test is a statistical method used to determine whether the difference between the proportions of two groups, coming from a binomial distribution is statistically significant. This approach relies on the assumption that the sample proportions follow a normal distribution under the Central Limit Theorem, allowing the construction of a z-test for hypothesis testing and confidence interval estimation. | C | Talgalili (3221) | |
| 2024-11-23 | Fine and Wilf's theorem (Result on periodic sequences) | In combinatorics on words, Fine and Wilf's theorem is a fundamental result describing what happens when a long-enough word has two different periods (i.e., distances at which its letters repeat). Informally, the conclusion is that such words have also a third, shorter period. | GA | MatthewKonefal (34) | |
| 2025-01-27 | Heap game | Heap games are a subclass of impartial games that involve the disjunctive sum of various single-heap games. Single-heap positions, or Γ-heaps are games represented naturally by the ordinal amount of a heap of tokens, where players play according to a specific ruleset on that single heap. | Stub | LeoDog896 (141) | |
| 2025-01-30 | Hadamard variation formula | In matrix theory, the Hadamard variation formula is a set of differential equations for how the eigenvalues of a time-varying Hermitian matrix with distinct eigenvalues change with time. | Stub | Cosmia Nebula (8691) |
![{\displaystyle z=\theta x+(1-\theta )y,\theta \in [0,1]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/c525d6671da7285923dd87ab2efe60532467f857)
Last updated by SDZeroBot operator / talk at 13:30, 30 January 2025 (UTC)