Search Results for ""

To find the motion of a rectangular membrane with sides of length L_x and L_y (in the absence of gravity), use the two-dimensional wave equation ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

The continuous Fourier transform is defined as f(nu) = F_t[f(t)](nu) (1) = int_(-infty)^inftyf(t)e^(-2piinut)dt. (2) Now consider generalization to the case of a discrete ...

There are at least two maps known as the Hénon map. The first is the two-dimensional dissipative quadratic map given by the coupled equations x_(n+1) = 1-alphax_n^2+y_n (1) ...

A 4-state two-dimensional Turing machine invented in the 1980s. The ant starts out on a grid containing black and white cells, and then follows the following set of rules. 1. ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...

The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...