Search Results for ""

An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

In bipolar coordinates, the Helmholtz differential equation is not separable, but Laplace's equation is.

P_n(cosalpha)=(sqrt(2))/piint_0^alpha(cos[(n+1/2)phi])/(sqrt(cosphi-cosalpha))dphi, where P_n(x) is a Legendre polynomial.

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

A repunit prime is a repunit (i.e., a number consisting of copies of the single digit 1) that is also a prime number. The base-10 repunit (possibly probable) primes ...

N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...

Any real function u(x,y) with continuous second partial derivatives which satisfies Laplace's equation, del ^2u(x,y)=0, (1) is called a harmonic function. Harmonic functions ...

C=tauT+kappaB, where tau is the torsion, kappa is the curvature, T is the tangent vector, and B is the binormal vector.

An operator in logic which returns either true or false.