Search Results for ""

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

The unitary divisor function sigma_k^*(n) is the analog of the divisor function sigma_k(n) for unitary divisors and denotes the sum-of-kth-powers-of-the-unitary divisors ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

A stereogram made of two pictures, one red and one blue, taken from offset positions. When the pictures are viewed through glasses with one lens of each color, the picture ...

A flow defined analogously to the axiom A diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...

A method for mapping three-dimensional figures onto the plane.

The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...

A two-dimensional map which is conjugate to the Hénon map in its nondissipative limit. It is given by x^' = x+y^' (1) y^' = y+epsilony+kx(x-1)+muxy. (2)

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

The slicing of a three-dimensional object by a plane (or more general slice).