Search Results for ""
121 - 130 of 458 for Inline 50Search Results
A queue is a special kind of list in which elements may only be removed from the bottom by a pop action or added to the top using a push action. Examples of queues include ...
There exist numbers y_1<y_2<...<y_(n-1), a<y_(n-1), y_(n-1)<b, such that lambda_nu=alpha(y_nu)-alpha(y_(nu-1)), (1) where nu=1, 2, ..., n, y_0=a and y_n=b. Furthermore, the ...
If M^n is a differentiable homotopy sphere of dimension n>=5, then M^n is homeomorphic to S^n. In fact, M^n is diffeomorphic to a manifold obtained by gluing together the ...
The subdiagonal of a square matrix is the set of elements directly under the elements comprising the diagonal. For example, in the following matrix, the diagonal elements are ...
Lachlan's term for a set of four points, no three of which are collinear.
The triangular (or trigonal) dipyramid is one of the convex deltahedra, and Johnson solid J_(12). It is also an isohedron. It is implemented in the Wolfram Language as ...
The limit of an upper sum, when it exists, as the mesh size approaches 0.
Two sets T_1 and T_2 are called Wilf equivalent if they belong to the same Wilf class.
An identity graph, sometimes also known as an asymmetric graph or rigid graph (Albertson and Collins 1996), is a graph possessing a single graph automorphism. The numbers of ...
The (26,8)-Paulus graph having the largest possible graph automorphism group order of all 26-node Paulus graphs (namely 120) is sometimes known as the ...
...
View search results from all Wolfram sites (15315 matches)

