Search Results for ""
2171 - 2180 of 2332 for pascal pointSearch Results

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...
Vassiliev invariants, discovered around 1989, provided a radically new way of looking at knots. The notion of finite type (a.k.a. Vassiliev) knot invariants was independently ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...
The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...
The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...
A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...
A portion of a disk whose upper boundary is a (circular) arc and whose lower boundary is a chord making a central angle theta<pi radians (180 degrees), illustrated above as ...
A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...
The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

...