Search Results for ""

Three circles packed inside a triangle such that each is tangent to the other two and to two sides of the triangle are known as Malfatti circles. The Malfatti configuration ...

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...

The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

An affine variety V is an algebraic variety contained in affine space. For example, {(x,y,z):x^2+y^2-z^2=0} (1) is the cone, and {(x,y,z):x^2+y^2-z^2=0,ax+by+cz=0} (2) is a ...

An amphichiral knot is a knot that is capable of being continuously deformed into its own mirror image. More formally, a knot K is amphichiral (also called achiral or ...

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 (upper) clique number of a graph G, denoted omega(G), is the number of vertices in a maximum clique of G. Equivalently, it is the size of a largest clique or maximal ...