Deciding whether a Lattice has an Orthonormal Basis is in co-NP

We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of the Lattice Isomorphism Problem, which is known to be in the complexity class SZK.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/09/2018

Computing an LLL-reduced basis of the orthogonal lattice

As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduc...
research
11/07/2018

Maximum Distance Sub-Lattice Problem

In this paper, we define a problem on lattices called the Maximum Distan...
research
04/14/2023

On deterministic, constant memory triangular searches on the integer lattice

Recently it has been shown that four constant memory, deterministic agen...
research
08/24/2019

DAST Model: Deciding About Semantic Complexity of a Text

Measuring of text complexity is a needed task in several domains and app...
research
03/03/2023

An efficient algorithm for integer lattice reduction

A lattice of integers is the collection of all linear combinations of a ...
research
04/10/2019

On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields

In this paper, we continue our previous work on the reduction of algebra...
research
09/03/2019

Percolation is Odd

We discuss the number of spanning configurations in site percolation. We...

Please sign up or login with your details

Forgot password? Click here to reset