TOPICS
Search

Search Results for ""


1991 - 2000 of 4055 for First Order Linear Ordinary Differential...Search Results
The projective symplectic group PSp_n(q) is the group obtained from the symplectic group Sp_n(q) on factoring by the scalar matrices contained in that group. PSp_(2m)(q) is ...
If f is analytic on a domain U, then a point z_0 on the boundary partialU is called regular if f extends to be an analytic function on an open set containing U and also the ...
If two algebraic plane curves with only ordinary singular points and cusps are related such that the coordinates of a point on either are rational functions of a ...
An ordinary knot in three dimensions suspended in four dimensions to create a knotted 2-sphere. Suspended knots are not smooth at the poles.
"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...
A generalization of spun knots due to Zeeman. This method produces four-dimensional knot types that cannot be produced by ordinary spinning.
For any point P on the boundary of an ordinary ball, find a neighborhood of P in which the intersection with the ball's boundary cuts the neighborhood into two parts, each ...
A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...
What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...
A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...
1 ... 197|198|199|200|201|202|203 ... 406 Previous Next

...