On Covering Multiplicity
نویسنده
چکیده
Let A = {as +nsZ}s=1 be a system of arithmetic sequences which forms an m-cover of Z (i.e. every integer belongs at least to m members of A). In this paper we show the following surprising properties of A: (a) For each J ⊆ {1, · · · , k} there exist at least m subsets I of {1, · · · , k} with I 6= J such that ∑ s∈I 1/ns − ∑ s∈J 1/ns ∈ Z. (b) If A forms a minimal m-cover of Z, then for any t = 1, · · · , k there is an αt ∈ [0, 1) such that for every r = 0, 1, · · · , nt − 1 there exists an I ⊆ {1, · · · , k} \ {t} for which [ ∑ s∈I 1/ns] > m− 1 and { ∑ s∈I 1/ns} = (αt + r)/nt.
منابع مشابه
On the Covering Multiplicity of Lattices
Let the lattice Λ have covering radius R, so that closed balls of radius R around the lattice points justcover the space. The covering multiplicity CM(Λ) is the maximal number of times the interiors of theseballs overlap. We show that the least possible covering multiplicity for an n-dimensional lattice is n ifn ≤ 8, and conjecture that it exceeds n in all other cases. We determine ...
متن کاملOn the Covering Radius Problem for Codes I . Bounds on Normalized Covering Radius
In this two-part paper we introduce the notion of a stable code and give a new upper bound on the normalized covering radius ofa code. The main results are that, for fixed k and large n, the minimal covering radius t[n, k] is realized by a normal code in which all but one of the columns have multiplicity l; hence tin + 2, k] t[n, k] + for sufficiently large n. We also show that codes with n _-<...
متن کاملStochastic Covering and Adaptivity
We introduce a class of “stochastic covering” problems where the target set X to be covered is fixed, while the “items” used in the covering are characterized by probability distributions over subsets of X. This is a natural counterpart to the stochastic packing problems introduced in [5]. In analogy to [5], we study both adaptive and non-adaptive strategies to find a feasible solution, and in ...
متن کاملThe Multiplicity Function of groups of galaxies from CRoNaRio catalogues
The projected multiplicity function of galaxies gives (per square degree) the density of galaxy aggregates formed by N members. We use the CRoNaRio matched catalogues to derive the low N (N < 15) multiplicity function from D-POSS data. The van Albada (1982) algorithm was implemented and used to identify candidate groups in the CRoNaRio catalogues. In absence of redshift surveys complete down to...
متن کاملTight Approximation Results for General Covering Integer Programs
In this paper we study approximation algorithms for solving a general covering integer program. An n-vector x of nonnegative integers is sought, which minimizes c ·x, subject to Ax ≥ b, x ≤ d. The entries of A, b, c are nonnegative. Let m be the number of rows of A. Covering problems have been heavily studied in combinatorial optimization. We focus on the effect of the multiplicity constraints,...
متن کاملApproximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints
We consider the problem of splitting an order for R goods, R ≥ 1, among a set of sellers, each having bounded amounts of the goods, so as to minimize the total cost of the deal. In deal splitting with packages (DSP), the sellers offer packages containing combinations of the goods; in deal splitting with price tables (DST), the buyer can generate such combinations using price tables. Our problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999