TOPICS
Search

Search Results for ""


381 - 390 of 13135 for Computational GeometrySearch Results
The Hartley Transform is an integral transform which shares some features with the Fourier transform, but which, in the most common convention, multiplies the integral kernel ...
Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...
An interior point method is a linear or nonlinear programming method (Forsgren et al. 2002) that achieves optimization by going through the middle of the solid defined by the ...
The Jacobi symbol, written (n/m) or (n/m) is defined for positive odd m as (n/m)=(n/(p_1))^(a_1)(n/(p_2))^(a_2)...(n/(p_k))^(a_k), (1) where m=p_1^(a_1)p_2^(a_2)...p_k^(a_k) ...
The Kronecker-Weber theorem, sometimes known as the Kronecker-Weber-Hilbert theorem, is one of the earliest known results in class field theory. In layman's terms, the ...
Cubic lattice sums include the following: b_2(2s) = sum^'_(i,j=-infty)^infty((-1)^(i+j))/((i^2+j^2)^s) (1) b_3(2s) = ...
The appearance of nontrivial zeros (i.e., those along the critical strip with R[z]=1/2) of the Riemann zeta function zeta(z) very close together. An example is the pair of ...
Let s=1/(sqrt(2pi))[Gamma(1/4)]^2=5.2441151086... (1) (OEIS A064853) be the arc length of a lemniscate with a=1. Then the lemniscate constant is the quantity L = 1/2s (2) = ...
A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...
The modular equation of degree n gives an algebraic connection of the form (K^'(l))/(K(l))=n(K^'(k))/(K(k)) (1) between the transcendental complete elliptic integrals of the ...
1 ... 36|37|38|39|40|41|42 ... 1314 Previous Next

...