Search Results for ""

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

A generalization of the concept of set unions and intersections.

A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.

A lattice embedding is a one-to-one lattice homomorphism.

A point at the intersection of two or more grid lines in a point lattice.

A law in (2-valued) logic which states there is no third alternative to truth or falsehood. In other words, for any statement A, either A or not-A must be true and the other ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

A wavelet used in multiresolution representation to analyze the information content of images. The wavelet is defined by ...