TOPICS
Search

Search Results for ""


1951 - 1960 of 8910 for Inline 2Search Results
Newton's forward difference formula is a finite difference identity giving an interpolated value between tabulated points {f_p} in terms of the first value f_0 and the powers ...
A quadratic form involving n real variables x_1, x_2, ..., x_n associated with the n×n matrix A=a_(ij) is given by Q(x_1,x_2,...,x_n)=a_(ij)x_ix_j, (1) where Einstein ...
Ramanujan developed a number of interesting closed-form expressions for generalized continued fractions. These include the almost integers ...
Let psi_1(x) and psi_2(x) be any two real integrable functions in [a,b], then Schwarz's inequality is given by |<psi_1|psi_2>|^2<=<psi_1|psi_1><psi_2|psi_2>. (1) Written out ...
A sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...
Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...
A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...
Let A^~, B^~, ... be operators. Then the commutator of A^~ and B^~ is defined as [A^~,B^~]=A^~B^~-B^~A^~. (1) Let a, b, ... be constants, then identities include [f(x),x] = 0 ...
A completely monotonic function is a function f(x) such that (-1)^(-n)f^((n))(x)>=0 for n=0, 1, 2, .... Such functions occur in areas such as probability theory (Feller ...
An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...
1 ... 193|194|195|196|197|198|199 ... 891 Previous Next

...