Search Results for ""

Let h be the number of sides of certain skew polygons (Coxeter 1973, p. 15). Then h=(2(p+q+2))/(10-p-q).

Let j, r, and s be distinct integers (mod n), and let W_i be the point of intersection of the side or diagonal V_iV_(i+j) of the n-gon P=[V_1,...,V_n] with the transversal ...

Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...

For a semicubical parabola with parametric equations x = t^2 (1) y = at^3, (2) the involute is given by x_i = (t^2)/3-8/(27a^2) (3) y_i = -(4t)/(9a), (4) which is half a ...

A generalization of the Bessel differential equation for functions of order 0, given by zy^('')+y^'+(z+A)y=0. Solutions are y=e^(+/-iz)_1F_1(1/2∓1/2iA;1;∓2iz), where ...

An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...

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

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 set St^_v-Stv, where St^_v is a closed star and Stv is a star, is called the link of v in a simplicial complex K and is denoted Lkv (Munkres 1993, p. 11).