Search Results for ""

A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

Let X and Y be sets, and let R subset= X×Y be a relation on X×Y. Then R is a concurrent relation if and only if for any finite subset F of X, there exists a single element p ...

The triangulation point Y of a reference triangle DeltaABC for which triangles DeltaBYC, DeltaCYA, and DeltaAYB have congruent incircles. It is a special case of an Elkies ...

Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...

A connection game is a board game in which players compete to develop or complete a type of topological connection with their pieces. This could involve forming a path ...

A function, or the symbol representing a function, which corresponds to English conjunctions such as "and," "or," "not," etc. that takes one or more truth values as input and ...

The cornoid is the curve illustrated above given by the parametric equations x = acost(1-2sin^2t) (1) y = asint(1+2cos^2t), (2) where a>0. It is a sextic algebraic curve with ...

A family gamma of nonempty subsets of X whose union contains the given set X (and which contains no duplicated subsets) is called a cover (or covering) of X. For example, ...

A curve of order n is generally determined by n(n+3)/2 points. So a conic section is determined by five points and a cubic curve should require nine. But the Maclaurin-Bézout ...