combinatorial dimension
1Combinatorial map — A combinatorial map is a combinatorial object modelling topological structures with subdivided objects. Historically, the concept was introduced informally by J. Edmonds for polyhedral surfaces [1] which are planar graphs. It was given its first… …
2Dimension reduction — For dimensional reduction in physics, see Dimensional reduction. In machine learning, dimension reduction is the process of reducing the number of random variables under consideration, and can be divided into feature selection and feature… …
3Maldición de la dimensión — En matemáticas y estadística, la maldición de la dimensión (también conocida como efecto Hughes[1] ) es el problema causado por el crecimiento exponencial del volumen asociado al incremento del número de dimensiones en un espacio matemático. El… …
4James W. Cannon — (b. January 30, 1943) is an American mathematician working in the areas of low dimensional topology and geometric group theory. He is an Orson Pratt Professor of Mathematics at the Brigham Young University.Biographical dataJames W. Cannon was… …
5List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …
6Snake-in-the-box — The snake in the box problem in graph theory and computer science deals with finding a certain kind of path along the edges of a hypercube. This path starts at one corner and travels along the edges to as many corners as it can reach. After it… …
7Oriented matroid — theory allows a combinatorial approach to the max flow min cut theorem. A network with the value of flow equal to the capacity of an s t cut An oriented matroid is a mathematical structure that abstracts the properties of directed graphs and of… …
8Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… …
9Abstract simplicial complex — In mathematics, an abstract simplicial complex is a purely combinatorial description of the geometric notion of a simplicial complex, consisting of a family of finite sets closed under the operation of taking subsets. In the context of matroids… …
10Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… …
