Search Results for ""

In plane geometry, a chord is the line segment joining two points on a curve. The term is often used to describe a line segment whose ends lie on a circle. The term is also ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The locus of the point at which two given circles possess the same circle power is a straight line perpendicular to the line joining the midpoints of the circle and is known ...

A chordless cycle of a graph G is a graph cycle in G that has no cycle chord. Unfortunately, there are conflicting conventions on whether or not 3-cycles should be considered ...

A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...

A generalization of Grassmann coordinates to m-D algebraic varieties of degree d in P^n, where P^n is an n-dimensional projective space. To define the Chow coordinates, take ...

The intersection product for classes of rational equivalence between cycles on an algebraic variety.

The set C_(n,m,d) of all m-D varieties of degree d in an n-dimensional projective space P^n into an M-D projective space P^M.

The Christmas stocking theorem, also known as the hockey stick theorem, states that the sum of a diagonal string of numbers in Pascal's triangle starting at the nth entry ...

For three consecutive orders of an orthonormal polynomial, the following relationship holds for n=2, 3, ...: p_n(x)=(A_nx+B_n)p_(n-1)(x)-C_np_(n-2)(x), (1) where A_n>0, B_n, ...