Search Results for ""

The term "null graph" is used both to refer to any empty graph and to the empty graph on 0 nodes. Because of the conflicting usage, it is probably best to avoid use of the ...

An odd permutation is a permutation obtainable from an odd number of two-element swaps, i.e., a permutation with permutation symbol equal to -1. For initial set {1,2,3,4}, ...

A multimagic square such that the first, second, third, fourth, and fifth powers of the elements all yield magic squares is known as a pentamagic square. The first known ...

If G is a weighted tree with weights w_i>1 assigned to each vertex v_i, then G is perfectly weighted if the matrix M_G=[w_1 0 ... 0; 0 w_2 ... 0; | ... ... |; 0 0 ... ...

The integral kernel in the Poisson integral, given by K(psi)=1/(2pi)(1-|z_0|^2)/(|z_0-e^(ipsi)|^2) (1) for the open unit disk D(0,1). Writing z_0=re^(itheta) and taking ...

The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

The quotient space X/∼ of a topological space X and an equivalence relation ∼ on X is the set of equivalence classes of points in X (under the equivalence relation ∼) ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then the Selberg zeta function is defined as ...