Search Results for ""

A distance-heredity graph, also known as a completely separable graph, is a graph G such that the distance matrix of every connected vertex-induced subgraph G_V of G is the ...

The distance between two points is the length of the path connecting them. In the plane, the distance between points (x_1,y_1) and (x_2,y_2) is given by the Pythagorean ...

A double Mersenne number is a number of the form M_(M_n)=2^(2^n-1)-1, where M_n is a Mersenne number. The first few double Mersenne numbers are 1, 7, 127, 32767, 2147483647, ...

Every semisimple Lie algebra g is classified by its Dynkin diagram. A Dynkin diagram is a graph with a few different kinds of possible edges. The connected components of the ...

Elder's theorem is a generalization of Stanley's theorem which states that the total number of occurrences of an integer k among all unordered partitions of n is equal to the ...

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

The simple continued fraction of the Euler-Mascheroni constant gamma is [0; 1, 1, 2, 1, 2, 1, 4, 3, 13, 5, 1, 1, 8, 1, 2, 4, 1, 1, 40, ...] (OEIS A002852). The first few ...

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

The Fibonacci cube graph of order n is a graph on F_(n+2) vertices, where F_n is a Fibonacci number, labeled by the Zeckendorf representations of the numbers 0 to F_(n+2)-1 ...

A figurate number, also (but mostly in texts from the 1500 and 1600s) known as a figural number (Simpson and Weiner 1992, p. 587), is a number that can be represented by a ...