Search Results for ""

An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...

Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...

The set of points, known as boundary points, which are members of the set closure of a given set S and the set closure of its complement set. The boundary is sometimes called ...

The limit points of a set P, denoted P^'.

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M into disjoint pathwise-connected subsets. Then if F is a foliation of M, each F_alpha is called a leaf ...

A discrete subset of R^s which is closed under addition and subtraction and which contains Z^s as a subset.

Given a convex plane region with area A and perimeter p, then |N-A|<p, where N is the number of enclosed lattice points.

Given a convex plane region with area A and perimeter p, A-1/2p<N<=A+1/2p+1, where N is the number of enclosed lattice points (Nosarzewska 1948). This improves on Jarnick's ...

The use of percentages is a way of expressing ratios in terms of whole numbers. A ratio or fraction is converted to a percentage by multiplying by 100 and appending a ...

X subset= R^n is subanalytic if, for all x in R^n, there is an open set U and a bounded semianalytic set Y subset R^(n+m) such that X intersection U is the projection of Y ...