Search Results for ""

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

A convex function is a continuous function whose value at the midpoint of every interval in its domain does not exceed the arithmetic mean of its values at the ends of the ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...

Let a, b, and c be the side lengths of a reference triangle DeltaABC. Now let A_b be a point on the extension of the segment CA beyond A such that AA_b=a. Similarly, define ...

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

A notation for polyhedra which begins by specifying a "seed" polyhedron using a capital letter. The Platonic solids are denoted T (tetrahedron), O (octahedron), C (cube), I ...

The Conway polynomial del _L(x), sometimes known as the Conway-Alexander polynomial, is a modified version of the Alexander polynomial Delta_L(x) that was formulated by J. H. ...

A concise notation based on the concept of the tangle used by Conway (1967) to enumerate prime knots up to 11 crossings. An algebraic knot containing no negative signs in its ...