TOPICS
Search

Search Results for ""


1421 - 1430 of 13134 for Local class field theorySearch Results
Given a set P with |P|=p elements consisting of c_1 numbers 1, c_2 numbers 2, ..., and c_n numbers n and c_1+c_2+...+c_n=p, find the number of permutations with k-1 rises ...
For two random variates X and Y, the correlation is defined bY cor(X,Y)=(cov(X,Y))/(sigma_Xsigma_Y), (1) where sigma_X denotes standard deviation and cov(X,Y) is the ...
Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...
A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...
The 24-cell is a finite regular four-dimensional polytope with Schläfli symbol {3,4,3}. It is also known as the hyperdiamond or icositetrachoron, and is composed of 24 ...
The 600-cell is the finite regular four-dimensional polytope with Schläfli symbol {3,3,5}. It is also known as the hypericosahedron or hexacosichoron. It is composed of 600 ...
Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...
Define the packing density eta of a packing of spheres to be the fraction of a volume filled by the spheres. In three dimensions, there are three periodic packings for ...
An edge cut (Holton and Sheehan 1993, p. 14; West 2000, p. 152), edge cut set, edge cutset (Holton and Sheehan 1993, p. 14), or sometimes simply "cut set" or "cutset" (e.g., ...
A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...
1 ... 140|141|142|143|144|145|146 ... 1314 Previous Next

...