Search Results for ""

The transitive reflexive reduction of a partial order. An element z of a partially ordered set (X,<=) covers another element x provided that there exists no third element y ...

Every bounded operator T acting on a Hilbert space H has a decomposition T=U|T|, where |T|=(T^*T)^(1/2) and U is a partial isometry. This decomposition is called polar ...

D = f_(xx)f_(yy)-f_(xy)f_(yx) (1) = f_(xx)f_(yy)-f_(xy)^2, (2) where f_(ij) are partial derivatives.

Young's lattice Y_p is the partial order of partitions contained within a partition p ordered by containment (Stanton and White 1986; Skiena 1990, p. 77).

The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...

A chain complex is a sequence of maps ...-->^(partial_(i+1))C_i-->^(partial_i)C_(i-1)-->^(partial_(i-1))..., (1) where the spaces C_i may be Abelian groups or modules. The ...

Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...

A simple continued fraction is a special case of a generalized continued fraction for which the partial numerators are equal to unity, i.e., a_n=1 for all n=1, 2, .... A ...

Consider the family of ellipses (x^2)/(c^2)+(y^2)/((1-c)^2)-1=0 (1) for c in [0,1]. The partial derivative with respect to c is -(2x^2)/(c^3)+(2y^2)/((1-c)^3)=0 (2) ...

Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...