Search Results for ""

F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.

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

The Akhmim wooden tablet, often called the Cairo wooden tablet, is a document dating to 2000 BC, near the beginning of the Egyptian Middle Kingdom. It is housed in the Egypt ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

A necessary and sufficient condition for a sequence S_i to converge. The Cauchy criterion is satisfied when, for all epsilon>0, there is a fixed number N such that ...

A sequence of real numbers {x_n} is equidistributed on an interval [a,b] if the probability of finding x_n in any subinterval is proportional to the subinterval length. The ...