- disjoint representation
- мат. дизъюнктное представление
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three … Wikipedia
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… … Wikipedia
Projective space — In mathematics a projective space is a set of elements constructed from a vector space such that a distinct element of the projective space consists of all non zero vectors which are equal up to a multiplication by a non zero scalar. A formal… … 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
Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so … Wikipedia
Burnside ring — In mathematics, the Burnside ring of a finite group is an algebraic construction that encodes the different ways the group can act on finite sets. The ideas were introduced by William Burnside at the end of the nineteenth Century, but the… … Wikipedia
Syntaxe du pronom personnel — en français En grammaire française, le pronom personnel, comme tout pronom, peut virtuellement remplir toutes les fonctions du nom, c est à dire, apostrophe et satellite (d un verbe, d un adjectif, d un nom ou d un autre pronom). Pour tout ce qui … Wikipédia en Français
Syntaxe du pronom personnel en français — En grammaire française, le pronom personnel, comme tout pronom, peut presque remplir toutes les fonctions du nom, c est à dire, apostrophe et satellite (d un verbe, d un adjectif, d un nom ou d un autre pronom). Pour tout ce qui concerne la… … Wikipédia en Français
Character theory — This article refers to the use of the term character theory in mathematics. For the media studies definition, see Character theory (Media). In mathematics, more specifically in group theory, the character of a group representation is a function… … Wikipedia