TOPICS
Search

Search Results for ""


131 - 140 of 729 for modular sieve methodSearch Results
A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).
A function or transformation f in which f(z) does not overlap z. In modular function theory, a function is called univalent on a subgroup G if it is automorphic under G and ...
Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...
A quantity by which another (the multiplicand) is multiplied. For example, in the expression a×b, a is the multiplier. The result of the multiplication of two or more ...
The phrase Tomita-Takesaki theory refers to a specific collection of results proven within the field of functional analysis regarding the theory of modular Hilbert algebras ...
A cusp form is a modular form for which the coefficient c(0)=0 in the Fourier series f(tau)=sum_(n=0)^inftyc(n)e^(2piintau) (1) (Apostol 1997, p. 114). The only entire cusp ...
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 ...
A family of operators mapping each space M_k of modular forms onto itself. For a fixed integer k and any positive integer n, the Hecke operator T_n is defined on the set M_k ...
A technique is a specific method of performing an operation. The terms algorithm, method, and procedure are also used interchangeably.
Given a Jacobi theta function, the nome is defined as q(k) = e^(piitau) (1) = e^(-piK^'(k)/K(k)) (2) = e^(-piK(sqrt(1-k^2))/K(k)) (3) (Borwein and Borwein 1987, pp. 41, 109 ...
1 ... 11|12|13|14|15|16|17 ... 73 Previous Next

...