TOPICS
Search

Search Results for ""


11671 - 11680 of 13135 for Computational GeometrySearch Results
In the above illustration, black dots appear to form and vanish at the intersections of the gray horizontal and vertical lines. When focusing attention on a single white dot, ...
A subset E of a topological space S is said to be of second category in S if E cannot be written as the countable union of subsets which are nowhere dense in S, i.e., if ...
In the most commonly used convention (e.g., Apostol 1967, pp. 205-207), the second fundamental theorem of calculus, also termed "the fundamental theorem, part II" (e.g., ...
The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...
Every smooth nonzero vector field on the 3-sphere has at least one closed orbit. The conjecture was proposed in 1950 and proved true for Hopf maps. The conjecture was ...
Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...
A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...
The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...
A sequent is an expression Gamma|-Lambda, where Gamma and Lambda are (possibly empty) sequences of formulas. Here, Gamma is called the antecedent and Lambda is called the ...
Series reversion is the computation of the coefficients of the inverse function given those of the forward function. For a function expressed in a series with no constant ...

...