TOPICS
Search

Search Results for ""


9151 - 9160 of 13135 for Computational GeometrySearch Results
The branch of mathematics dealing with the efficient and accurate storage, transmission, and representation of information.
An inhomogeneous linear ordinary differential equation with constant coefficients is an ordinary differential equation in which coefficients are constants (i.e., not ...
An ordinal number is called an initial ordinal if every smaller ordinal has a smaller cardinal number (Moore 1982, p. 248; Rubin 1967, p. 271). The omega_alphas ordinal ...
Let (A,<=) be a well ordered set. Then the set {a in A:a<k} for some k in A is called an initial segment of A (Rubin 1967, p. 161; Dauben 1990, pp. 196-197; Moore 1982, pp. ...
An initial value problem is a problem that has its conditions specified at some time t=t_0. Usually, the problem is an ordinary differential equation or a partial ...
Let f be a function defined on a set A and taking values in a set B. Then f is said to be an injection (or injective map, or embedding) if, whenever f(x)=f(y), it must be the ...
Let Q(x)=Q(x_1,x_2,...,x_n) be an integer-valued n-ary quadratic form, i.e., a polynomial with integer coefficients which satisfies Q(x)>0 for real x!=0. Then Q(x) can be ...
A function defined for all positive integers, sometimes also called an arithmetic function (Nagell 1951, p. 26) or number theoretic function (Wilf 1994, p. 58).
A matrix whose entries are all integers. Special cases which arise frequently are those having only (-1,1) as entries (e.g., Hadamard matrix), (0,1)-matrices having only ...
A polynomial of the form f(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 having coefficients a_i that are all integers. An integer polynomial gives integer values for all integer ...
1 ... 913|914|915|916|917|918|919 ... 1314 Previous Next

...