finite hypercube
Смотреть что такое "finite hypercube" в других словарях:
Hypercube graph — The hypercube graph Q4 Vertices 2n Edges 2n−1n … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Coxeter group — In mathematics, a Coxeter group, named after H.S.M. Coxeter, is an abstract group that admits a formal description in terms of mirror symmetries. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry … Wikipedia
Space-filling curve — 3 iterations of a Peano curve construction, whose limit is a space filling curve. In mathematical analysis, a space filling curve is a curve whose range contains the entire 2 dimensional unit square (or more generally an N dimensional hypercube) … Wikipedia
Simplex — For other uses, see Simplex (disambiguation). A regular 3 simplex or tetrahedron In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n… … Wikipedia
Curse of dimensionality — The curse of dimensionality refers to various phenomena that arise when analyzing and organizing high dimensional spaces (often with hundreds or thousands of dimensions) that do not occur in low dimensional settings such as the physical space… … Wikipedia
Crystallographic restriction theorem — The crystallographic restriction theorem in its basic form was based on the observation that the rotational symmetries of a crystal are usually limited to 2 fold, 3 fold, 4 fold, and 6 fold. However, quasicrystals can occur with other symmetries … Wikipedia
Polytope — Not to be confused with polytrope. In elementary geometry, a polytope is a geometric object with flat sides, which exists in any general number of dimensions. A polygon is a polytope in two dimensions, a polyhedron in three dimensions, and so on… … Wikipedia
List of regular polytopes — This page lists the regular polytopes in Euclidean, spherical and hyperbolic spaces.The Schläfli symbol notation describes every regular polytope, and is used widely below as a compact reference name for each.The regular polytopes are grouped by… … Wikipedia
Universal graph — In mathematics, a universal graph is an infinite graph that contains every finite (or at most countable) graph as an induced subgraph. A universal graph of this type was first constructed by R. Rado [cite journal author = Rado, R. title =… … Wikipedia
Parallel computing — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
