One at a time

Author: whoami730

src/sage/modules/free_module_integer.py

@@ -896,44 +896,6 @@ def babai(self, *args, **kwargs):
         Alias for :meth:`approximate_closest_vector`.
         """
         return self.approximate_closest_vector(*args, **kwargs)
-
-    def hadamard_ratio(self, use_reduced_basis=True):
-        """
-        Computes the normalized Hadamard ratio of the given basis. 
-        
-        The normalized Hadamard ratio of the basis `B = \{v_1, v_2, \dots, v_n\} is defined as
-
-        .. MATH::
-            \mathcal{H}(B) = \left(\dfrac{det L}{\|v_1\| \|v_2\| \cdots \|v_n\|}\right)^{\frac{1}{n}}
-
-        The closer this ratio is to 1, the more orthogonal the basis is.
-
-        EXAMPLES::
-
-            sage: from sage.modules.free_module_integer import IntegerLattice
-            sage: L = IntegerLattice([[101, 0, 0, 0], [0, 101, 0, 0], [0, 0, 101, 0], [-28, 39, 45, 1]], lll_reduce=False)
-            sage: float(L.hadamard_ratio())
-            0.351096481348176
-            sage: L.LLL()
-            [  1  -5   2  18]
-            [ -5  25 -10  11]
-            [-17 -16 -34  -3]
-            [-39  -7  23   5]
-            sage: float(L.hadamard_ratio())
-            0.9933322263147489
-        """
-        if use_reduced_basis:
-            basis = self.reduced_basis
-        else:
-            basis = self.basis_matrix()
-        
-        n = basis.nrows()
-        r = self.rank()
-        assert r == n
-        
-        ratio = (self.discriminant().sqrt() / prod([v.norm() for v in basis]))**(1/r)
-        assert 0 < ratio <= 1
-        return ratio
 
     def gaussian_heuristic(self, exact_form=False):
         """