Search Results for ""
2961 - 2970 of 4569 for Complex numbersSearch Results
The kissing number of a sphere is 12. This led Fejes Tóth (1943) to conjecture that in any unit sphere packing, the volume of any Voronoi cell around any sphere is at least ...
A number of attractive 2-compounds of the regular dodecahedron can be constructed. The first (left figures) has the symmetry of the cube and arises by combining two regular ...
A compound of five regular dodecahedra with the symmetry of the icosahedron (Wenninger 1983, pp. 145-147) can be constructed by taking a dodecahedron with top and bottom ...
The most general forced form of the Duffing equation is x^..+deltax^.+(betax^3+/-omega_0^2x)=gammacos(omegat+phi). (1) Depending on the parameters chosen, the equation can ...
The Dyck graph is unique cubic symmetric graph on 32 nodes, illustrated above in a number of embeddings. It is denoted F_(032)A in the Foster census of cubic symmetric graphs ...
The EKG sequence is the integer sequence having 1 as its first term, 2 as its second, and with each succeeding term being the smallest number not already used that shares a ...
The Earls sequence gives the starting position in the decimal digits of pi (or in general, any constant), not counting digits to the left of the decimal point, at which a ...
The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...
Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...
Let Delta denote an integral convex polytope of dimension n in a lattice M, and let l_Delta(k) denote the number of lattice points in Delta dilated by a factor of the integer ...
...
View search results from all Wolfram sites (46785 matches)

