Search Results for ""
4381 - 4390 of 13134 for complexity theorySearch Results
The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...
The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...
If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...
The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...
Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...
In a noncommutative ring R, a right ideal is a subset I which is an additive subgroup of R and such that for all r in R and all a in I, ar in I. (1) For all a in R, the set ...
Given a map f:S->T between sets S and T, the map g:T->S is called a right inverse to f provided that f degreesg=id_T, that is, composing f with g from the right gives the ...
The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...
A ring homomorphism is a map f:R->S between two rings such that 1. Addition is preserved:f(r_1+r_2)=f(r_1)+f(r_2), 2. The zero element is mapped to zero: f(0_R)=0_S, and 3. ...
...
View search results from all Wolfram sites (28442 matches)

