Achievable sets in Z^n.
From MaRDI portal
Abstract: What sets A subset Z^n can be written in the form (K-K) cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely characterizes achievable sets for n=1, but not much is known for n ge 2. We attempt to characterize achievable sets further by showing that with any finite, symmetric set A subset Z^n containing zero, we may associate a graph G(A). Then if A is achievable, we show the set associated to some connected component of G(A) is achievable. In two dimensions, we can strengthen this theorem further. Further generalizations and open questions are discussed. Throughout, the language and formalism of algebraic topology are useful.
Recommendations
- Finding integral diagonal pairs in a two dimensional \(\mathcal{N}\)-set
- Invariant systems of representatives, or the cost of symmetry
- Sumsets and subsets of Bohr sets in finite abelian groups
- scientific article; zbMATH DE number 4154715
- scientific article; zbMATH DE number 4208435
- On minimal complements in groups
- scientific article; zbMATH DE number 5271260
- Alignments closed under a binary product
- An example of a planar group whose quasicomponent does not coincide with its component
- scientific article; zbMATH DE number 804141
This page was built for publication: Achievable sets in \(\mathbb Z^n\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487116)
