TOPICS
Search

Search Results for ""


9551 - 9560 of 13135 for TopologySearch Results
A trip-let is a three-dimensional solid that is shaped in such a way that its projections along three mutually perpendicular axes are three different letters of the alphabet. ...
A triply periodic function is a function having three distinct periods. Jacobi (1835) proved that a single-valued univariate function cannot have more than two distinct ...
A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...
A tetrahedron having a trihedron all of the face angles of which are right angles. The face opposite the vertex of the right angles is called the base. If the edge lengths ...
There exist points A^', B^', and C^' on segments BC, CA, and AB of a triangle, respectively, such that A^'C+CB^'=B^'A+AC^'=C^'B+BA^' (1) and the lines AA^', BB^', CC^' ...
A curve which can be used to trisect an angle. Although an arbitrary angle cannot be trisected using only compass and straightedge (i.e., according to the strict rules of ...
The tritetrahedral graph is the skeleton of the tritetrahedron, a concave polyhedron formed by joining three regular tetrahedra at their faces. The Nechushtan graph, a ...
The tritetrahedron, also called the "boat polyhedron," is the name given in this work to the concave (non-regular) octahedron formed by joining three regular tetrahedra ...
A number of the form Tt_n=((n+2; 2); 2)=1/8n(n+1)(n+2)(n+3) (Comtet 1974, Stanley 1999), where (n; k) is a binomial coefficient. The first few values are 3, 15, 45, 105, 210, ...
A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...
1 ... 953|954|955|956|957|958|959 ... 1314 Previous Next

...