Search Results for ""

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closed if for any sequence of vectors v_n in D(A) such that v_n->v and Av_n->x as n->infty, it ...

A subset M of a Hilbert space H is a linear manifold if it is closed under addition of vectors and scalar multiplication.

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closable if it has a closed extension B:D(B)->H where D(A) subset D(B). Closable operators are ...

11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...

The unit of information obtained by using the natural logarithm lnx instead of the base-2 logarithm log_2x=lgx when defining entropy and related information theoretic ...

The theory of non-uniformly hyperbolic diffeomorphisms.

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...