Search Results for ""

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

Eisenstein's irreducibility criterion is a sufficient condition assuring that an integer polynomial p(x) is irreducible in the polynomial ring Q[x]. The polynomial ...

The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

The longest increasing (contiguous) subsequence of a given sequence is the subsequence of increasing terms containing the largest number of elements. For example, the longest ...

The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...

In simple algebra, multiplication is the process of calculating the result when a number a is taken b times. The result of a multiplication is called the product of a and b, ...

A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

If f_1(x), ..., f_s(x) are irreducible polynomials with integer coefficients such that no integer n>1 divides f_1(x), ..., f_s(x) for all integers x, then there should exist ...