- combinatorial cycle
- мат. комбинаторный цикл
Большой англо-русский и русско-английский словарь. 2001.
combinatorial cycle
Смотреть что такое "combinatorial cycle" в других словарях:
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
Combinatorial game theory — This article is about the theory of combinatorial games. For the theory that includes games of chance and games of imperfect knowledge, see Game theory. Mathematicians playing Konane at a Combinatorial game theory workshop (for technical content … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
Cycle detection — This article is about iterated functions. For another use, see Cycle detection (graph theory). In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any function ƒ that… … Wikipedia
Cycle index — In mathematics, and in particular in the field of combinatorics, cycle indices are used in combinatorial enumeration when symmetries are to be taken into account. This is particularly important in species theory. Each permutation π of a finite… … Wikipedia
Cycle notation — For the cyclic decomposition of graphs, see Cycle decomposition (graph theory). For cycling terminology, see glossary of bicycling. In combinatorial mathematics, the cycle notation is a useful convention for writing down a permutation in terms of … Wikipedia
Cycle cover — In graph theory and combinatorial optimization, cycle cover may have the following meanings Vertex cycle cover Vertex disjoint cycle cover Edge cycle cover Other possible meanings include: A cover for a bicycle Vehicle insurance for a bicycle… … Wikipedia
Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is … Wikipedia
Nuclear fuel cycle — The nuclear fuel cycle, also called nuclear fuel chain, is the progression of nuclear fuel through a series of differing stages. It consists of steps in the front end, which are the preparation of the fuel, steps in the service period in which… … Wikipedia
Graphe cycle — Ne doit pas être confondu avec Graphe des cycles ni Cycle (théorie des graphes). Graphe cycle C8 … Wikipédia en Français
Hodge structure — In mathematics, a Hodge structure, named after W. V. D. Hodge, is an algebraic structure at the level of linear algebra, similar to the one that Hodge theory gives to the cohomology groups of a smooth and compact Kähler manifold. A mixed Hodge… … Wikipedia
