Search Results for ""

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

Polysticks, sometimes also known as polyedges, are polyforms obtained from the edges of a regular grid. Square polysticks are polyforms obtained from the edges of a regular ...

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...

Given a series of positive terms u_i and a sequence of positive constants {a_i}, use Kummer's test rho^'=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)) (1) with a_n=n, giving ...

The Riemann-Siegel integral formula is the following representation of the xi-function xi(s) found in Riemann's Nachlass by Bessel-Hagen in 1926 (Siegel 1932; Edwards 2001, ...

The square wave, also called a pulse train, or pulse wave, is a periodic waveform consisting of instantaneous transitions between two levels. The square wave is sometimes ...

The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...

Color each segment of a knot diagram using one of three colors. If 1. At any crossing, either the colors are all different or all the same, and 2. At least two colors are ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

Let points A^', B^', and C^' be marked off some fixed distance x along each of the sides BC, CA, and AB. Then the lines AA^', BB^', and CC^' concur in a point U known as the ...