TOPICS
Search

Search Results for ""


1131 - 1140 of 1388 for matrix multiplicationSearch Results
Let F(m,n) be the number of m×n (0,1)-matrices with no adjacent 1s (in either columns or rows). For n=1, 2, ..., F(n,n) is given by 2, 7, 63, 1234, ... (OEIS A006506). The ...
As shown by Morse and Feshbach (1953) and Arfken (1970), the Helmholtz differential equation is separable in oblate spheroidal coordinates.
A homogeneous space M is a space with a transitive group action by a Lie group. Because a transitive group action implies that there is only one group orbit, M is isomorphic ...
The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...
An axiom proposed by Huntington (1933) as part of his definition of a Boolean algebra, H(x,y)=!(!x v y) v !(!x v !y)=x, (1) where !x denotes NOT and x v y denotes OR. Taken ...
Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary perfect number is a number n such that sigma_infty(n)=2n. The first few are 6, 60, 90, ...
The notion of an inverse is used for many types of mathematical constructions. For example, if f:T->S is a function restricted to a domain S and range T in which it is ...
Some elements of a group G acting on a space X may fix a point x. These group elements form a subgroup called the isotropy group, defined by G_x={g in G:gx=x}. For example, ...
The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...
The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...
1 ... 111|112|113|114|115|116|117 ... 139 Previous Next

...