Search Results for ""

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 ...

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

A number n such that the "LED representation" of n (i.e., the arrangement of horizonal and vertical lines seen on a digital clock or pocket calculator), n upside down, n in a ...

The disdyakis dodecahedron is the dual polyhedron of the Archimedean great rhombicuboctahedron A_3 and Wenninger dual W_(15). It is also called the hexakis octahedron ...

A dyadic, also known as a vector direct product, is a linear polynomial of dyads AB+CD+... consisting of nine components A_(ij) which transform as (A_(ij))^' = ...

For any alpha in A (where A denotes the set of algebraic numbers), let |alpha|^_ denote the maximum of moduli of all conjugates of alpha. Then a function ...

The angle obtained by drawing the auxiliary circle of an ellipse with center O and focus F, and drawing a line perpendicular to the semimajor axis and intersecting it at A. ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The surface of revolution given by the parametric equations x(u,v) = cosusin(2v) (1) y(u,v) = sinusin(2v) (2) z(u,v) = sinv (3) for u in [0,2pi) and v in [-pi/2,pi/2]. It is ...

The pedal curve of an ellipse with parametric equations x = acost (1) y = bsint (2) and pedal point (x_0,y_0) is given by f = ...