Search Results for ""
1001 - 1010 of 2461 for Bott_periodicity_theoremSearch Results
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
Curves which, when rotated in a square, make contact with all four sides. Such curves are sometimes also known as rollers. The "width" of a closed convex curve is defined as ...
The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...
Slater (1960, p. 31) terms the identity _4F_3[a,1+1/2a,b,-n; 1/2a,1+a-b;1+a+n]=((1+a)_n(1/2+1/2a-b)_n)/((1/2+1/2a)_n(1+a-b)_n) for n a nonnegative integer the "_4F_3[1] ...
Let p be an irregular prime, and let P=rp+1 be a prime with P<p^2-p. Also let t be an integer such that t^3≢1 (mod P). For an irregular pair (p,2k), form the product ...
Let P be the principal (initial investment), r be the annual compounded rate, i^((n)) the "nominal rate," n be the number of times interest is compounded per year (i.e., the ...
The catacaustic of one arch of a cycloid given parametrically as x = t-sint (1) y = 1-cost (2) is a complicated expression for an arbitrary radiant point. For the case of the ...
Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...
An n-cycle is a finite sequence of points Y_0, ..., Y_(n-1) such that, under a map G, Y_1 = G(Y_0) (1) Y_2 = G(Y_1) (2) Y_(n-1) = G(Y_(n-2)) (3) Y_0 = G(Y_(n-1)). (4) In ...
The period for a quasiperiodic trajectory to pass through the same point in a surface of section. If the rotation number is irrational, the trajectory will densely fill out a ...
...
View search results from all Wolfram sites (9159 matches)

