Search Results for ""

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...

Catastrophe theory studies how the qualitative nature of equation solutions depends on the parameters that appear in the equations. Subspecializations include bifurcation ...

A chain complex is a sequence of maps ...-->^(partial_(i+1))C_i-->^(partial_i)C_(i-1)-->^(partial_(i-1))..., (1) where the spaces C_i may be Abelian groups or modules. The ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

Let V be an n-dimensional linear space over a field K, and let Q be a quadratic form on V. A Clifford algebra is then defined over T(V)/I(Q), where T(V) is the tensor algebra ...

Three or more points P_1, P_2, P_3, ..., are said to be collinear if they lie on a single straight line L. A line on which points lie, especially if it is related to a ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

The complex plane is the plane of complex numbers spanned by the vectors 1 and i, where i is the imaginary number. Every complex number corresponds to a unique point in the ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...