Search Results for ""

A pair of closed form functions (F,G) is said to be a Wilf-Zeilberger pair if F(n+1,k)-F(n,k)=G(n,k+1)-G(n,k). (1) The Wilf-Zeilberger formalism provides succinct proofs of ...

The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...

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

The associated Legendre polynomials P_l^m(x) and P_l^(-m)(x) generalize the Legendre polynomials P_l(x) and are solutions to the associated Legendre differential equation, ...

666 is the occult "number of the beast," also called the "sign of the devil" (Wang 1994), associated in the Bible with the Antichrist. It has figured in many numerological ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...