## 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 L_{p} spaces. The measures of "closeness" that we consider are the metrics in the different L_{p} spaces. Specifically, we consider the L_{1}, L_{2} and L_{∞} metrics. In particular, for a given n-dimensional vector V, we develop O(n^{2}) 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 language | English |
---|---|

Pages (from-to) | 26-36 |

Number of pages | 11 |

Journal | Theoretical Computer Science |

Volume | 533 |

DOIs | |

State | Published - 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 L_{p}spaces'. Together they form a unique fingerprint.