Search Results for ""

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

A number n is k-multiperfect (also called a k-multiply perfect number or k-pluperfect number) if sigma(n)=kn for some integer k>2, where sigma(n) is the divisor function. The ...

The pentatope is the simplest regular figure in four dimensions, representing the four-dimensional analog of the solid tetrahedron. It is also called the 5-cell, since it ...

A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...

If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...

A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...

A (-1,0,1)-matrix is a matrix whose elements consist only of the numbers -1, 0, or 1. The number of distinct (-1,0,1)-n×n matrices (counting row and column permutations, the ...

The number 10 (ten) is the basis for the decimal system of notation. In this system, each "decimal place" consists of a digit 0-9 arranged such that each digit is multiplied ...