TOPICS
Search

Search Results for ""


2611 - 2620 of 9127 for Logistic Map R 2Search Results
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 Steenrod algebra has to do with the cohomology operations in singular cohomology with integer mod 2 coefficients. For every n in Z and i in {0,1,2,3,...} there are ...
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) ...
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. ...
Given an n-dimensional vector x=[x_1; x_2; |; x_n], (1) a general vector norm |x|, sometimes written with a double bar as ||x||, is a nonnegative norm defined such that 1. ...
1 ... 259|260|261|262|263|264|265 ... 913 Previous Next

...