Search Results for ""

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

The beautiful arrangement of leaves in some plants, called phyllotaxis, obeys a number of subtle mathematical relationships. For instance, the florets in the head of a ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

The total number of contravariant and covariant indices of a tensor. The rank R of a tensor is independent of the number of dimensions N of the underlying space. An intuitive ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...

A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A definition assigns properties to some sort of mathematical object. For example, Euclid's Elements starts with a number of definitions, such as "a line is a breadthless ...