Search Results for ""
2261 - 2270 of 13134 for Graph TheorySearch Results
The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...
The special unitary group SU_n(q) is the set of n×n unitary matrices with determinant +1 (having n^2-1 independent parameters). SU(2) is homeomorphic with the orthogonal ...
A tetradic (or four-way) number is a number that remains unchanged when flipped back to front, mirrored up-down, or flipped up-down. Since the only numbers that remain ...
The base-2 transcendental number 0.11011011111011011111..._2 (1) (OEIS A014578), where the nth bit is 1 if n is not divisible by 3 and is the complement of the (n/3)th bit if ...
A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...
Given two additive groups (or rings, or modules, or vector spaces) A and B, the map f:A-->B such that f(a)=0 for all a in A is called the zero map. It is a homomorphism in ...
When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...
Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...
The so-called explicit formula psi(x)=x-sum_(rho)(x^rho)/rho-ln(2pi)-1/2ln(1-x^(-2)) gives an explicit relation between prime numbers and Riemann zeta function zeros for x>1 ...
The constant e^pi that Gelfond's theorem established to be transcendental seems to lack a generally accepted name. As a result, in this work, it will be dubbed Gelfond's ...
...
View search results from all Wolfram sites (33872 matches)

