Search Results for ""

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

Any pair of equations giving the real part of a function as an integral of its imaginary part and the imaginary part as an integral of its real part. Dispersion relationships ...

The system of partial differential equations u_t = (u^2-u_x+2v)_x (1) v_y = (2uv+v_x)_x. (2)

A tetrahedron with identical isosceles or scalene faces.

A proof based on a dissection which shows the formula for the area of a plane figure or of the volume of a solid. Dozens of different dissection proofs are known for the ...

A puzzle in which one object is to be converted to another by making a finite number of cuts and reassembling it. The cuts are often, but not always, restricted to straight ...

A dynamical system in which the phase space volume contracts along a trajectory. This means that the generalized divergence is less than zero, (partialf_i)/(partialx_i)<0, ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

The distribution parameter of a noncylindrical ruled surface parameterized by x(u,v)=sigma(u)+vdelta(u), (1) where sigma is the striction curve and delta the director curve, ...

A multiplication * is said to be right distributive if (x+y)z=xz+yz for every x, y, and z. Similarly, it is said to be left distributive if z(x+y)=zx+zy for every x, y, and ...