TOPICS
Search

Search Results for ""


8191 - 8200 of 13134 for Extremal graph theorySearch Results
Let c=(c_1,...,c_n) be a point in C^n, then the open polydisk is defined by S={z:|z_j-c_j|<|z_j^0-c_j|} for j=1, ..., n.
A function which has infinitely many derivatives at a point. If a function is not polygenic, it is monogenic.
The positions of the geometric centroid of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) are x^_ = ...
The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).
A polygrammic prism is a prism formed by two regular polygrams offset along their symmetry axis and with corresponding edges connected by lateral faces. The hexagrammic prism ...
A line segment where two faces of a polyhedron meet, also called a side.
A curve obtained by fitting polynomials to each ordinate of an ordered sequence of points. The above plots show polynomial curves where the order of the fitting polynomial ...
The highest power in a univariate polynomial is known as its degree, or sometimes "order." For example, the polynomial P(x)=a_nx^n+...+a_2x^2+a_1x+a_0 is of degree n, denoted ...
If a polynomial P(x) has a root x=a, i.e., if P(a)=0, then x-a is a factor of P(x).
A polynomial function is a function whose values can be expressed in terms of a defining polynomial. A polynomial function of maximum degree 0 is said to be a constant ...
1 ... 817|818|819|820|821|822|823 ... 1314 Previous Next

...