TOPICS
Search

Search Results for ""


291 - 300 of 352 for IntervalSearch Results
There are no fewer than three distinct notions of curve throughout mathematics. In topology, a curve is a one-dimensional continuum (Charatonik and Prajs 2001). In algebraic ...
A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...
Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...
A formula for the Bell polynomial and Bell numbers. The general formula states that B_n(x)=e^(-x)sum_(k=0)^infty(k^n)/(k!)x^k, (1) where B_n(x) is a Bell polynomial (Roman ...
The Fano plane is the configuration consisting of the two-dimensional finite projective plane over GF(2) ("of order two"), illustrated above. It is a block design with nu=7, ...
A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...
Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...
In the Minkowski space of special relativity, a four-vector is a four-element vector x^mu=(x^0,x^1,x^2,x^3) that transforms under a Lorentz transformation like the position ...
Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...
A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...
1 ... 27|28|29|30|31|32|33 ... 36 Previous Next

...