Search Results for ""

An operator A^~ is said to be antiunitary if it satisfies: <A^~f_1|A^~f_2> = <f_1|f_2>^_ (1) A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (2) A^~cf(x) = c^_A^~f(x), (3) where ...

Construct a chain C of 2n components in a solid torus V. Now thicken each component of C slightly to form a chain C_1 of 2n solid tori in V, where pi_1(V-C_1)=pi_1(V-C) via ...

The vertex of an isosceles triangle having angle different from the two equal angles is called the apex of the isosceles triangle. The common polygon vertex at the top of a ...

A term sometimes used to describe a map projection which is neither equal-area nor conformal (Lee 1944; Snyder 1987, p. 4).

The greatest radial distance of an ellipse as measured from a focus. Taking v=pi in the equation of an ellipse r=(a(1-e^2))/(1+ecosv) gives the apoapsis distance r_+=a(1+e). ...

Given a circle, the apothem is the perpendicular distance r from the midpoint of a chord to the circle's center. It is also equal to the radius R minus the sagitta h, r=R-h. ...

A homographic transformation x_1 = (ax+by+c)/(a^('')x+b^('')y+c^('')) (1) y_1 = (a^'x+b^'y+c^')/(a^('')x+b^('')y+c^('')) (2) with t_1 substituted for t according to ...

A Banach space X has the approximation property (AP) if, for every epsilon>0 and each compact subset K of X, there is a finite rank operator T in X such that for each x in K, ...

Araya and Wiener (2011) found the two cubic planar hypohamiltonian graphs on 70 and 88 vertices, respectively, illustrated above.

A directed graph is called an arborescence if, from a given node x known as the root vertex, there is exactly one elementary path from x to every other node y.