TOPICS
Search

Search Results for ""


911 - 920 of 2764 for General TrianglesSearch Results
Any collineation from P(V) to P(V), where V is a three-dimensional vector space, is associated with a semilinear map from V to V.
On a Riemannian manifold, there is a unique connection which is torsion-free and compatible with the metric. This connection is called the Levi-Civita connection.
The G-transform of a function f(x) is defined by the integral (Gf)(x)=(G_(pq)^(mn)|(a_p); (b_q)|f(t))(x) (1) =1/(2pii)int_sigmaGamma[(b_m)+s, 1-(a_n)-s; (a_p^(n+1))+s, ...
The gear curve is a curve resembling a gear with n teeth given by the parametric equations x = rcost (1) y = rsint, (2) where r=a+1/btanh[bsin(nt)], (3) where tanhx is the ...
The proposition that every consistent generalized theory has a model. The theorem is true if the axiom of choice is assumed.
An affine transformation in which the scale is reduced.
The identity PVint_(-infty)^inftyF(phi(x))dx=PVint_(-infty)^inftyF(x)dx (1) holds for any integrable function F(x) and phi(x) of the form ...
The term in rigidity theory for the edges of a graph.
A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.
A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...
1 ... 89|90|91|92|93|94|95 ... 277 Previous Next

...