passagemath-modules 10.6.31__cp314-cp314-musllinux_1_2_x86_64.whl

sage/quadratic_forms/constructions.py

@@ -0,0 +1,93 @@
+# sage_setup: distribution = sagemath-modules
+"""
+Constructions of quadratic forms
+"""
+##
+# Some extra routines to make the QuadraticForm class more useful.
+##
+
+from sage.rings.integer_ring import ZZ
+from sage.rings.polynomial.polynomial_element import Polynomial
+from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
+from sage.quadratic_forms.quadratic_form import QuadraticForm
+
+
+def BezoutianQuadraticForm(f, g):
+    r"""
+    Compute the Bezoutian of two polynomials defined over a common base ring.  This is defined by
+
+    .. MATH::
+
+        {\rm Bez}(f, g) := \frac{f(x) g(y) - f(y) g(x)}{y - x}
+
+    and has size defined by the maximum of the degrees of `f` and `g`.
+
+    INPUT:
+
+    - ``f``, ``g`` -- polynomials in `R[x]`, for some ring `R`
+
+    OUTPUT: a quadratic form over `R`
+
+    EXAMPLES::
+
+        sage: R = PolynomialRing(ZZ, 'x')
+        sage: f = R([1,2,3])
+        sage: g = R([2,5])
+        sage: Q = BezoutianQuadraticForm(f, g); Q                                       # needs sage.libs.singular
+        Quadratic form in 2 variables over Integer Ring with coefficients:
+        [ 1 -12 ]
+        [ * -15 ]
+
+    AUTHORS:
+
+    - Fernando Rodriguez-Villegas, Jonathan Hanke -- added on 11/9/2008
+    """
+    # Check that f and g are polynomials with a common base ring
+    if not isinstance(f, Polynomial) or not isinstance(g, Polynomial):
+        raise TypeError("one of your inputs is not a polynomial")
+    if f.base_ring() != g.base_ring():   # TO DO:  Change this to allow coercion!
+        raise TypeError("these polynomials are not defined over the same coefficient ring")
+
+    # Initialize the quadratic form
+    R = f.base_ring()
+    P = PolynomialRing(R, ['x', 'y'])
+    a, b = P.gens()
+    n = max(f.degree(), g.degree())
+    Q = QuadraticForm(R, n)
+
+    # Set the coefficients of Bezoutian
+    bez_poly = (f(a) * g(b) - f(b) * g(a)) // (b - a)    # Truncated (exact) division here
+    for i in range(n):
+        for j in range(i, n):
+            if i == j:
+                Q[i, j] = bez_poly.coefficient({a: i, b: j})
+            else:
+                Q[i, j] = bez_poly.coefficient({a: i, b: j}) * 2
+
+    return Q
+
+
+def HyperbolicPlane_quadratic_form(R, r=1):
+    """
+    Construct the direct sum of `r` copies of the quadratic form `xy`
+    representing a hyperbolic plane defined over the base ring `R`.
+
+    INPUT:
+
+    - ``R`` -- a ring
+    - ``n`` -- integer (default: 1); number of copies
+
+    EXAMPLES::
+
+        sage: HyperbolicPlane_quadratic_form(ZZ)
+        Quadratic form in 2 variables over Integer Ring with coefficients:
+        [ 0 1 ]
+        [ * 0 ]
+    """
+    r = ZZ(r)
+    # Check that the multiplicity is a natural number
+    if r < 1:
+        raise TypeError("the multiplicity r must be a natural number")
+
+    H = QuadraticForm(R, 2, [0, 1, 0])
+    return sum([H for i in range(r - 1)], H)

sage/quadratic_forms/count_local_2.pyx

@@ -0,0 +1,365 @@
+# sage_setup: distribution = sagemath-modules
+r"""
+Optimized counting of congruence solutions
+"""
+from sage.arith.misc import is_prime, kronecker as kronecker_symbol, valuation
+from sage.rings.finite_rings.integer_mod import Mod
+from sage.rings.finite_rings.integer_mod_ring import IntegerModRing
+
+
+def count_modp__by_gauss_sum(n, p, m, Qdet):
+    r"""
+    Return the number of solutions of `Q(x) = m` over the finite field
+    `\ZZ/p\ZZ`, where `p` is a prime number > 2 and `Q` is a non-degenerate
+    quadratic form of dimension `n \geq 1` and has Gram determinant ``Qdet``.
+
+    REFERENCE:
+
+    These are defined in Table 1 on p363 of Hanke's "Local Densities..." paper.
+
+    INPUT:
+
+    - ``n`` -- integer `\geq 1`
+    - ``p`` -- a prime number > 2
+    - ``m`` -- integer
+    - ``Qdet`` -- a integer which is nonzero mod `p`
+
+    OUTPUT: integer `\geq 0`
+
+    EXAMPLES::
+
+        sage: from sage.quadratic_forms.count_local_2 import count_modp__by_gauss_sum
+
+        sage: count_modp__by_gauss_sum(3, 3, 0, 1)    # for Q = x^2 + y^2 + z^2  => Gram Det = 1 (mod 3)
+        9
+        sage: count_modp__by_gauss_sum(3, 3, 1, 1)    # for Q = x^2 + y^2 + z^2  => Gram Det = 1 (mod 3)
+        6
+        sage: count_modp__by_gauss_sum(3, 3, 2, 1)    # for Q = x^2 + y^2 + z^2  => Gram Det = 1 (mod 3)
+        12
+
+        sage: Q = DiagonalQuadraticForm(ZZ, [1,1,1])
+        sage: [Q.count_congruence_solutions(3, 1, m, None, None)
+        ....:    == count_modp__by_gauss_sum(3, 3, m, 1)
+        ....:  for m in range(3)]
+        [True, True, True]
+
+
+        sage: count_modp__by_gauss_sum(3, 3, 0, 2)    # for Q = x^2 + y^2 + 2*z^2  => Gram Det = 2 (mod 3)
+        9
+        sage: count_modp__by_gauss_sum(3, 3, 1, 2)    # for Q = x^2 + y^2 + 2*z^2  => Gram Det = 2 (mod 3)
+        12
+        sage: count_modp__by_gauss_sum(3, 3, 2, 2)    # for Q = x^2 + y^2 + 2*z^2  => Gram Det = 2 (mod 3)
+        6
+
+        sage: Q = DiagonalQuadraticForm(ZZ, [1,1,2])
+        sage: [Q.count_congruence_solutions(3, 1, m, None, None)
+        ....:    == count_modp__by_gauss_sum(3, 3, m, 2)
+        ....:  for m in range(3)]
+        [True, True, True]
+    """
+    # Check that Qdet is non-degenerate
+    if Qdet % p == 0:
+        raise RuntimeError("Qdet must be nonzero.")
+
+    # Check that p is prime > 2
+    if not is_prime(p) or p == 2:
+        raise RuntimeError("p must be a prime number > 2.")
+
+    # Check that n >= 1
+    if n < 1:
+        raise RuntimeError("the dimension n must be >= 1.")
+
+    # Compute the Gauss sum
+    neg1 = -1
+    if not m % p:
+        if n % 2:
+            count = p**(n - 1)
+        else:
+            count = p**(n - 1) + (p - 1) * (p**((n - 2) // 2)) * kronecker_symbol(((neg1**(n // 2)) * Qdet) % p, p)
+    else:
+        if n % 2:
+            count = p**(n - 1) + p**((n - 1) // 2) * kronecker_symbol(((neg1**((n - 1) // 2)) * Qdet * m) % p, p)
+        else:
+            count = p**(n - 1) - p**((n - 2) // 2) * kronecker_symbol(((neg1**(n // 2)) * Qdet) % p, p)
+
+    # Return the result
+    return count
+
+
+cdef CountAllLocalTypesNaive_cdef(Q, p, k, m, zvec, nzvec):
+    """
+    This Cython routine is documented in its Python wrapper method
+    QuadraticForm.count_congruence_solutions_by_type().
+    """
+    cdef long n, i
+    cdef long a, b    # Used to quickly evaluate Q(v)
+    cdef long ptr     # Used to increment the vector
+    cdef long solntype    # Used to store the kind of solution we find
+
+    # Some shortcuts and definitions
+    n = Q.dim()
+    R = p ** k
+    Q1 = Q.change_ring(IntegerModRing(R))
+
+    # Initialize the counting vector
+    count_vector = [0 for i in range(6)]
+
+    # Initialize v = (0, ... , 0)
+    v = [Mod(0, R) for i in range(n)]
+
+    # Some declarations to speed up the loop
+    R_n = R ** n
+    m1 = Mod(m, R)
+
+    # Count the local solutions
+    for i in range(R_n):
+
+        # Perform a carry (when value = R-1) until we can increment freely
+        ptr = len(v)
+        while ((ptr > 0) and (v[ptr - 1] == R - 1)):
+            v[ptr - 1] += 1
+            ptr += -1
+
+        # Only increment if we're not already at the zero vector =)
+        if ptr > 0:
+            v[ptr - 1] += 1
+
+        # Evaluate Q(v) quickly
+        tmp_val = Mod(0, R)
+        for a from 0 <= a < n:
+            for b from a <= b < n:
+                tmp_val += Q1[a, b] * v[a] * v[b]
+
+        # Sort the solution by it's type
+        # if Q1(v) == m1:
+        if tmp_val == m1:
+            solntype = local_solution_type_cdef(Q1, p, v, zvec, nzvec)
+            if solntype != 0:
+                count_vector[solntype] += 1
+
+    # Generate the Bad-type and Total counts
+    count_vector[3] = count_vector[4] + count_vector[5]
+    count_vector[0] = count_vector[1] + count_vector[2] + count_vector[3]
+
+    # Return the solution counts
+    return count_vector
+
+
+def CountAllLocalTypesNaive(Q, p, k, m, zvec, nzvec):
+    r"""
+    This is an internal routine, which is called by
+    :meth:`sage.quadratic_forms.quadratic_form.QuadraticForm.count_congruence_solutions_by_type
+    QuadraticForm.count_congruence_solutions_by_type`. See the documentation of
+    that method for more details.
+
+    INPUT:
+
+    - ``Q`` -- quadratic form over `\ZZ`
+    - ``p`` -- prime number > 0
+    - ``k`` -- integer > 0
+    - ``m`` -- integer (depending only on mod `p^k`)
+    - ``zvec``, ``nzvec`` -- list of integers in ``range(Q.dim())``, or ``None``
+
+    OUTPUT:
+
+    a list of six integers `\ge 0` representing the solution types: ``[All,
+    Good, Zero, Bad, BadI, BadII]``
+
+    EXAMPLES::
+
+        sage: from sage.quadratic_forms.count_local_2 import CountAllLocalTypesNaive
+        sage: Q = DiagonalQuadraticForm(ZZ, [1,2,3])
+        sage: CountAllLocalTypesNaive(Q, 3, 1, 1, None, None)
+        [6, 6, 0, 0, 0, 0]
+        sage: CountAllLocalTypesNaive(Q, 3, 1, 2, None, None)
+        [6, 6, 0, 0, 0, 0]
+        sage: CountAllLocalTypesNaive(Q, 3, 1, 0, None, None)
+        [15, 12, 1, 2, 0, 2]
+    """
+    return CountAllLocalTypesNaive_cdef(Q, p, k, m, zvec, nzvec)
+
+
+cdef local_solution_type_cdef(Q, p, w, zvec, nzvec):
+    """
+    Internal routine to check if a given solution vector `w` (of `Q(w) =
+    m` mod `p^k`) is of a certain local type and satisfies certain
+    congruence conditions mod `p`.
+
+    NOTE: No internal checking is done to test if `p` is a prime >=2, or
+    that Q has the same size as `w`.
+    """
+    cdef long i
+    cdef long n
+
+    n = Q.dim()
+
+    # Check if the solution satisfies the zvec "zero" congruence conditions
+    # (either zvec is empty or its components index the zero vector mod p)
+    if zvec is None or not zvec:
+        zero_flag = True
+    else:
+        zero_flag = False
+        i = 0
+        while i < len(zvec) and not w[zvec[i]] % p:  # Increment so long as our entry is zero (mod p)
+            i += 1
+        if i == len(zvec):      # If we make it through all entries then the solution is zero (mod p)
+            zero_flag = True
+
+    # DIAGNOSTIC
+    # print("IsLocalSolutionType: Finished the Zero congruence condition test \n")
+
+    if not zero_flag:
+        return <long> 0
+
+    # DIAGNOSTIC
+    # print("IsLocalSolutionType: Passed the Zero congruence condition test \n")
+
+    # Check if the solution satisfies the nzvec "nonzero" congruence conditions
+    # (nzvec is non-empty and its components index a nonzero vector mod p)
+    if nzvec is None:
+        nonzero_flag = True
+    elif len(nzvec) == 0:
+        nonzero_flag = False           # Trivially no solutions in this case!
+    else:
+        nonzero_flag = False
+        i = 0
+        while not nonzero_flag and i < len(nzvec):
+            if w[nzvec[i]] % p:
+                nonzero_flag = True           # The nonzero condition is satisfied when we find one nonzero entry
+            i += 1
+
+    if not nonzero_flag:
+        return <long> 0
+
+    # Check if the solution has the appropriate (local) type:
+    # -------------------------------------------------------
+
+    # 1: Check Good-type
+    for i in range(n):
+        if w[i] % p and Q[i, i] % p:
+            return <long> 1
+    if p == 2:
+        for i in range(n - 1):
+            if Q[i, i + 1] % p and (w[i] % p or w[i + 1] % p):
+                return <long> 1
+
+    # 2: Check Zero-type
+    Zero_flag = True
+    for i in range(n):
+        if w[i] % p:
+            Zero_flag = False
+    if Zero_flag:
+        return <long> 2
+
+    # Check if wS1 is zero or not
+    wS1_nonzero_flag = False
+    for i from 0 <= i < n:
+
+        # Compute the valuation of each index, allowing for off-diagonal terms
+        if Q[i, i] == 0:
+            if i == 0:
+                val = valuation(Q[i, i + 1], p)   # Look at the term to the right
+            elif i == n - 1:
+                val = valuation(Q[i - 1, i], p)   # Look at the term above
+            else:
+                val = valuation(Q[i, i + 1] + Q[i - 1, i], p)  # Finds the valuation of the off-diagonal term since only one isn't zero
+        else:
+            val = valuation(Q[i, i], p)
+
+        # Test each index
+        if val == 1 and w[i] % p:
+            wS1_nonzero_flag = True
+
+    # 4: Check Bad-type I
+    if wS1_nonzero_flag:
+        return <long> 4
+
+    # 5: Check Bad-type II
+    if not wS1_nonzero_flag:
+        return <long> 5
+
+    # Error if we get here! =o
+    print("   Solution vector is " + str(w))
+    print("   and Q is \n" + str(Q) + "\n")
+    raise RuntimeError("Error in IsLocalSolutionType: Should not execute this line... =( \n")
+
+
+def count_all_local_good_types_normal_form(Q, p, k, m, zvec, nzvec):
+    r"""
+    This is an internal routine, which is called by
+    :meth:`sage.quadratic_forms.quadratic_form.QuadraticForm.local_good_density_congruence_even
+    QuadraticForm.local_good_density_congruence_even`. See the documentation of
+    that method for more details.
+
+    INPUT:
+
+    - ``Q`` -- quadratic form over `\ZZ` in local normal form at p with no zero blocks mod `p^k`
+    - ``p`` -- prime number > 0
+    - ``k`` -- integer > 0
+    - ``m`` -- non-negative integer (depending only on mod `p^k`)
+    - ``zvec``, ``nzvec`` -- list of integers in ``range(Q.dim())``, or ``None``
+
+    OUTPUT:
+
+    a non-negative integer giving the number of solutions of Good type.
+
+    EXAMPLES::
+
+        sage: # needs sage.libs.pari
+        sage: from sage.quadratic_forms.count_local_2 import count_all_local_good_types_normal_form
+        sage: Q = DiagonalQuadraticForm(ZZ, [1,2,3])
+        sage: Q_local_at2 = Q.local_normal_form(2)
+        sage: Q_local_at3 = Q.local_normal_form(3)
+        sage: count_all_local_good_types_normal_form(Q_local_at2, 2, 3, 3, None, None)
+        64
+        sage: count_all_local_good_types_normal_form(Q_local_at2, 2, 3, 3, [0], None)
+        32
+        sage: count_all_local_good_types_normal_form(Q_local_at3, 3, 2, 1, None, None)
+        54
+    """
+    n = Q.dim()
+    if n == 0:
+        return 0
+
+    m_range = p**k
+    if zvec is None:
+        zvec = []
+    if nzvec is None:
+        nzvec = []
+
+    # determine local blocks
+    blocks = []
+    i = 0
+    while i < n - 1:
+        if Q[i, i + 1] != 0:
+            blocks += [(i, i + 1)]
+            i += 2
+        else:
+            blocks += [(i,)]
+            i += 1
+    if i < n:
+        blocks += [(i,)]
+
+    solutions = [[0, 0] for _ in range(m_range)]  # [good, not good]
+    solutions[0][1] = 1
+    for b in blocks:
+        Q_part = Q.extract_variables(b)
+        zvec_local = range(len(b)) if (b[0] in zvec) else None
+        nzvec_local = range(len(b)) if (b[0] in nzvec) else None
+
+        solutions_part = [[0, 0] for _ in range(m_range)]
+        for m_part in range(m_range):
+            cnt = CountAllLocalTypesNaive(Q_part, p, k, m_part, zvec_local, nzvec_local)
+            solutions_part[m_part][0] = cnt[1]
+            solutions_part[m_part][1] = cnt[0] - cnt[1]
+
+        # compute convolution of counts
+        solutions_new = [[0, 0] for _ in range(m_range)]
+        for m1 in range(m_range):
+            for m2 in range(m_range):
+                total = (solutions[m1][0] + solutions[m1][1]) * (solutions_part[m2][0] + solutions_part[m2][1])
+                good = total - solutions[m1][1] * solutions_part[m2][1]
+                solutions_new[(m1 + m2) % m_range][0] += good
+                solutions_new[(m1 + m2) % m_range][1] += total - good
+        solutions = solutions_new
+    return solutions[m % m_range][0]

sage/quadratic_forms/extras.py

@@ -0,0 +1,195 @@
+# sage_setup: distribution = sagemath-modules
+"""
+Extra functions for quadratic forms
+"""
+
+from sage.matrix.constructor import matrix
+from sage.structure.element import Matrix
+from sage.arith.misc import legendre_symbol
+from sage.rings.integer_ring import ZZ
+
+
+def is_triangular_number(n, return_value=False) -> bool | tuple:
+    """
+    Return whether ``n`` is a triangular number.
+
+    A *triangular number* is a number of the form `k(k+1)/2` for some
+    nonnegative integer `n`. See :wikipedia:`Triangular_number`. The sequence
+    of triangular number is references as A000217 in the Online encyclopedia of
+    integer sequences (OEIS).
+
+    If you want to get the value of `k` for which `n=k(k+1)/2` set the
+    argument ``return_value`` to ``True`` (see the examples below).
+
+    INPUT:
+
+    - ``n`` -- integer
+
+    - ``return_value`` -- boolean (default: ``False``); if set to
+      ``True`` the function returns a pair made of a boolean and the value `v`
+      such that `v(v+1)/2 = n`
+
+    EXAMPLES::
+
+        sage: is_triangular_number(3)
+        True
+        sage: is_triangular_number(3, return_value=True)
+        (True, 2)
+
+        sage: is_triangular_number(2)
+        False
+        sage: is_triangular_number(2, return_value=True)
+        (False, None)
+
+        sage: is_triangular_number(25*(25+1)/2)
+        True
+
+        sage: is_triangular_number(10^6 * (10^6 +1)/2, return_value=True)
+        (True, 1000000)
+
+    TESTS::
+
+        sage: F1 = [n for n in range(1,100*(100+1)/2)
+        ....:       if is_triangular_number(n)]
+        sage: F2 = [n*(n+1)/2 for n in range(1,100)]
+        sage: F1 == F2
+        True
+
+        sage: for n in range(1000):
+        ....:     res,v = is_triangular_number(n,return_value=True)
+        ....:     assert res == is_triangular_number(n)
+        ....:     if res: assert v*(v+1)/2 == n
+    """
+    n = ZZ(n)
+
+    if return_value:
+        if n < 0:
+            return (False, None)
+        if n == 0:
+            return (True, ZZ.zero())
+        s, r = (8 * n + 1).sqrtrem()
+        if r:
+            return (False, None)
+        return (True, (s - 1) // 2)
+
+    return (8 * n + 1).is_square()
+
+
+def extend_to_primitive(A_input):
+    r"""
+    Given a matrix (resp. list of vectors), extend it to a square
+    matrix (resp. list of vectors), such that its determinant is the
+    gcd of its minors (i.e. extend the basis of a lattice to a
+    "maximal" one in `\ZZ^n`).
+
+    Author(s): Gonzalo Tornaria and Jonathan Hanke.
+
+    INPUT:
+
+    - ``A_input`` -- a matrix or a list of length n vectors (in the same space)
+
+    OUTPUT: a square matrix or a list of n vectors (resp.)
+
+    EXAMPLES::
+
+        sage: A = Matrix(ZZ, 3, 2, range(6))
+        sage: extend_to_primitive(A)                                                    # needs sage.libs.pari
+        [ 0  1 -1]
+        [ 2  3  0]
+        [ 4  5  0]
+
+        sage: extend_to_primitive([vector([1,2,3])])                                    # needs sage.libs.pari
+        [(1, 2, 3), (0, 1, 1), (-1, 0, 0)]
+    """
+    # Deal with a list of vectors
+    if not isinstance(A_input, Matrix):
+        A = matrix(A_input)      # Make a matrix A with the given rows.
+        vec_output_flag = True
+    else:
+        A = A_input
+        vec_output_flag = False
+
+    # Arrange for A  to have more columns than rows.
+    if A.is_square():
+        return A
+    if A.nrows() > A.ncols():
+        return extend_to_primitive(A.transpose()).transpose()
+
+    # Setup
+    k = A.nrows()
+    n = A.ncols()
+    R = A.base_ring()
+
+    # Smith normal form transformation, assuming more columns than rows
+    V = A.smith_form()[2]
+
+    # Extend the matrix in new coordinates, then switch back.
+    B = A * V
+    B_new = matrix(R, n - k, n)
+    for i in range(n - k):
+        B_new[i, n - i - 1] = 1
+    C = B.stack(B_new)
+    D = C * V**(-1)
+
+    # Normalize for a positive determinant
+    if D.det() < 0:
+        D.rescale_row(n - 1, -1)
+
+    # Return the current information
+    if vec_output_flag:
+        return D.rows()
+    else:
+        return D
+
+
+def least_quadratic_nonresidue(p):
+    r"""
+    Return the smallest positive integer quadratic non-residue in `\ZZ/p\ZZ` for primes `p>2`.
+
+    EXAMPLES::
+
+        sage: least_quadratic_nonresidue(5)
+        2
+        sage: [least_quadratic_nonresidue(p) for p in prime_range(3, 100)]              # needs sage.libs.pari
+        [2, 2, 3, 2, 2, 3, 2, 5, 2, 3, 2, 3, 2, 5, 2, 2, 2, 2, 7, 5, 3, 2, 3, 5]
+
+    TESTS:
+
+    This raises an error if input is a positive composite integer. ::
+
+        sage: least_quadratic_nonresidue(20)
+        Traceback (most recent call last):
+        ...
+        ValueError: p must be a prime number > 2
+
+    This raises an error if input is 2. This is because every integer is a
+    quadratic residue modulo 2. ::
+
+        sage: least_quadratic_nonresidue(2)
+        Traceback (most recent call last):
+        ...
+        ValueError: there are no quadratic non-residues in Z/2Z
+    """
+    p1 = abs(p)
+
+    # Deal with the prime p = 2 and |p| <= 1.
+    if p1 == 2:
+        raise ValueError("there are no quadratic non-residues in Z/2Z")
+    if p1 < 2:
+        raise ValueError("p must be a prime number > 2")
+
+    # Find the smallest non-residue mod p
+    # For 7/8 of primes the answer is 2, 3 or 5:
+    if p % 8 in (3, 5):
+        return ZZ(2)
+    if p % 12 in (5, 7):
+        return ZZ(3)
+    if p % 5 in (2, 3):
+        return ZZ(5)
+    # default case (first needed for p=71):
+    if not p.is_prime():
+        raise ValueError("p must be a prime number > 2")
+    from sage.arith.srange import xsrange
+    for r in xsrange(7, p):
+        if legendre_symbol(r, p) == -1:
+            return ZZ(r)