Search Results for ""

The theory of point sets and sequences having a uniform distribution. Uniform distribution theory is important in modeling and simulation, and especially in so-called Monte ...

An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...

A unitary perfect number is a number n which is the sum of its unitary divisors with the exception of n itself. There are no odd unitary perfect numbers, and it has been ...

The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Delta(x_1,...,x_n) = |1 x_1 x_1^2 ... x_1^(n-1); 1 x_2 x_2^2 ... x_2^(n-1); | | | ... |; 1 x_n x_n^2 ... x_n^(n-1)| (1) = product_(i,j; i>j)(x_i-x_j) (2) (Sharpe 1987). For ...

Vardi's integral is the beautiful definite integral int_(pi/4)^(pi/2)lnlntanxdx = pi/2ln[sqrt(2pi)(Gamma(3/4))/(Gamma(1/4))] (1) = pi/4ln[(4pi^3)/(Gamma^4(1/4))] (2) = ...

A positive integer n is a veryprime iff all primes p<=sqrt(n) satisfy {|2[n (mod p)]-p|<=1 very strong; |2[n (mod p)]-p|<=sqrt(p) strong; |2[n (mod p)]-p|<=p/2 weak. (1) The ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...