Search results
Results From The WOW.Com Content Network
A curve with a triple point at the origin: x(t) = sin(2t) + cos(t), y(t) = sin(t) + cos(2t) In general, if all the terms of degree less than k are 0, and at least one term of degree k is not 0 in f, then curve is said to have a multiple point of order k or a k-ple point.
The problem is to find a resolution that is an isomorphism over the set of smooth and simple normal crossing points. When X is a divisor, i.e. it can be embedded as a codimension-one subvariety in a smooth variety it is known to be true the existence of the strong resolution avoiding simple normal crossing points.
Pages in category "Unsolved problems in graph theory" The following 32 pages are in this category, out of 32 total. This list may not reflect recent changes. A.
Points of V that are not singular are called non-singular or regular. It is always true that almost all points are non-singular, in the sense that the non-singular points form a set that is both open and dense in the variety (for the Zariski topology, as well as for the usual topology, in the case of varieties defined over the complex numbers). [1]
A graph with three vertices and three edges. A graph (sometimes called an undirected graph to distinguish it from a directed graph, or a simple graph to distinguish it from a multigraph) [4] [5] is a pair G = (V, E), where V is a set whose elements are called vertices (singular: vertex), and E is a set of unordered pairs {,} of vertices, whose elements are called edges (sometimes links or lines).
One could define the x-axis as a tangent at this point, but this definition can not be the same as the definition at other points. In fact, in this case, the x-axis is a "double tangent." For affine and projective varieties, the singularities are the points where the Jacobian matrix has a rank which is lower than at other points of the variety.
Let G be the unit distance graph of the plane: an infinite graph with all points of the plane as vertices and with an edge between two vertices if and only if the distance between the two points is 1. The Hadwiger–Nelson problem is to find the chromatic number of G. As a consequence, the problem is often called "finding the chromatic number ...
This is another branch of singularity theory, based on earlier work of Hassler Whitney on critical points. Roughly speaking, a critical point of a smooth function is where the level set develops a singular point in the geometric sense. This theory deals with differentiable functions in general, rather than just polynomials.