Abstract
Using algebraic and graph theoretical methods we provide an algorithm to determine the integer lattice covering constant of a certain type of n -dimensional cubistic polyhedron. In particular, we verify a special case of a conjecture of S. K. Stein on covering finite abelian groups by cyclic subsets.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
