Search Results for ""
1261 - 1270 of 2329 for Lattice graphSearch Results
Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...
The great inverted snub icosidodecahedron is the uniform polyhedron with Maeder index 69 (Maeder 1997), Wenninger index 113 (Wenninger 1989), Coxeter index 73 (Coxeter et al. ...
A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...
The small dodecahemicosahedron is the uniform polyhedron with Maeder index 62 (Maeder 1997), Wenninger index 100 (Wenninger 1989), Coxeter index 78 (Coxeter et al. 1954), and ...
In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...
Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...
A snake is an Eulerian path in the d-hypercube that has no chords (i.e., any hypercube edge joining snake vertices is a snake edge). Klee (1970) asked for the maximum length ...
As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...
A self-avoiding walk in which steps may be to the left, right, or straight ahead after a vertical step, but only straight ahead or to the left after a horizontal step. A ...
A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...
...
View search results from all Wolfram sites (14311 matches)

