Search Results for ""

A piecewise polynomial function that can have a locally very simple form, yet at the same time be globally flexible and smooth. Splines are very useful for modeling arbitrary ...

A polynomial p(x)=sumc_ix^i is said to split over a field K if p(x)=aproduct_(i)(x-alpha_i) where a and alpha_i are in K. Then the polynomial is said to split into linear ...

A short exact sequence of groups 0-->A-->B-->C-->0 (1) is called split if it essentially presents B as the direct sum of the groups A and C. More precisely, one can construct ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

A link L is said to be splittable if a plane can be embedded in R^3 such that the plane separates one or more components of L from other components of L and the plane is ...

A perimeter-bisecting line segment which originates at a vertex of a polygon. The three splitters of a triangle concur in a point known as the Nagel point Na.

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

The extension field K of a field F is called a splitting field for the polynomial f(x) in F[x] if f(x) factors completely into linear factors in K[x] and f(x) does not factor ...

Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...

The sporadic groups are the 26 finite simple groups that do not fit into any of the four infinite families of finite simple groups (i.e., the cyclic groups of prime order, ...