On covering by translates of a set

DOI10.1002/rsa.20346zbMath1238.05049arXiv0910.3815OpenAlexW3102833860MaRDI QIDQ3068760

Béla Bollobás, Svante Janson, Oliver Riordan

Publication date: 17 January 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0910.3815

zbMATH Keywords

finite groupstilingscyclic groupscoveringsKronecker's density theoremminimal number of translates

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial aspects of packing and covering (05B40)

Related Items (9)

Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings ⋮ On coverings of tori with cubes ⋮ Max-norm Ramsey theory ⋮ On the dimension of systems of algebraic difference equations ⋮ Constructing dominating sets in circulant graphs ⋮ SYNDETIC SUBMEASURES AND PARTITIONS OF G-SPACES AND GROUPS ⋮ Polychromatic Colorings on the Integers ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the coverage of k-dimensional space by k-dimensional spheres
• Random coverings in several dimensions
• Tiling, packing, and covering by clusters
• On translating one polyomino to tile the plane
• New scaling algorithms for the assignment and minimum mean cycle problems
• Some covering and packing results in number theory
• Tesselation of integers
• A characterization of the minimum cycle mean in a digraph
• Tiling the integers with translates of one finite set
• Complementary sets of finite sets
• Spectra of certain types of polynomials and tiling of integers with translates of finite sets.
• Orders of absolute measurability
• A threshold for the size of random caps to cover a sphere
• A limit theorem for random coverings of a circle
• A threshold of ln n for approximating set cover
• Random coverings of the circle by arcs with restricted endpoints
• Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
• Packing and Covering by Translates of Certain Nonconvex Bodies
• Efficient Algorithms for Shortest Paths in Sparse Networks
• The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• On the coverage of space by random sets
• Connectivity of random k-nearest-neighbour graphs
• Continuum Percolation
• Divisibility of integer polynomials and tilings of the integers
• On coverings with convex domains
• Random division of an interval*
• The undecidability of the domino problem
• Covering the Plane with Convex Sets
• On a Problem of Additive Number Theory
• Normal Recurring Decimals

This page was built for publication: On covering by translates of a set