Lattice covering by semicrosses of arm length 2

DOI10.1016/S0195-6698(13)80093-5zbMath0728.20045OpenAlexW2016860586MaRDI QIDQ804710

Sándor Szabó

Publication date: 1991

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80093-5

zbMATH Keywords

algorithmcyclic groupscovering finite Abelian groups by cyclic subsetslattice covering constantn-dimensional polyhedronsemicross

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Covering Abelian groups with cyclic subsets ⋮ Linear covering codes and error-correcting codes for limited-magnitude errors

Cites Work

• Splittings of finite groups
• Tiling, packing, and covering by clusters
• On decomposing finite abelian groups

This page was built for publication: Lattice covering by semicrosses of arm length 2