In algebraic topology, the cellular approximation theorem states that a map between CW-complexes can always be taken to be of a specific type. Concretely...
8 KB (1,414 words) - 23:22, 19 March 2024
periodicity theorem (homotopy theory) Brown's representability theorem (homotopy theory) Cellular approximation theorem (algebraic topology) Dold–Thom theorem (algebraic...
78 KB (6,289 words) - 12:34, 6 June 2025
Algebraic topology (section Important theorems)
Blakers–Massey theorem Borsuk–Ulam theorem Brouwer fixed point theorem Cellular approximation theorem Dold–Thom theorem Eilenberg–Ganea theorem Eilenberg–Zilber...
19 KB (2,093 words) - 21:19, 12 June 2025
CW complex (redirect from Cellular complex)
statements remain true. Cellular approximation theorem Singular homology and cohomology of CW complexes is readily computable via cellular homology. Moreover...
24 KB (3,610 words) - 06:56, 16 June 2025
algebraic topology, such as the Seifert–van Kampen theorem or the cellular approximation theorem. The circle (also known as the 1-sphere) S 1 = { ( x...
53 KB (8,137 words) - 09:50, 14 June 2025
generalized for any continuous functions via the approximation theorem. Brouwer's fixpoint theorem treats the case where f : D n → D n {\displaystyle...
33 KB (5,150 words) - 17:34, 13 June 2025
then πi(Sn) = 0. This can be shown as a consequence of the cellular approximation theorem. All the interesting cases of homotopy groups of spheres involve...
83 KB (8,124 words) - 04:10, 28 March 2025
The cellular approximation theorem says that every map between CW complexes is homotopic to a cellular map between them. 3. The cellular homology is the...
52 KB (7,621 words) - 00:34, 3 March 2025
Curve-shortening flow (redirect from Gage–Hamilton–Grayson theorem)
and spirals that rotate while remaining the same size and shape. An approximation to the curve-shortening flow can be computed numerically, by approximating...
75 KB (9,389 words) - 10:32, 27 May 2025
different approximation ratios) and to the weighted case. Several divide-and-conquer algorithms are based on a certain geometric separator theorem. A geometric...
31 KB (4,745 words) - 20:27, 19 June 2025
trigonometric polynomial Bernstein's theorem (approximation theory) — a converse to Jackson's inequality Fejér's theorem — Cesàro means of partial sums of...
70 KB (8,327 words) - 09:12, 7 June 2025
Turing reduction Savitch's theorem Space hierarchy theorem Speed Prior Speedup theorem Subquadratic time Time hierarchy theorem See the list of complexity...
5 KB (466 words) - 16:43, 14 March 2025
computation, a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if...
32 KB (3,448 words) - 23:21, 19 June 2025
Dynamical system (section Cellular automaton)
close to the initial state. Aleksandr Lyapunov developed many important approximation methods. His methods, which he developed in 1899, make it possible to...
52 KB (7,094 words) - 15:27, 3 June 2025
Homotopy theory (section Key theorems)
equivalence are the same thing. Another important result is the approximation theorem. First, the homotopy category of spaces is the category where an...
24 KB (3,813 words) - 15:16, 7 June 2025
complex Polytope Triangulation Barycentric subdivision Simplicial approximation theorem Abstract simplicial complex Simplicial set Simplicial category Chain...
4 KB (311 words) - 12:17, 30 October 2023
Friedman test Friendship paradox Frisch–Waugh–Lovell theorem Fully crossed design Function approximation Functional boxplot Functional data analysis Funnel...
87 KB (8,280 words) - 23:04, 12 March 2025
compression. This was the quantum analog of Shannon's noiseless coding theorem, and it helped to start the field known as quantum information theory....
6 KB (371 words) - 00:48, 18 March 2025
Fermat's Last Theorem, for which other geometrical notions are just as crucial. There is also the closely linked area of Diophantine approximations: given a...
95 KB (12,231 words) - 15:42, 21 June 2025
approximation to the largest planar subgraph, an important subproblem in planarization. As an approximation algorithm, this method has approximation ratio...
13 KB (1,684 words) - 20:51, 27 February 2025
Copula (statistics) (redirect from Sklar's theorem)
and minimize tail risk and portfolio-optimization applications. Sklar's theorem states that any multivariate joint distribution can be written in terms...
75 KB (9,347 words) - 09:59, 15 June 2025
tree cellular automaton centroid certificate chain (order theory) chaining (algorithm) child Chinese postman problem Chinese remainder theorem Christofides...
35 KB (3,135 words) - 18:46, 6 May 2025
Perelman announced his proof of the Poincaré conjecture. The side-approximation theorem was considered by Bing to be one of his key discoveries. It has...
10 KB (1,058 words) - 08:10, 28 November 2024
Monte Carlo method (category Statistical approximations)
final result, the approximation of π. There are two important considerations: If the points are not uniformly distributed, the approximation will be poor....
91 KB (10,690 words) - 23:18, 29 April 2025
Approximate Bayesian computation (category Statistical approximations)
mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider...
82 KB (8,997 words) - 09:51, 19 February 2025
for a fixed value of N {\displaystyle N} . However, the approximation by the central limit theorem may not be accurate if x {\displaystyle x} is far from...
17 KB (2,633 words) - 04:33, 12 May 2025
Topological data analysis (section Structure theorem)
first classification theorem for persistent homology appeared in 1994 via Barannikov's canonical forms. The classification theorem interpreting persistence...
87 KB (10,980 words) - 16:38, 16 June 2025
the caloric component of a fluid's internal energy (the equipartition theorem). This motion is named after the Scottish botanist Robert Brown, who first...
56 KB (7,145 words) - 00:54, 20 June 2025
Aldous, Probability Approximations via the Poisson Clumping Heuristic; AD Barbour, L. Holst, S. Janson, Poisson Approximation}. The Annals of Probability...
117 KB (15,356 words) - 23:22, 19 June 2025
equations are often partial differential equations (PDEs). To explain the approximation of this process, FEM is commonly introduced as a special case of the...
59 KB (7,792 words) - 08:01, 25 May 2025