Search Results for ""

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

The fish curve is a term coined in this work for the ellipse negative pedal curve with pedal point at the focus for the special case of the eccentricity e^2=1/2. For an ...

Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...

When the Gaussian curvature K is everywhere negative, a surface is called anticlastic and is saddle-shaped. A surface on which K is everywhere positive is called synclastic. ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...

The lines joining the vertices A, B, and C of a given triangle DeltaABC with the circumcenters of the triangles DeltaBCO, DeltaCAO, and DeltaABO (where O is the circumcenter ...