Search Results for ""

In nonstandard analysis, the limitation to first-order analysis can be avoided by using a construction known as a superstructure. Superstructures are constructed in the ...

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...

Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...

(Bailey 1935, p. 25), where _7F_6(a_1,...,a_7;b_1,...,b_6) and _4F_3(a_1,...,a_4;b_1,b_2,b_3) are generalized hypergeometric functions with argument z=1 and Gamma(z) is the ...

The q-analog of pi pi_q can be defined by setting a=0 in the q-factorial [a]_q!=1(1+q)(1+q+q^2)...(1+q+...+q^(a-1)) (1) to obtain ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...