Search Results for ""

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 abundance of a number n, sometimes also called the abundancy (a term which in this work, is reserved for a different but related quantity), is the quantity ...

An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...

Andrica's conjecture states that, for p_n the nth prime number, the inequality A_n=sqrt(p_(n+1))-sqrt(p_n)<1 holds, where the discrete function A_n is plotted above. The ...

The arf invariant is a link invariant that always has the value 0 or 1. A knot has Arf invariant 0 if the knot is "pass equivalent" to the unknot and 1 if it is pass ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

B-trees were introduced by Bayer (1972) and McCreight. They are a special m-ary balanced tree used in databases because their structure allows records to be inserted, ...

Given an n-ball B^n of radius R, find the distribution of the lengths s of the lines determined by two points chosen at random within the ball. The probability distribution ...

There are a few plane curves known as "bean curves." The bean curve identified by Cundy and Rowllet (1989, p. 72) is the quartic curve given by the implicit equation ...

A bicubic graph is a bipartite cubic graph. Tutte (1971) conjectured that all 3-connected bicubic graphs are Hamiltonian (the Tutte conjecture), but a number of bicubic ...