Search Results for ""

A line segment connecting nonadjacent polyhedron vertices sharing a common face in a parallelepiped or other similar solid.

An (n-1)-dimensional face of an n-dimensional polytope. A procedure for generating facets is known as faceting.

Using a set of corners of a solid that lie in a plane to form the polygon vertices of a new polygon is called faceting. Such polygons may outline new faces that join to ...

Factor analysis allows the determination of common axes influencing sets of independent measured sets. It is "the granddaddy of multivariate techniques (Gould 1996, pp. ...

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

The knots that make up a knot sum of a composite knot are known as factor knots (Adams 1994, p. 8).

If P(x,y) and P(x^',y^') are two points on an ellipse (x^2)/(a^2)+(y^2)/(b^2)=1, (1) with eccentric angles phi and phi^' such that tanphitanphi^'=b/a (2) and A=P(a,0) and ...

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...

A representation phi of a group G is faithful if it is one-to-one, i.e., if phi(g)=phi(h) implies g=h for g,h in G. Equivalently, phi is faithful if phi(g)=I_n implies g=e, ...