Search Results for ""

A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...

A dot plot, also called a dot chart, is a type of simple histogram-like chart used in statistics for relatively small data sets where values fall into a number of discrete ...

An equivalence relation on a set X is a subset of X×X, i.e., a collection R of ordered pairs of elements of X, satisfying certain properties. Write "xRy" to mean (x,y) is an ...

Exponential growth is the increase in a quantity N according to the law N(t)=N_0e^(lambdat) (1) for a parameter t and constant lambda (the analog of the decay constant), ...

A fiber of a map f:X->Y is the preimage of an element y in Y. That is, f^(-1)(y)={x in X:f(x)=y}. For instance, let X and Y be the complex numbers C. When f(z)=z^2, every ...

An origami configuration that can be pressed to a plane figure without crumpling it or adding new creases.