Search Results for ""

Let f_1(z), ..., f_m(z) for m>=1 be a set of E-functions that (1) form a solution of the system of differential equations y_k^'=q_(k0)+sum_(j=1)^mq_(kj)y_j for q_(kj) in C(z) ...

An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.

An operator E such that E^ap(x)=p(x+a).

The transformation T(x) = frac(1/x) (1) = 1/x-|_1/x_|, (2) where frac(x) is the fractional part of x and |_x_| is the floor function, that takes a continued fraction ...

A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = 1/3u^3-1/2v^2. (3) The coefficients of the coefficients of the first fundamental form are E ...

The shoelace formula, also known as Gauss's area formula, the shoelace algorithm, shoelace method, or surveyor's formula, is a name sometimes given to the polygon area ...

The Japanese variant of the game of chess. Shogi is played on a 9×9 uncheckered board, and each player begins with 20 pieces: one king, one rook, one bishop, two gold ...

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...