Search Results for ""

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

The Brocard circle, also known as the seven-point circle, is the circle having the line segment connecting the circumcenter O and symmedian point K of a triangle DeltaABC as ...

Cantellation, also known as (polyhedron) expansion (Stott 1910, not to be confused with general geometric expansion) is the process of radially displacing the edges or faces ...

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

The power of a fixed point A with respect to a circle of radius r and center O is defined by the product p=AP×AQ, (1) where P and Q are the intersections of a line through A ...

The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...

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 continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

The Engel expansion, also called the Egyptian product, of a positive real number x is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...