- lexicographically positive
- мат. лексикографически положительный
Большой англо-русский и русско-английский словарь. 2001.
lexicographically positive
Смотреть что такое "lexicographically positive" в других словарях:
0.999... — In mathematics, the repeating decimal 0.999... (which may also be written as 0.9, , 0.(9), or as 0. followed by any number of 9s in the repeating decimal) denotes a real number that can be shown to be the number one. In other words, the symbols 0 … Wikipedia
Cooperative game — This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ( coalitions )… … Wikipedia
Comparison of programming languages (string functions) — String functions redirects here. For string functions in formal language theory, see String operations. Programming language comparisons General comparison Basic syntax Basic instructions Arrays … Wikipedia
Face (sociological concept) — Face, idiomatically meaning dignity/prestige, is a fundamental concept in the fields of sociology, sociolinguistics, semantics, politeness theory, psychology, political science, communication, and Face Negotiation Theory. Contents 1 Definitions 2 … Wikipedia
HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… … Encyclopedia of Judaism
Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… … Wikipedia
Marathi language — Marathi मराठी Marāṭhī Marathi written in Devanāgarī and … Wikipedia
Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… … Wikipedia
Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… … Wikipedia
Robinson-Schensted algorithm — In mathematics, the Robinson ndash;Schensted algorithm is a combinatorial algorithm, first described by Robinson in 1938, which establishes a bijective correspondence between elements of the symmetric group S n and pairs of standard Young… … Wikipedia
Ordinal arithmetic — In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an… … Wikipedia
