Search Results for ""

The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

A triangle center is said to be polynomial iff there is a triangle center function f that is a polynomial in a, b, and c (Kimberling 1998, p. 46).

Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...

Polyrects are polyforms obtained from a rectangular grid, illustrated above. The numbers of polyrects with n=1, 2, ... components are 1, 2, 3, 9, 21, 68, 208, ... (OEIS ...

Polyrhombs are polyforms obtained from a rhombic grid, illustrated above. The numbers of polyrhombs with n=1, 2, ... components are 1, 1, 3, 7, 20, 62, 204, ... (OEIS ...

Lachlan's terms for a collection of n points.

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

A one-dimensional line segment where two two-dimensional faces of an n-dimensional polytope meet, also called a side.

There are 10 stellated regular 4-polytopes (Wells 1991, p. 209).