Search Results for ""

Curves which, when rotated in a square, make contact with all four sides. Such curves are sometimes also known as rollers. The "width" of a closed convex curve is defined as ...

One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...

A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...

A cyclide is a pair of focal conics which are the envelopes of two one-parameter families of spheres, sometimes also called a cyclid. The cyclide is a quartic surface, and ...

A cylindrical segment, sometimes also called a truncated cylinder, is the solid cut from a circular cylinder by two (or more) planes. If there are two cutting planes, one ...

A cylindrical wedge, also called a cylindrical hoof or cylindrical ungula, is a wedge cut from a cylinder by slicing with a plane that intersects the base of the cylinder. ...

The dart graph is the 5-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["DartGraph"].

Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

The Dehn invariant is a constant defined using the angles and edge lengths of a three-dimensional polyhedron. It is significant because it remains constant under polyhedron ...