Search Results for ""

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

The image on the Riemann sphere of any circle under a complex rational mapping with numerator and denominator having degrees no more than n has length no longer than 2npi.

A polynomial equation whose roots all have negative real parts. For a real quadratic equation z^2+Bz+C=0, the stability conditions are B,C>0. For a real cubic equation ...

An expression built up from statements letters by appropriate application of connectives (Mendelson 1997, p. 13).

The third Lemoine circle, a term coined here for the first time, is the circumcircle of the Lemoine triangle. It has center function alpha=(f(a,b,c))/a, (1) where f(a,b,c) is ...

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

The condition that j takes on the values j=j_1+j_2,j_1+j_2-1,...,|j_1-j_2|, denoted Delta(j_1j_2j).

Trigonometric functions of pi/p for p prime have an especially complicated Galois-minimal representation. In particular, the case cos(pi/23) requires approximately 500 MB of ...

The polyhedron compound of the truncated dodecahedron and its dual, the triakis icosahedron. The compound can be constructed from a truncated dodecahedron of unit edge length ...