Skip to main content
deleted 44 characters in body
Source Link

The nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps or other kinds of singularities. For example, the Cayley cubic has five singularities, four of which occur at the nodes of the internal elliptope and the fifth which occurs at zero and is apparently not a node.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

The nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps or other kinds of singularities. For example, the Cayley cubic has five singularities, four of which occur at the nodes of the internal elliptope and the fifth which occurs at zero and is apparently not a node.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

The nodes of a surface are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps or other kinds of singularities. For example, the Cayley cubic has five singularities, four of which occur at the nodes of the internal elliptope and the fifth which occurs at zero and is apparently not a node.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

added 213 characters in body
Source Link

The nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps or other kinds of singularities. For example, the Cayley cubic has five singularities, four of which occur at the nodes of the internal elliptope and the fifth which occurs at zero and is apparently not a node.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

The nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

The nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps or other kinds of singularities. For example, the Cayley cubic has five singularities, four of which occur at the nodes of the internal elliptope and the fifth which occurs at zero and is apparently not a node.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

added 29 characters in body
Source Link

I understand that theThe nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

I understand that the nodes of a surface define its points of self-intersection, and are special cases of more general singularities.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

The nodes of a surface define its points of self-intersection, and are special cases of more general singularities. For example, the Cayley cubic has four nodes.

The full set of singularities of a surface can be characterized by finding all points where the partial derivatives are all zero. However, not all singularities are nodes. Some are cusps.

Is there a simple way to check which singularities are surface nodes? Or, more interestingly, is there a way to compute the full set of nodes of a surface directly?

Source Link
Loading