Search Results for ""

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

Let K be the knot above, and let the homomorphism h taking a knot K_1 to its companion knot K_2 be faithful (i.e., taking the preferred longitude and meridian of the original ...

Let C be a smooth geometrically connected projective curve over F_q with q=p^s a prime power. Let infty be a fixed closed point of X but not necessarily F_q-rational. A ...

A stationary point process X is said to drive a model of continuum percolation theory if one of the characterizing axioms of the model hinges on the existence of X. In this ...

The dual of a regular tessellation is formed by taking the center of each polygon as a vertex and joining the centers of adjacent polygons. The triangular and hexagonal ...

The dual vector space to a real vector space V is the vector space of linear functions f:V->R, denoted V^*. In the dual of a complex vector space, the linear functions take ...

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

The Dürer folium is a special case of the rose curve with n=1. It is therefore also an epitrochoid. It has polar equation r=asin(theta/2) (1) and can be written as a ...

The class of curve known as Dürer's conchoid appears in Dürer's work Instruction in Measurement with Compasses and Straight Edge (1525) and arose in investigations of ...

A variable that appears in a calculation only as a placeholder and which disappears completely in the final result. For example, in the integral int_0^xf(x^')dx^', x^' is a ...