 | 16 unreviewed articles as of 2 October 2024
|
| Created | Article | Extract | Class | Creator (# edits) | Notes |
|---|---|---|---|---|---|
| 2024-08-24 | Non-physical true 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 (2149) | |
| 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 (934) | |
| 2024-06-29 | Game form (Statistical 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 (4820) | |
| 2024-06-03 | Helffer–Sjöstrand formula (This is a mathematical page on the Helffer-Sjoestrand formula.) | In mathematics, more specifically, in functional analysis, the Helffer–Sjöstrand formula is a formula for computing a function of a self-adjoint operator. | Stub | 46.193.35.242 | |
| 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 (113) | |
| 2024-08-25 | Minimum mean weight cycle | In graph theory, a minimum mean weight cycle is a cycle whose average weight (total weight divided by length) is smallest among all cycles in the graph. An analogous problem is the maximum mean weight cycle. These problems have applications to embedded systems and logic chip design. | C | Erel Segal (14118) | |
| 2024-01-25 | Domain separation (Cryptographic technique) | In cryptography, domain separation is a construct used to implement multiple different functions using only one underlying template in an efficient way. The domain separation can be defined as partitioning of the domain of a function to assign separate subdomains to different applications of the same function. | C | Evgeny Kapun (100) | |
| 2024-07-21 | Hecke eigensheaf | In mathematics, a Hecke eigensheaf is any sheaf whose value is based on an eigenfunction. It is an object that is a tensor-multiple of itself when formed under the integral transform of a Hecke correspondence. Hecke eigensheaves are part of the geometric Langlands correspondence. | Stub | Jasonbook99 (716) | |
| 2024-06-23 | Agnew's theorem (Theorem about reordering terms of a converging series) | Agnew's theorem characterizes term rearrangements that preserve convergence of series. It was proposed by American mathematician Ralph Palmer Agnew. | Start | UnladenSwallow (3038) | |
| 2024-04-26 | CLRg property | In mathematics, the notion of “common limit in the range” property denoted by CLRg property is a theorem that unifies, generalizes, and extends the contractive mappings in fuzzy metric spaces, where the range of the mappings does not necessarily need to be a closed subspace of a non-empty set . | Start | Mahmoudpd (6) | |
| 2024-08-28 | Cipher device | A cipher device (or cipher machine, cipher box, crypto box) is a physical cryptographic device used to encrypt and decrypt messages between plaintext (unencrypted) and ciphertext (encrypted or secret) forms. The ciphertext is suitable for transmission over a channel, such as radio, that might be observed by an adversary the communicating parties wish to conceal the plaintext from. | Stub | Teemu Leisti (2876) | |
| 2024-06-25 | Epanechnikov distribution (Mathematical term) | 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-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-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 (7328) | |
| 2024-09-30 | Border's theorem | In auction theory and mechanism design, Border's theorem gives a necessary and sufficient condition for interim allocation rules (or reduced form auctions) to be implementable via an auction. | C | JoaoFrancisco1812 (137) | |
| 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 (440) |
Last updated by SDZeroBot operator / talk at 13:26, 2 October 2024 (UTC)