TOPICS
Search

Search Results for ""


291 - 300 of 13135 for Computational GeometrySearch Results
The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...
A formal power series, sometimes simply called a "formal series" (Wilf 1994), of a field F is an infinite sequence {a_0,a_1,a_2,...} over F. Equivalently, it is a function ...
An equation of the form f(x,y,...)=0, where f contains a finite number of independent variables, known functions, and unknown functions which are to be solved for. Many ...
An integer d is a fundamental discriminant if it is not equal to 1, not divisible by any square of any odd prime, and satisfies d=1 (mod 4) or d=8,12 (mod 16). The function ...
Let G be a subgroup of the modular group Gamma. Then an open subset R_G of the upper half-plane H is called a fundamental region of G if 1. No two distinct points of R_G are ...
The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...
Gauss's continued fraction is given by the continued fraction ...
Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...
An equation derived by Kronecker: where r(n) is the sum of squares function, zeta(z) is the Riemann zeta function, eta(z) is the Dirichlet eta function, Gamma(z) is the gamma ...
The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...
1 ... 27|28|29|30|31|32|33 ... 1314 Previous Next

...