Almost optimum ℓ-covering of ℤ_n

07/11/2022
by   Ke Shi, et al.
0

A subset B of ring ℤ_n is called a ℓ-covering set if { ab n | 0≤ a ≤ℓ, b∈ B} = ℤ_n. We show there exists a ℓ-covering set of ℤ_n of size O(n/ℓlog n) for all n and ℓ, and how to construct such set. We also show examples where any ℓ-covering set must have size Ω(n/ℓlog n/loglog n). The proof uses a refined bound for relative totient function obtained through sieve theory, and existence of a large divisor with linear divisor sum.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2017

Network-size independent covering number bounds for deep networks

We give a covering number bound for deep learning networks that is indep...
research
07/19/2022

Covering Grassmannian Codes: Bounds and Constructions

Grassmannian 𝒢_q(n,k) is the set of all k-dimensional subspaces of the v...
research
02/20/2019

Improved efficiency for explicit covering codes matching the sphere-covering bound

A covering code is a subset of vectors over a finite field with the prop...
research
01/01/2019

Sharp Bounds for Mutual Covering

Verdú reformulated the covering problem in the non-asymptotic informatio...
research
11/23/2020

Ordinary differential equations (ODE): metric entropy and nonasymptotic theory for noisy function fitting

This paper establishes novel results on the metric entropy of ODE soluti...
research
12/02/2014

Learning interpretable models of phenotypes from whole genome sequences with the Set Covering Machine

The increased affordability of whole genome sequencing has motivated its...
research
11/02/2022

An Asymptotically Optimal Bound for Covering Arrays of Higher Index

A covering array is an N × k array (N rows, k columns) with each entry f...

Please sign up or login with your details

Forgot password? Click here to reset