Search Results for ""
3501 - 3510 of 13135 for Discrete groupSearch Results
The partial differential equation u_t+u_(xxxxx)+30uu_(xxx)+30u_xu_(xx)+180u^2u_x=0.
Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...
Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...
A statistical distribution for which the variables may take on a continuous range of values. Abramowitz and Stegun (1972, p. 930) give a table of the parameters of most ...
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 ...
...


