Search Results for ""

Given an undirected graph, a degree sequence is a monotonic nonincreasing sequence of the vertex degrees (valencies) of its graph vertices. The number of degree sequences for ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

A Gray code is an encoding of numbers so that adjacent numbers have a single digit differing by 1. The term Gray code is often used to refer to a "reflected" code, or more ...

Consider a broadcast scheme on a connected graph from an originator vertex v in a graph G consisting of a sequence of parallel calls starting from v. In each time step, every ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...

Some computations allow shortcuts which can be used to speed them up. Consider the operation of raising a number to a positive integer power. It is possible, for example, to ...

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...