TOPICS
Search

Search Results for ""


481 - 490 of 3197 for chess mathSearch Results
Let f(z) be a transcendental meromorphic function, and let D_1, D_2, ..., D_5 be five simply connected domains in C with disjoint closures (Ahlfors 1932). Then there exists j ...
Ai(z) and Ai^'(z) have zeros on the negative real axis only. Bi(z) and Bi^'(z) have zeros on the negative real axis and in the sector pi/3<|argz|<pi/2. The nth (real) roots ...
A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...
A plane tiling is said to be isohedral if the symmetry group of the tiling acts transitively on the tiles, and n-isohedral if the tiles fall into n orbits under the action of ...
A flow defined analogously to the Anosov diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...
An aperiodic tiling is a non-periodic tiling in which arbitrarily large periodic patches do not occur. A set of tiles is said to be aperiodic if they can form only ...
An Archimedean circle is a circle defined in the arbelos in a natural way and congruent to Archimedes' circles, i.e., having radius rho=1/2r(1-r) for an arbelos with outer ...
Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...
The arithmetic-geometric energy of a graph is defined as the graph energy of its arithmetic-geometric matrix, i.e., the sum of the absolute values of the eigenvalues of its ...
The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...
1 ... 46|47|48|49|50|51|52 ... 320 Previous Next

...