Search Results for ""
10021 - 10030 of 13134 for Extremal graph theorySearch Results
Let S be a semigroup and alpha a positive real-valued function on S such that alpha(st)<=alpha(s)alpha(t) (s,t in S). If l^1(S,alpha) is the set of all complex-valued ...
A set S is discrete in a larger topological space X if every point x in S has a neighborhood U such that S intersection U={x}. The points of S are then said to be isolated ...
The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...
A discriminant is a quantity (usually invariant under certain classes of transformations) which characterizes certain properties of a quantity's roots. The concept of the ...
A statement is in disjunctive normal form if it is a disjunction (sequence of ORs) consisting of one or more disjuncts, each of which is a conjunction (AND) of one or more ...
An n-dimensional disk (sometimes spelled "disc") of radius r is the collection of points of distance <=r (closed disk) or <r (open disk) from a fixed point in Euclidean ...
A disk algebra is an algebra of functions which are analytic on the open unit disk in C and continuous up to the boundary. A representative measure for a point x in the ...
To generate random points over the unit disk, it is incorrect to use two uniformly distributed variables r in [0,1] and theta in [0,2pi) and then take x = rcostheta (1) y = ...
The ditrigonal dodecadodecahedron, also called the ditrigonal dodecahedron, is the uniform polyhedron with Maeder index 41 (Maeder 1997), Wenninger index 80 (Wenninger 1989), ...
The divergence theorem, more commonly known especially in older literature as Gauss's theorem (e.g., Arfken 1985) and also known as the Gauss-Ostrogradsky theorem, is a ...
...
View search results from all Wolfram sites (34319 matches)

