Search Results for ""

The Pell numbers are the numbers obtained by the U_ns in the Lucas sequence with P=2 and Q=-1. They correspond to the Pell polynomial P_n(x) and Fibonacci polynomial F_n(x) ...

The Riemann-Siegel formula is a formula discovered (but not published) by Riemann for computing an asymptotic formula for the Riemann-Siegel function theta(t). The formula ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

A generalization of Grassmann coordinates to m-D algebraic varieties of degree d in P^n, where P^n is an n-dimensional projective space. To define the Chow coordinates, take ...

A delay differential equation (also called a differential delay equation or difference-differential equation, although the latter term has a different meaning in the modern ...

A dependent variable is a variable whose value depends on the values of one or more other independent variables. This notion comes up regularly in a variety of contexts. In ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

Given a ring R with identity, the general linear group GL_n(R) is the group of n×n invertible matrices with elements in R. The general linear group GL_n(q) is the set of n×n ...