Search Results for ""
6341 - 6350 of 7069 for Numbered Equation 4Search Results
The three circles theorem, also called Hadamard's three circles theorem (Edwards 2001, p. 187), states that if f is an analytic function in the annulus 0<r_1<|z|<r_2<infty, ...
Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...
The tilde is the mark "~" placed on top of a symbol to indicate some special property. x^~ is voiced "x-tilde." The tilde symbol is commonly used to denote an operator. In ...
A continuous group G which has the topology of a T2-space is a topological group. The simplest example is the group of real numbers under addition. The homeomorphism group of ...
Let m_1, m_2, ..., m_n be distinct primitive elements of a two-dimensional lattice M such that det(m_i,m_(i+1))>0 for i=1, ..., n-1. Each collection Gamma={m_1,m_2,...,m_n} ...
The function defined by (1) (Heatley 1943; Abramowitz and Stegun 1972, p. 509), where _1F_1(a;b;z) is a confluent hypergeometric function of the first kind and Gamma(z) is ...
Given a complex measure mu, there exists a positive measure denoted |mu| which measures the total variation of mu, also sometimes called simply "total variation." In ...
A total order (or "totally ordered set," or "linearly ordered set") is a set plus a relation on the set (called a total order) that satisfies the conditions for a partial ...
The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...
A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...
...


