Search Results for ""

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

If a points A^', B^', and C^' are marked on each side of a triangle DeltaABC, one on each side (or on a side's extension), then the three Miquel circles (each through a ...

A 2-dimensional discrete percolation model is said to be mixed if both graph vertices and graph edges may be "blocked" from allowing fluid flow (i.e., closed in the sense of ...

The modular equation of degree n gives an algebraic connection of the form (K^'(l))/(K(l))=n(K^'(k))/(K(k)) (1) between the transcendental complete elliptic integrals of the ...

A module is a mathematical object in which things can be added together commutatively by multiplying coefficients and in which most of the rules of manipulating vectors hold. ...

A Moiré pattern is an interference pattern produced by overlaying similar but slightly offset templates. A simple example is obtained by taking two identical ruled ...

What is the sofa of greatest area S which can be moved around a right-angled hallway of unit width? Hammersley (Croft et al. 1994) showed that S>=pi/2+2/pi=2.2074... (1) ...

A square which is magic under multiplication instead of addition (the operation used to define a conventional magic square) is called a multiplication magic square. Unlike ...

The Nagel line is the term proposed for the first time in this work for the line on which the incenter I, triangle centroid G, Spieker center Sp, and Nagel point Na lie. ...