Search Results for ""

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...

An upper semicontinuous function whose restrictions to all complex lines are subharmonic (where defined). These functions were introduced by P. Lelong and Oka in the early ...

An analog of the polyominoes and polyiamonds in which collections of regular hexagons are arranged with adjacent sides. They are also called hexes, hexas, or polyfrobs ...

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

A positive definite function f on a group G is a function for which the matrix {f(x_ix_j^(-1))} is always positive semidefinite Hermitian.

The curve with trilinear coordinates a^t:b^t:c^t for a given power t.

There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...

Let pi be a unitary representation of a group G on a separable Hilbert space, and let R(pi) be the smallest weakly closed algebra of bounded linear operators containing all ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A polytope in n-dimensional Euclidean space R^n whose vertices are integer lattice points but which does not contain any other lattice points in its interior or on its ...