Closest periodic vectors in Lp spaces

Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein

Research output: Contribution to journalArticlepeer-review

Abstract

The problem of finding the period of a vector V is central to many applications. Let V' be a periodic vector closest to V under some metric. We seek this V', or more precisely we seek the smallest period that generates V'. In this paper we consider the problem of finding the closest periodic vector in Lp spaces. The measures of "closeness" that we consider are the metrics in the different Lp spaces. Specifically, we consider the L1, L2 and L metrics. In particular, for a given n-dimensional vector V, we develop O(n2) time algorithms (a different algorithm for each metric) that construct the smallest period that defines such a periodic n-dimensional vector V'. We call that vector the closest periodic vector of V under the appropriate metric. We also show (three) Õ(n) time constant approximation algorithms for the period of the approximate closest periodic vector.

Original languageEnglish
Pages (from-to)26-36
Number of pages11
JournalTheoretical Computer Science
Volume533
DOIs
StatePublished - 2014

Keywords

  • Approximate periodicity
  • Closest vector
  • String algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Closest periodic vectors in Lp spaces'. Together they form a unique fingerprint.

Cite this