Search Results for ""

The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

A curve y(x) is osculating to f(x) at x_0 if it is tangent at x_0 and has the same curvature there. Osculating curves therefore satisfy y^((k))(x_0)=f^((k))(x_0) for k=0, 1, ...

A singular point such that every neighborhood of the point intersects itself. Pinch points are also called Whitney singularities or branch points.

Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...

The power polynomials x^n are an associated Sheffer sequence with f(t)=t, (1) giving generating function sum_(k=0)^inftyx^kt^k=1/(1-tx) (2) and exponential generating ...

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...