Search Results for ""

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...

A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

A line segment on the boundary of a face, also called a side.

The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).

A distribution of values of a discrete variate represented graphically by plotting points (x_1,f_1), (x_2,f_2), ..., (x_k,f_k), and drawing a set of straight line segments ...

A theorem proved by É. Cartan in 1913 which classifies the irreducible representations of complex semisimple Lie algebras.

Let T be a maximal torus of a group G, then T intersects every conjugacy class of G, i.e., every element g in G is conjugate to a suitable element in T. The theorem is due to ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...