Search Results for ""
1371 - 1380 of 13135 for binary numberSearch Results
A bundle or fiber bundle is trivial if it is isomorphic to the cross product of the base space and a fiber.
Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...
Let phi(x_1,...,x_m) be an L_(exp) formula, where L_(exp)=L union {e^x} and L is the language of ordered rings L={+,-,·,<,0,1}. Then there exist n>=m and f_1,...,f_s in ...
The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...
The connective in logic corresponding to the exclusive nor operation. A XNOR B is equivalent to (A ^ B) v (!A ^ !B), where ^ denotes AND, v denotes OR, and !A denotes NOT. ...
A p-system of a set S is a sequence of subsets A_1, A_2, ..., A_p of S, among which some may be empty or coinciding with each other.
There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...
If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient ...
The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...
The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...
...
View search results from all Wolfram sites (51690 matches)

