Search Results for ""

The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

A function is said to be piecewise constant if it is locally constant in connected regions separated by a possibly infinite number of lower-dimensional boundaries. The ...

Let a simple graph G have n vertices, chromatic polynomial P(x), and chromatic number chi. Then P(G) can be written as P(G)=sum_(i=0)^ha_i·(x)_(p-i), where h=n-chi and (x)_k ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...

The order of a finite field is the number of elements it contains.