- lattice of partitions
- мат. решетка разбиений
Большой англо-русский и русско-английский словарь. 2001.
lattice of partitions
Смотреть что такое "lattice of partitions" в других словарях:
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Young's lattice — In mathematics, Young s lattice is a partially ordered set and a lattice that is formed by all integer partitions. It is named after Alfred Young, who in a series of papers On quantitative substitutional analysis developed representation theory… … Wikipedia
Distributive lattice — In mathematics, distributive lattices are lattices for which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set… … Wikipedia
Dominance order — Example of dominance ordering of partitions of n. Here, n = 6, nodes are partitions of 6, edges indicate that the upper node dominates the lower node. While this particular partial ordering is graded, this is not true for the dominance ordering… … Wikipedia
Partition of a set — In mathematics, a partition of a set X is a division of X into non overlapping parts or blocks or cells that cover all of X . More formally, these cells are both collectively exhaustive and mutually exclusive with respect to the set being… … Wikipedia
Graded poset — In mathematics, a graded poset, sometimes called a ranked poset (but see the article for an alternative meaning), is a partially ordered set (poset) P equipped with a rank function rho; from P to N compatible with the ordering (so rho;( x ) lt;… … Wikipedia
Hasse-Diagramm — In der Mathematik ist ein Hasse Diagramm eine bestimmte graphische Darstellung endlicher halbgeordneter Mengen. Solche Diagramme wurden 1967 von dem Mathematiker Helmut Hasse eingeführt. Das Hasse Diagramm für eine Halbordnung ist ein gerichteter … Deutsch Wikipedia
Hassediagramm — In der Mathematik ist ein Hasse Diagramm eine bestimmte graphische Darstellung halbgeordneter Mengen. Solche Diagramme wurden 1967 von dem Mathematiker Helmut Hasse eingeführt. Das Hasse Diagramm für eine Halbordnung ist ein gerichteter Graph,… … Deutsch Wikipedia
Noncrossing partition — A noncrossing partition of ten points In combinatorial mathematics, the topic of noncrossing partitions has assumed some importance because of (among other things) its application to the theory of free probability. The set of all noncrossing… … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
basketry — /bas ki tree, bah ski /, n. 1. baskets collectively; basketwork. 2. the art or process of making baskets. [1850 55; BASKET + RY] * * * Art and craft of making containers and other objects from interwoven flexible fibres such as grasses, twigs,… … Universalium
