TOPICS
Search

Search Results for ""


2081 - 2090 of 2765 for Linear Recurrence EquationSearch Results
The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...
An abstract vector space of dimension n over a field k is the set of all formal expressions a_1v_1+a_2v_2+...+a_nv_n, (1) where {v_1,v_2,...,v_n} is a given set of n objects ...
Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...
The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...
Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...
A classic arithmetical problem probably first posed by Euclid and investigated by various authors in the Middle Ages. The problem is formulated as a dialogue between the two ...
Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...
A Banach space is a complete vector space B with a norm ||·||. Two norms ||·||_((1)) and ||·||_((2)) are called equivalent if they give the same topology, which is equivalent ...
A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...
Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...
1 ... 206|207|208|209|210|211|212 ... 277 Previous Next

...