Search Results for ""

If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

A semi-oriented 2-variable knot polynomial defined by F_L(a,z)=a^(-w(L))<|L|>, (1) where L is an oriented link diagram, w(L) is the writhe of L, |L| is the unoriented diagram ...

If f is a schlicht function and D(z_0,r) is the open disk of radius r centered at z_0, then f(D(0,1)) superset= D(0,1/4), where superset= denotes a (not necessarily proper) ...

A semi-Riemannian manifold M=(M,g) is said to be Lorentzian if dim(M)>=2 and if the index I=I_g associated with the metric tensor g satisfies I=1. Alternatively, a smooth ...

The Mandart circle is the circumcircle of the extouch triangle. It has center at Kimberling center X_(1158), which has trilinear center function (1) and radius ...

The integral transform defined by g(x)=int_1^inftyt^(1/4-nu/2)(t-1)^(1/4-nu/2)P_(-1/2+ix)^(nu-1/2)(2t-1)f(t)dt (Samko et al. 1993, p. 761) or ...

By analogy with the squircle, a term first apparently used by Fernández Guasti et al. (2005), the term "rectellipse" (used here for the first time) is a natural ...

The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...

If the integral coefficients C_0, C_1, ..., C_(N-1) of the polynomial f(x)=C_0+C_1x+C_2x^2+...+C_(N-1)x^(N-1)+x^N are divisible by a prime number p, while the free term C_0 ...