Search Results for ""
5111 - 5120 of 13135 for Probability Generating FunctionSearch Results
The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).
A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...
The n-cyclohedron, also known as the Bott-Taubes polytope, is defined as the compactification of the configuration space of n points on the circle. The cyclohedron can be ...
The evolute of the cycloid x(t) = a(t-sint) (1) y(t) = a(1-cost) (2) is given by x(t) = a(t+sint) (3) y(t) = a(cost-1). (4) As can be seen in the above figure, the evolute is ...
The involute of the cycloid x = a(t-sint) (1) y = a(1-cost) (2) is given by x_i = a(t+sint) (3) y_i = a(3+cost). (4) As can be seen in the above figure, the involute is ...
The radial curve of the cycloid with parametric equations x = a(t-sint) (1) y = a(1-cost) (2) is the circle x_r = x_0+2asint (3) y_r = -2a+y_0+2acost. (4)
Let p be an odd prime and F_n the cyclotomic field of p^(n+1)th roots of unity over the rational field. Now let p^(e(n)) be the power of p which divides the class number h_n ...
A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...
The cylindrical parts of a system of real algebraic equations and inequalities in variables {x_1,...,x_n} are the terms f_1 <= x_1<=g_1 (1) f_2(x_1) <= x_2<=g_2(x_1) (2) | ...
A natural number n>3 such that n|(a^(n-2)-a) whenever (a,n)=1 (a and n are relatively prime) and a<=n. (Here, n|m means that n divides m.) There are an infinite number of ...
...
View search results from all Wolfram sites (432560 matches)

