- trivial partition
- мат. тривиальное разбиение
Большой англо-русский и русско-английский словарь. 2001.
trivial partition
Смотреть что такое "trivial partition" в других словарях:
Partition topology — In mathematics, the partition topology is a topology that can be induced on any set X by partitioning X into disjoint subsets P; these subsets form the basis for the topology. There are two important examples which have their own names: The… … Wikipedia
Partition (number theory) — Young diagrams associated to the partitions of the positive integers 1 through 8. They are so arranged that images under the reflection about the main diagonal of the square are conjugate partitions. In number theory and combinatorics, a… … Wikipedia
Group action — This article is about the mathematical concept. For the sociology term, see group action (sociology). Given an equilateral triangle, the counterclockwise rotation by 120° around the center of the triangle acts on the set of vertices of the… … Wikipedia
Chinese restaurant process — Not to be confused with Chinese restaurant syndrome. In probability theory, the Chinese restaurant process is a discrete time stochastic process, whose value at any positive integer time n is a partition Bn of the set {1, 2, 3, … Wikipedia
Series-parallel networks problem — In combinatorial mathematics, the series parallel networks problem asks for the number of series parallel networks that can be formed using a given number of edges. The edges can be distinguishable or indistinguishable.Indistinguishable edgesWhen … Wikipedia
Wikipedia:Reference desk/Mathematics — The Wikipedia Reference Desk covering the topic of mathematics. Mathematics #eee #f5f5f5 #eee #aaa #aaa #aaa #00f #36b #000 #00f mathematics Wikipedia:Refere … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… … Wikipedia
Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… … Wikipedia
Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
