Search Results for ""

A plane partition which is invariant under permutation of the three axes and which is equal to its complement (i.e., the collection of cubes that are in a given box but do ...

On July 10, 2003, Eric Weisstein computed the numbers of n×n (0,1)-matrices all of whose eigenvalues are real and positive, obtaining counts for n=1, 2, ... of 1, 3, 25, 543, ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

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

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

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

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...

In an additive group G, the additive inverse of an element a is the element a^' such that a+a^'=a^'+a=0, where 0 is the additive identity of G. Usually, the additive inverse ...