User:SDZeroBot/NPP sorting/STEM/Mathematics
Appearance
Tutorial | Discussion | New page feed | Reviewers | Curation tool Suggestions | Coordination |
![]() | 41 unreviewed articles as of 21 March 2025
|
Created | Article | Extract | Class | Creator (# edits) | Notes |
---|---|---|---|---|---|
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 (2317) | |
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 (2317) | |
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 (9438) | |
2024-10-03 | List of mathematical objects | This is a list of mathematical objects, organized by branch. | Stub | Farkle Griffen (1868) | |
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 (9438) | |
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 (3178) | |
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 (161) | |
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 (965) | |
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 (2879) | |
2024-07-31 | Williamson theorem (Theorem about diagonalizing matrices) | 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 (451) | |
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 (142) | |
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 (9438) | |
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 (90150) | |
2025-02-06 | Coalescence (statistics) | In statistics, coalescence refers to the merging of independent probability density functions. The systematically recommended Multiplication Rule (also known as conflation) for merging densities generates a joint density that suffers from a mean-biased expected value and an overly optimistic standard deviation. | Stub | Witger (1186) | |
2025-02-09 | Conflation (statistics) | In statistics, conflation refers to the merging of independent probability density functions using simple multiplication of the constituent densities. Unfortunately, conflation generates a joint density that suffers from a mean-biased expected value and an overly optimistic standard deviation. | Stub | Witger (1186) | |
2024-12-08 | Two-proportion Z-test | The Two-proportion Z-test (or, Two-sample 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 (3224) | |
2025-02-08 | Carl Sonntag (German Jewish bookbinder and art collector (1883-1930)) | Carl Sonntag (born July 21, 1883 in Leipzig; died August 20, 1930 in Berlin), generally known as Carl Sonntag Jr., was a German art bookbinder and cover designer. | C | Eli185 (7485) | |
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 (58) | |
2025-02-09 | Defects per unit | Defects per unit (DPU) is a metric of capability for discrete data that oftens follows a normal distribution. | Stub | GobsPint (2380) | |
2025-02-22 | Deshouillers–Dress–Tenenbaum theorem | The Deshouillers–Dress–Tenenbaum theorem (or in short DDT theorem) is a result from probabilistic number theory, which describes the probability distribution of a divisor of a natural number within the interval , where the divisor is chosen uniformly. | Start | Tensorproduct (1860) | |
2024-09-07 | Modified Kumaraswamy distribution (Continuous probability distribution) | Start | KallinAZ (18) | ||
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 (7941) | |
2024-12-03 | Bayes space (Statistical field) | Bayes space is a function space defined as an equivalence class of measures with the same null-sets. Two measures are defined to be equivalent if they are proportional. The basic ideas of Bayes spaces have their roots in Compositional Data Analysis and the Aitchison geometry. | C | Sprint99 (23) | |
2024-12-28 | Principal form of a polynomial | 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 (748) | |
2025-02-23 | Hartman–Watson distribution | The Hartman-Watson distribution is an absolutely continuous probability distribution which arises in the study of Brownian functionals. It is named after Philip Hartman and Geoffrey S. Watson, who encountered the distribution while studying the relationship between Brownian motion on the n-sphere and the von Mises distribution. | Start | Tensorproduct (1860) | |
2024-04-02 | Velocity Racing Development (American auto racing team) | Velocity Racing Development, also competing as VRD Racing in select championships, is an auto racing team from the United States. The team competes in the USF Pro Championships in the United States and the GB3 Championship in Europe in collaboration with Arden Motorsport. | C | Formula Downforce (41943) | |
2025-03-05 | Modification (mathematics) | In mathematics, specifically category theory, a modification is an arrow between natural transformations. It is a 3-cell in the 3-category of 2-cells (where the 2-cells are natural transformations, the 1-cells are functors, and the 0-cells are categories). | Stub | Quezergue (126) | |
2025-03-06 | Namioka's theorem | In functional analysis, Namioka's theorem is a result concerning the relationship between separate continuity and joint continuity of functions defined on product spaces. Named after mathematician Isaac Namioka, who proved it in his 1974 paper Separate Continuity and Joint Continuity published in the Pacific Journal of Mathematics, the theorem establishes conditions under which a separately continuous function must be jointly continuous on a topologically large subset of its domain. | Start | GregariousMadness (1823) | |
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 (161) | |
2025-03-03 | Density topology (Wikimedia article stub) | In mathematics, the density topology on the real numbers is a topology on the real line that is different (strictly finer), but in some ways analogous, to the usual topology. It is sometimes used in real analysis to express or relate properties of the Lebesgue measure in topological terms. | Start | Gro-Tsen (852) | |
2024-11-21 | Context-free language reachability (Algorithmic problem with applications to program analysis) | Context-free language reachability is an algorithmic problem with applications in static program analysis. Given a graph with edge labels from some alphabet and a context-free grammar over that alphabet, the problem is to determine whether there exists a path through the graph such that the concatenation of the labels along the path is a string accepted by the grammar. | C | Siddharthist (1873) | |
2025-02-07 | Neyman–Scott process | The Neyman-Scott process is a stochastic model used to describe the formation of clustered point patterns. Originally developed for modeling galaxy distributions by J. Neyman and Elizabeth L. Scott in 1952, it provides a framework for understanding phenomena characterized by clustering. | Stub | 7804j (2128) | |
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 (2318) | |
2024-08-20 | Max^n algorithm (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 (142) | |
2025-03-10 | Discrimination ratio | In Six Sigma, the discrimination ratio or reliability design index is a performance metric of attribute agreement analysis which assesses the level of agreement between how well the appraisers or inspectors can differentiate between acceptable and unacceptable items. | Stub | GobsPint (2380) | |
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) | |
2025-01-30 | Data product (data product is a reusable, active, and standardized data asset designed to deliver measurable value to its users) | In data management and product management, a data product is a reusable, active, and standardized data asset designed to deliver measurable value to its users, whether internal or external, by applying the rigorous principles of product thinking and management. | Start | Jgperrin (86) | |
2025-03-18 | October 13, 2021, North Kosovo riots | The October 13, 2021 North Kosovo riots were a series of border crossing blockades, protests and riots that happened in the region of North Kosovo on that day. On that day the Kosovo Police seized many "smuggled goods" in several regions, including Priština, Peja, South and North Mitrovica according to an official document. | GA | Hollowww (4319) | |
2023-03-12 | Jim Pitman (Emeritus Professor of Statistics and Mathematics) | Jim Pitman is an Emeritus Professor of Statistics and Mathematics at the University of California, Berkeley. | C | Rhubarbmuncher (84) | |
2025-03-20 | Product quantization | Product quantization (PQ) is a technique that decomposes high-dimensional vector spaces into a Cartesian product of low-dimensional subspaces, with each subspace quantized independently. This approach represents each vector by a compact code, enabling efficient distance estimation while significantly reducing memory usage. | Stub | Morinator (29) |
Last updated by SDZeroBot operator / talk at 01:53, 21 March 2025 (UTC)