TOPICS
Search

Search Results for ""


1821 - 1830 of 13134 for Extremal graph theorySearch Results
The truncated dodecadodecahedron, also called the quasitruncated dodecahedron, is the uniform polyhedron with Maeder index 59 (Maeder 1997), Wenninger index 98 (Wenninger ...
Let X=(X,tau) be a topological vector space whose continuous dual X^* may or may not separate points (i.e., may or may not be T2). The weak-* (pronounced "weak star") ...
An analytic function approaches any given value arbitrarily closely in any epsilon-neighborhood of an essential singularity.
Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...
A zero matrix is an m×n matrix consisting of all 0s (MacDuffee 1943, p. 27), denoted 0. Zero matrices are sometimes also known as null matrices (Akivis and Goldberg 1972, p. ...
About Eric Weisstein's World of Mathematics
The square of the area of the base (i.e., the face opposite the right trihedron) of a trirectangular tetrahedron is equal to the sum of the squares of the areas of its other ...
An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...
Find a square number x^2 such that, when a given integer h is added or subtracted, new square numbers are obtained so that x^2+h=a^2 (1) and x^2-h=b^2. (2) This problem was ...
Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...
1 ... 180|181|182|183|184|185|186 ... 1314 Previous Next

...