TOPICS
Search

Search Results for ""


3161 - 3170 of 9127 for Logistic Map R 2Search Results
Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...
A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...
A vector Laplacian can be defined for a vector A by del ^2A=del (del ·A)-del x(del xA), (1) where the notation ✡ is sometimes used to distinguish the vector Laplacian from ...
Find nontrivial solutions to sigma(x^2)=sigma(y^2) other than (x,y)=(4,5), where sigma(n) is the divisor function. Nontrivial solutions means that solutions which are ...
The Wolstenholme numbers are defined as the numerators of the generalized harmonic number H_(n,2) appearing in Wolstenholme's theorem. The first few are 1, 5, 49, 205, 5269, ...
A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...
The Zariski topology is a topology that is well-suited for the study of polynomial equations in algebraic geometry, since a Zariski topology has many fewer open sets than in ...
The constants C_n defined by C_n=[int_0^infty|d/(dt)((sint)/t)^n|dt]-1. (1) These constants can also be written as the sums C_n=2sum_(k=1)^infty(1+x_k^2)^(-n/2), (2) and ...
The Klein bottle is a closed nonorientable surface of Euler characteristic 0 (Dodson and Parker 1997, p. 125) that has no inside or outside, originally described by Felix ...
The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...
1 ... 314|315|316|317|318|319|320 ... 913 Previous Next

...