Search Results for ""

A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...

There are a few plane curves known as "bean curves." The bean curve identified by Cundy and Rowllet (1989, p. 72) is the quartic curve given by the implicit equation ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

There are two curves known as the butterfly curve. The first is the sextic plane curve given by the implicit equation y^6=x^2-x^6 (1) (Cundy and Rollett 1989, p. 72; left ...

Catastrophe theory studies how the qualitative nature of equation solutions depends on the parameters that appear in the equations. Subspecializations include bifurcation ...

Cauchy's functional equation is the equation f(x+y)=f(x)+f(y). It was proved by Cauchy in 1821 that the only continuous solutions of this functional equation from R into R ...

If f(z) is analytic in some simply connected region R, then ∮_gammaf(z)dz=0 (1) for any closed contour gamma completely contained in R. Writing z as z=x+iy (2) and f(z) as ...