Search Results for ""
5811 - 5820 of 13135 for dimensional analysisSearch Results
A polynomial is called logarithmically concave (or log-concave) if the sequence of its coefficients is logarithmically concave. If P(x) is log-convex and Q(x) is unimodal, ...
The symbol separating the dividend from the divisor in a long division that is drawn as a right parenthesis (or sometimes a straight vertical bar) with an attached vinculum ...
One of the Eilenberg-Steenrod axioms. It states that, for every pair (X,A), there is a natural long exact sequence ...->H_n(A)->H_n(X)->H_n(X,A)->H_(n-1)(A)->..., where the ...
The azimuthal coordinate on the surface of a sphere (theta in spherical coordinates) or on a spheroid (in prolate or oblate spheroidal coordinates). Longitude is defined such ...
The lower-trimmed subsequence of x={x_n} is the sequence V(x) obtained by subtracting 1 from each x_n and then removing all 0s. If x is a fractal sequence, then V(x) is a ...
The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...
The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...
For a given function f(x) over a partition of a given interval, the lower sum is the sum of box areas m^*Deltax_k using the infimum m of the function f(x) in each subinterval ...
A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...
An equilateral parallelogram whose acute angles are 45 degrees. Sometimes, the restriction to 45 degrees is dropped, and it is required only that two opposite angles are ...
...
View search results from all Wolfram sites (197169 matches)

