Search Results for ""

Two unit-speed plane curves which have the same curvature differ only by a Euclidean motion.

7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...

The plane determined by the points x_1, x_2, and x_3 and the line passing through the points x_4 and x_5 intersect in a point which can be determined by solving the four ...

A plane partition whose solid Ferrers diagram is invariant under the rotation which cyclically permutes the x-, y-, and z-axes. Macdonald's plane partition conjecture gives a ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...

Macdonald's plane partition conjecture proposes a formula for the number of cyclically symmetric plane partitions (CSPPs) of a given integer whose Ferrers diagrams fit inside ...

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...