- simplex degeneracy
- мат. вырождение симплекса
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Simplicial set — In mathematics, a simplicial set is a construction in categorical homotopy theory which is a purely algebraic model of the notion of a well behaved topological space. Historically, this model arose from earlier work in combinatorial topology and… … Wikipedia
Nerve (category theory) — In category theory, the nerve N(C) of a small category C is a simplicial set constructed from the objects and morphisms of C. The geometric realization of this simplicial set is a topological space, called the classifying space of the category C … Wikipedia
Criss-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… … Wikipedia
Oriented 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… … Wikipedia
Least absolute deviations — (LAD), also known as Least Absolute Errors (LAE), Least Absolute Value (LAV), or the L1 norm problem, is a mathematical optimization technique similar to the popular least squares technique that attempts to find a function which closely… … Wikipedia
Virus — This article is about the biological agent. For other uses, see Virus (disambiguation). For a generally accessible and less technical introduction to the topic, see Introduction to viruses. Viruses … Wikipedia
Interval exchange transformation — In mathematics, an interval exchange transformation is a kind of dynamical system that generalises the idea of a circle rotation. The phase space consists of the unit interval, and the transformation acts by cutting the interval into several… … Wikipedia
List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… … Wikipedia
Rational homotopy theory — In mathematics, rational homotopy theory is the study of the rational homotopy type of a space, which means roughly that one ignores all torsion in the homotopy groups. It was started by Dennis Sullivan (1977) and Daniel Quillen (1969) … Wikipedia
Priesthood — • Brief yet thorough examination of this sacrament Catholic Encyclopedia. Kevin Knight. 2006. Priesthood Priesthood † … Catholic encyclopedia
LNEMS357 — P. Zornig: Degeneracy Graphs and Simplex Cycling, Springer Verlag 1991 … Acronyms