The set of neighbours of a set in a point-lattice
โ Scribed by B. Uhrin
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 454 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Given an n-dimensional point-lattice
A c [w" and a bounded set A c KY, the set S(A) of nonzero lattice points ueA such that A n (A + u) # f~ is called the set of neighbours of A in ,4. In the paper a disjoint decomposition of S(A) is showed which gives a representation of the cardinality N(A) of S(A) as the sum of cardinalities of the components of S(A). The resulting identity yields both sharpenings and generalizations of lower estimations for N(A) due to Groemer (1970) and Erdiis and Rogers (1964).
๐ SIMILAR VOLUMES
We consider the problem of finding two sets of given cardinalities in certain grid graphs, so as to minimize the cross-distance between them. (This is the maximum Manhattan distance between points, one of the first set and another of the second set.) The question is answered completely for grids tha
## Behrendt, G., The lattice of antichain cutsets of a partially ordered set, Discrete Mathematics 89 (1991) 201-202. Every finite lattice is isomorphic to the lattice of antichain cutsets of a finite partially ordered set whose chains have at most three elements. A subset A of a partially order