TOPICS
Search

Search Results for ""


351 - 360 of 402 for Minkowski Bouligand DimensionSearch Results
A hyper-Kähler manifold can be defined as a Riemannian manifold of dimension 4n with three covariantly constant orthogonal automorphisms I, J, K of the tangent bundle which ...
The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...
Let R(z) be a rational function R(z)=(P(z))/(Q(z)), (1) where z in C^*, C^* is the Riemann sphere C union {infty}, and P and Q are polynomials without common divisors. The ...
In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...
A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...
Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...
The mean line segment length l^_ is the average length of a line segment in line segment picking within some given shape. As summarized in the following table (where Delta(3) ...
For every dimension n>0, the orthogonal group O(n) is the group of n×n orthogonal matrices. These matrices form a group because they are closed under multiplication and ...
In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...
The word polytope is used to mean a number of related, but slightly different mathematical objects. A convex polytope may be defined as the convex hull of a finite set of ...
1 ... 33|34|35|36|37|38|39 ... 41 Previous Next

...