Search Results for ""

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 ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...

Let K be a number field, then each fractional ideal I of K belongs to an equivalence class [I] consisting of all fractional ideals J satisfying I=alphaJ for some nonzero ...

A prime number obtained by reading digits around an analog clock. In a clockwise direction, the primes are 2, 3, 5, 7, 11, 23, 67, 89, 4567, 23456789, 23456789101112123, ... ...

The term "closure" has various meanings in mathematics. The topological closure of a subset A of a topological space X is the smallest closed subset of X containing A. If R ...

An odd prime p is called a cluster prime if every even positive integer less than p-2 can be written as a difference of two primes q-q^', where q,q^'<=p. The first 23 odd ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

The coheight of a proper ideal I of a commutative Noetherian unit ring R is the Krull dimension of the quotient ring R/I. The coheight is related to the height of I by the ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...