Search Results for ""
911 - 920 of 13135 for Reynolds numberSearch Results
A negative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a negative number, i.e., a_(ij)<0 for all i, j. Negative matrices are therefore a ...
The norm topology on a normed space X=(X,||·||_X) is the topology tau consisting of all sets which can be written as a (possibly empty) union of sets of the form B_r(x)={y in ...
Given a convex plane region with area A and perimeter p, A-1/2p<N<=A+1/2p+1, where N is the number of enclosed lattice points (Nosarzewska 1948). This improves on Jarnick's ...
A partial algebra is a pair A=(A,(f_i^A)_(i in I)), where for each i in I, there are an ordinal number alpha_i and a set X_i subset= A^(alpha_i) such that f_i^A is a function ...
The whole neighborhood of any point y_i of an algebraic curve may be uniformly represented by a certain finite number of convergent developments in power series, ...
A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...
The real axis is the line in the complex plane corresponding to zero imaginary part, I[z]=0. Every real number corresponds to a unique point on the real axis.
A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...
Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...
A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...
...
View search results from all Wolfram sites (49556 matches)

