Search Results for ""
2401 - 2410 of 2764 for General TrianglesSearch Results
A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...
Let s_i be the sum of the products of distinct polynomial roots r_j of the polynomial equation of degree n a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the roots are taken ...
To find the motion of a rectangular membrane with sides of length L_x and L_y (in the absence of gravity), use the two-dimensional wave equation ...
A zonotope is a set of points in d-dimensional space constructed from vectors v_i by taking the sum of a_iv_i, where each a_i is a scalar between 0 and 1. Different choices ...
Analysis
The nth root (or "nth radical") of a quantity z is a value r such that z=r^n, and therefore is the inverse function to the taking of a power. The nth root is denoted ...
Given a Hilbert space H, a *-subalgebra A of B(H) is said to be a von Neumann algebra in H provided that A is equal to its bicommutant A^('') (Dixmier 1981). Here, B(H) ...
Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...
Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...
A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...
...
View search results from all Wolfram sites (75139 matches)

