Search Results for ""

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

A curve which has at least multiplicity r_i-1 at each point where a given curve (having only ordinary singular points and cusps) has a multiplicity r_i is called the adjoint ...

The mathematical study of how given quantities can be approximated by other (usually simpler) ones under appropriate conditions. Approximation theory also studies the size ...

A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...

The nth order Bernstein expansion of a function f(x) in terms of a variable x is given by B_n(f,x)=sum_(j=0)^n(n; j)x^j(1-x)^(n-j)f(j/n), (1) (Gzyl and Palacios 1997, Mathé ...

Let f be a bounded analytic function on D(0,1) vanishing to order m>=0 at 0 and let {a_j} be its other zeros, listed with multiplicities. Then ...

The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...

The envelope of the lines connecting corresponding points on the Jacobian curve and Steinerian curve. The Cayleyian curve of a net of curves of order n has the same curve ...