Search Results for ""

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

A number n is called a k e-perfect number if sigma_e(n)=kn, where sigma_e(n) is the sum of the e-divisors of n.

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

If for each positive integer h, the sequence {u_(n+h)-u_n} is uniformly distributed (mod 1), then the sequence {u_n} is uniformly distributed (mod 1) (Montgomery 2001).

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...

A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...

Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...

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