Search Results for ""

A two-dimensional piecewise linear map defined by x_(n+1) = 1-y_n+|x_n| (1) y_(n+1) = x_n. (2) The map is chaotic in the filled region above and stable in the six hexagonal ...

The inhomogeneous Helmholtz differential equation is del ^2psi(r)+k^2psi(r)=rho(r), (1) where the Helmholtz operator is defined as L^~=del ^2+k^2. The Green's function is ...

Define psi(x)={1 0<=x<1/2; -1 1/2<x<=1; 0 otherwise (1) and psi_(jk)(x)=psi(2^jx-k) (2) for j a nonnegative integer and 0<=k<=2^j-1. So, for example, the first few values of ...

The hat is a caret-shaped symbol commonly placed on top of variables to give them special meaning. The symbol x^^ is voiced "x-hat" (or sometimes as "x-roof") in mathematics, ...

A regular two-dimensional arrangement of squares separated by vertical and horizontal "canals." Looking at the grid produces the illusion of gray spots in the white area ...

Let M be a Riemannian manifold, and let the topological metric on M be defined by letting the distance between two points be the infimum of the lengths of curves joining the ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

The invertible matrix theorem is a theorem in linear algebra which gives a series of equivalent conditions for an n×n square matrix A to have an inverse. In particular, A is ...

Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...