Search Results for ""
1291 - 1300 of 2329 for Lattice graphSearch Results
Consider a collection of diagonal matrices H_1,...,H_k, which span a subspace h. Then the ith eigenvalue, i.e., the ith entry along the diagonal, is a linear functional on h, ...
A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...
One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...
The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...
Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...
In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...
Given a convex plane region with area A and perimeter p, A-1/2p<N<=A+1/2p+1, where N is the number of enclosed lattice points (Nosarzewska 1948). This improves on Jarnick's ...
A tree is planted at each lattice point in a circular orchard which has center at the origin and radius r. If the radius of trees exceeds 1/r units, one is unable to see out ...
One of the three 2-polyaboloes.
A vector specifying how layers are stacked in a laminated lattice.
...
View search results from all Wolfram sites (14311 matches)

