nondecreasing
Look at other dictionaries:
nondecreasing — /non di kree sing/, adj. 1. not decreasing. 2. Math. increasing (def. 2). [NON + DECREASING] * * * … Universalium
nondecreasing — /non di kree sing/, adj. 1. not decreasing. 2. Math. increasing (def. 2). [NON + DECREASING] … Useful english dictionary
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
Chebyshev's inequality — For the similarly named inequality involving series, see Chebyshev s sum inequality. In probability theory, Chebyshev’s inequality (also spelled as Tchebysheff’s inequality) guarantees that in any data sample or probability distribution, nearly… … Wikipedia
Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… … Wikipedia
Convex conjugate — In mathematics, convex conjugation is a generalization of the Legendre transformation. It is also known as Legendre–Fenchel transformation or Fenchel transformation (after Adrien Marie Legendre and Werner Fenchel). Contents 1 Definition 2… … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
Daniell integral — In mathematics, the Daniell integral is a type of integration that generalizes the concept of more elementary versions such as the Riemann integral to which students are typically first introduced. One of the main difficulties with the… … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Massera's lemma — In stability theory and nonlinear control, Massera s lemma, named after José Luis Massera, deals with the construction of the Lyapunov function to prove the stability of a dynamical system.[1] The lemma appears in (Massera 1949, p. 716) as… … Wikipedia
