Search Results for ""

A graph G is fully reconstructible in C^d if the graph is determined from its d-dimensional measurement variety. If G is globally rigid in R^d on n>=d+2 vertices, then G is ...

If u_n>0 and given B(n) a bounded function of n as n->infty, express the ratio of successive terms as |(u_n)/(u_(n+1))|=1+h/n+(B(n))/(n^r) for r>1. The series converges for ...

A global field is either a number field, a function field on an algebraic curve, or an extension of transcendence degree one over a finite field. From a modern point of view, ...

For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...

The coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...

In the study of non-associative algebra, there are at least two different notions of what the half-Bol identity is. Throughout, let L be an algebraic loop and let x, y, and z ...

There are at least two distinct (though related) notions of the term Hilbert algebra in functional analysis. In some literature, a linear manifold A of a (not necessarily ...

Let a chord of constant length be slid around a smooth, closed, convex curve C, and choose a point on the chord which divides it into segments of lengths p and q. This point ...

An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra, H(x,y)=!(!x v y) v !(!x v !y)=x, (1) where !x denotes NOT and x v y denotes OR. Taken ...