Search Results for ""

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...

The letter O is used for a number of different purposes in mathematics. The double-struck O is sometimes used to represent octonions. The symbols O(x) (sometimes called the ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

The number of bases in which 1/p is a repeating decimal (actually, repeating b-ary) of length l is the same as the number of fractions 0/(p-1), 1/(p-1), ..., (p-2)/(p-1) ...

The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...

If p is a prime >3, then the numerator of the harmonic number H_(p-1)=1+1/2+1/3+...+1/(p-1) (1) is divisible by p^2 and the numerator of the generalized harmonic number ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

Perhaps the most commonly-studied oriented point lattice is the so-called north-east lattice which orients each edge of L in the direction of increasing coordinate-value. ...

A set A of integers is productive if there exists a partial recursive function f such that, for any x, the following holds: If the domain of phi_x is a subset of A, then f(x) ...