TOPICS
Search

Search Results for ""


11331 - 11340 of 13135 for Computational GeometrySearch Results
An interpretation of first-order logic consists of a non-empty domain D and mappings for function and predicate symbols. Every n-place function symbol is mapped to a function ...
A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one ...
The inverse erf function is the inverse function erf^(-1)(z) of the erf function erf(x) such that erf(erf^(-1)(x)) = x (1) erf^(-1)(erf(x)) = x, (2) with the first identity ...
Given a function f(x), its inverse f^(-1)(x) is defined by f(f^(-1)(x))=f^(-1)(f(x))=x. (1) Therefore, f(x) and f^(-1)(x) are reflections about the line y=x. In the Wolfram ...
Solving the nome q for the parameter m gives m(q) = (theta_2^4(q))/(theta_3^4(q)) (1) = (16eta^8(1/2tau)eta^(16)(2tau))/(eta^(24)(tau)), (2) where theta_i(q)=theta_i(0,q) is ...
The inverse tangent integral Ti_2(x) is defined in terms of the dilogarithm Li_2(x) by Li_2(ix)=1/4Li_2(-x^2)+iTi_2(x) (1) (Lewin 1958, p. 33). It has the series ...
A polynomial is said to be irreducible if it cannot be factored into nontrivial polynomials over the same field. For example, in the field of rational polynomials Q[x] (i.e., ...
Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...
The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...
In statistical mechanics, the two-dimensional Ising model is a popular tool used to study the dipole moments of magnetic spins. The Ising model in two dimensions is a type of ...

...