Search Results for ""

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of ...

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 ...

The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...

A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...

If two points A and A^' are inverse with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to the line of the points AA^' ...

If two points A and A^' are inverse (sometimes called conjugate) with respect to a circle (the inversion circle), then the straight line through A^' which is perpendicular to ...

Reciprocation is an incidence-preserving transformation in which points are transformed into their polars. A projective geometry-like duality principle holds for ...

Every smooth nonzero vector field on the 3-sphere has at least one closed orbit. The conjecture was proposed in 1950 and proved true for Hopf maps. The conjecture was ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...