Search Results for ""
71 - 80 of 272 for Chord diagramSearch Results
The chord through a focus parallel to the conic section directrix of a conic section is called the latus rectum, and half this length is called the semilatus rectum (Coxeter ...
If S_1, S_2, and S_3 are three conics having the property that there is a point X, not on any of the conics, lying on a common chord of each pair of the three conics (with ...
A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...
The span of an unoriented link diagram (also called the link spread) is the difference between the highest and lowest degrees of its bracket polynomial. The span is a ...
The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...
The length of the largest-sized square contained within the Ferrers diagram of a partition. Its size can be determined using DurfeeSquare[f] in the Wolfram Language package ...
A Heegaard splitting of a connected orientable 3-manifold M is any way of expressing M as the union of two (3,1)-handlebodies along their boundaries. The boundary of such a ...
The Young tableau (plural, "tableaux") of a Ferrers diagram is obtained by placing the numbers 1, ..., n in the n boxes of the diagram. A "standard" Young tableau is a Young ...
A bundle map is a map between bundles along with a compatible map between the base manifolds. Suppose p:X->M and q:Y->N are two bundles, then F:X->Y is a bundle map if there ...
A coequalizer of a pair of maps f,g:X->Y in a category is a map c:Y->C such that 1. c degreesf=c degreesg, where degrees denotes composition. 2. For any other map c^':Y->C^' ...
...
View search results from all Wolfram sites (2371 matches)

