Search Results for ""

A manifold is said to be orientable if it can be given an orientation. Note the distinction between an "orientable manifold" and an "oriented manifold," where the former ...

A regular surface M subset R^n is called orientable if each tangent space M_p has a complex structure J_p:M_p->M_p such that p->J_p is a continuous function.

A nonsingular linear map A:R^n->R^n is orientation-preserving if det(A)>0.

A nonsingular linear map A:R^n->R^n is orientation-reversing if det(A)<0.

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

An oriented knot is an oriented link of one component, or equivalently, it is a knot which has been given an orientation. Given an oriented knot K, reversing the orientation ...

A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...

An oriented link is a link for which each connected component has been given an orientation. As oriented links are equivalent, if there is an orientation preserving ...

The oriented matroid of a finite configuration of points extracts relative position and orientation information from the configuration. An oriented matroid can be described ...

A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...