Search Results for ""
81 - 90 of 463 for LatticeSearch Results
The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...
One of the 14 4-polyaboloes.
The three 3-polyiamonds are called tetriamonds.
One of the four 3-polyaboloes.
The unique 3-polyiamond, illustrated above.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a join-homomorphism, then it is a join-embedding.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If K=L and h is a join-homomorphism, then we call h a join-endomorphism.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.
For every positive integer n, there exists a sphere which has exactly n lattice points on its surface. The sphere is given by the equation ...
...
View search results from all Wolfram sites (2151 matches)

