snappy 3.2__cp310-cp310-macosx_10_12_x86_64.whl

snappy/dev/extended_ptolemy/extended.py

@@ -0,0 +1,406 @@
+"""
+Computing the extended Ptolemy variety of Goerner-Zickert for N = 2.
+"""
+import snappy
+import snappy.snap.t3mlite as t3m
+import snappy.snap.peripheral as peripheral
+from sage.all import ZZ, QQ, GF, gcd, PolynomialRing, cyclotomic_polynomial
+
+directed_edges = [(a, b) for a in range(4) for b in range(4) if a < b]
+
+edge_to_var = {e:i for i, e in enumerate(directed_edges)}
+
+t3m_edge_to_tuple = {t3m.E01:(0,1), t3m.E02:(0,2), t3m.E03:(0,3),
+                         t3m.E12:(1,2), t3m.E13:(1,3), t3m.E23:(2,3)}
+
+to_t3m_edge = {(0,1):t3m.E01, (0,2):t3m.E02, (0,3):t3m.E03,
+                         (1,2):t3m.E12, (1,3):t3m.E13, (2,3):t3m.E23}
+
+
+def arrow(mcomplex, tet, face, edge):
+    return t3m.Arrow(to_t3m_edge[edge], t3m.TwoSubsimplices[face],
+                     mcomplex.Tetrahedra[tet])
+
+
+def faces_around_edge(mcomplex, tet, edge):
+    face = min(set(range(4)) - set(edge))
+    ans = [(tet, face, edge)]
+    A0 = arrow(mcomplex, tet, face, edge)
+    A = A0.copy().next()
+    while A != A0:
+        tet = A.Tetrahedron.Index
+        face = t3m.FaceIndex[A.Face]
+        edge = t3m_edge_to_tuple[A.Edge]
+        ans.append((tet, face, edge))
+        A.next()
+    return ans
+
+def lex_first_edge_starts(mcomplex):
+    """
+    Returns a list of containing tuples of the form (tet, face, edge),
+    one at each edge.
+    """
+    T = mcomplex
+    ans = []
+    for edge in T.Edges:
+        poss_starts = []
+        for C in edge.Corners:
+            t = C.Tetrahedron.Index
+            e = t3m_edge_to_tuple[C.Subsimplex]
+            poss_starts.append((t, e))
+        ans.append(min(poss_starts))
+    return sorted(ans)
+
+def arrows_around_edges(manifold):
+    T = t3m.Mcomplex(manifold)
+    starts = lex_first_edge_starts(T)
+    ans = []
+    return [faces_around_edge(T, tet, edge) for tet, edge in starts]
+
+
+def parse_ptolemy_edge(var):
+    c, index, tet = var.split('_')
+    tet = int(tet)
+    edge = tuple(i for i in range(4) if index[i] == '1')
+    return tet, edge
+
+
+def parse_ptolemy_face(var):
+    s, index, tet = var.split('_')
+    return int(tet), int(index)
+
+
+class EdgeGluings():
+    def __init__(self, gen_obs_class):
+        assert gen_obs_class._N == 2
+        M = gen_obs_class._manifold
+        n = M.num_tetrahedra()
+        gluings = t3m.files.read_SnapPea_file(data=M._to_string())
+        primary_faces = [parse_ptolemy_face(x[2]) for x in
+                         M._ptolemy_equations_identified_face_classes()]
+        ptolemy_idents = M._ptolemy_equations_identified_coordinates(2, gen_obs_class.H2_class)
+        self.edge_gluings = edge_gluings = dict()
+
+        for i, (tet0, face0) in enumerate(primary_faces):
+            for j in range(3):
+                orient_sign, obs_contrib, edge_var_0, edge_var_1 = ptolemy_idents[3*i + j]
+                sign = orient_sign * (-1)**obs_contrib
+                tet0alt, edge0 = parse_ptolemy_edge(edge_var_0)
+                tet1, edge1 = parse_ptolemy_edge(edge_var_1)
+                perm = gluings[tet0][1][face0]
+                face1 = perm[face0]
+                edge_gluings[tet0, face0, edge0] = [(tet1, face1, edge1), sign]
+                edge_gluings[tet1, face1, edge1] = [(tet0, face0, edge0), sign]
+
+                # Sanity checks that our enumeration of the face
+                # idenifications and edges agrees with
+                # "ptolemy_coordinates.c".
+                assert tet0 == tet0alt
+                assert tet1 == gluings[tet0][0][face0]
+                a, b = edge0
+                c, d = edge1
+                if perm[a] == c and perm[b] == d:
+                    assert orient_sign == 1
+                else:
+                    assert perm[a] == d and perm[b] == c and orient_sign == -1
+
+    def __getitem__(self, index):
+        return self.edge_gluings[index]
+
+def simplify_equation(poly):
+    """
+    Simplifies the given polynomial in three ways:
+
+    1. Cancels any M*m and L*l pairs.
+
+    2. Sets a0 = 1.
+
+    3. Since all variables represent non-zero quantities, divides by
+       the gcd of the monomials terms.
+
+    sage: R = PolynomialRing(QQ, ['M', 'L', 'm', 'l', 'a0', 'x', 'y', 'z'])
+    sage: simplify_equation(R('5*M*m^2*L*l^3*x*y + 3*M*m*L*l + 11*M^10*m^3*L^5*l^2*z'))
+    11*M^7*L^3*z + 5*m*l^2*x*y + 3
+    sage: simplify_equation(R('-a0*x + M^7*m^7*x + L^9*l^3*z + a0^2'))
+    L^6*z + 1
+    sage: simplify_equation(R('M^2*L*a0*x - M*L*y^2*x + M*z^2*x'))
+    -L*y^2 + M*L + z^2
+    """
+    R = poly.parent()
+    ans = R.zero()
+    try:
+        # Should we just permanently commit to c_1100_0
+        poly = poly.subs(a0=1)
+    except:
+        poly = poly.subs(c_1100_0=1)
+
+    for coeff, monomial in list(poly):
+        e = monomial.exponents()[0]
+        M_exp = e[0] - e[2]
+        L_exp = e[1] - e[3]
+        if M_exp >= 0:
+            M_p, M_n = M_exp, 0
+        else:
+            M_p, M_n = 0, -M_exp
+        if L_exp >= 0:
+            L_p, L_n = L_exp, 0
+        else:
+            L_p, L_n = 0, -L_exp
+        ans += coeff * R.monomial(M_p, L_p, M_n, L_n, *e[4:])
+    ans = ans // gcd([mono for coeff, mono in list(ans)])
+    return ans
+
+def extended_ptolemy_equations(manifold, gen_obs_class=None,
+                               nonzero_cond=True, return_full_var_dict = False,
+                               notation = 'short'):
+    r"""
+    We assign ptolemy coordinates ['a', 'b', 'c', 'd', 'e', 'f'] to the
+    *directed* edges::
+
+        [(0, 1), (0, 2), (0, 3), (1, 2), (1, 3), (2, 3)]
+
+
+    where recall that the basic orientation convention of t3m and
+    SnapPy is that a positively oriented simplex is as below. ::
+
+             1
+            /|\
+         d / | \ e
+          /  |  \
+         /   |   \
+        2----|----3   with back edge from 2 to 3 labelled f.
+         \   |   /
+        b \  |a / c
+           \ | /
+            \|/
+             0
+
+    sage: M = Manifold('m016')
+    sage: I = extended_ptolemy_equations(M)
+    sage: I.dimension()
+    1
+    """
+    if gen_obs_class is None:
+        gen_obs_class = manifold.ptolemy_generalized_obstruction_classes(2)[0]
+
+    m_star, l_star = peripheral.peripheral_cohomology_basis(manifold)
+
+    n = manifold.num_tetrahedra()
+
+    if notation == 'short':
+        var_names = ['a', 'b', 'c', 'd', 'e', 'f']
+        first_var_name = 'a0'
+    else:
+        var_names = ['c_1100_',
+                     'c_1010_',
+                     'c_1001_',
+                     'c_0110_',
+                     'c_0101_',
+                     'c_0011_']
+        first_var_name = 'c_1100_0'
+
+    tet_vars = [x + repr(d) for d in range(n) for x in var_names]
+
+    def var(tet, edge):
+        return tet_vars[6*tet + directed_edges.index(edge)]
+
+    all_arrows = arrows_around_edges(manifold)
+    independent_vars = [var(a[0][0], a[0][2]) for a in all_arrows]
+    assert first_var_name in independent_vars
+    if nonzero_cond:
+        nonzero_cond_vars = [v.swapcase() for v in independent_vars]
+    else:
+        nonzero_cond_vars = []
+    R = PolynomialRing(QQ, ['M', 'L', 'm', 'l'] + independent_vars + nonzero_cond_vars)
+    M, L, m, l= R('M'), R('L'), R('m'), R('l')
+
+    def var(tet, edge):
+        return tet_vars[6*tet + directed_edges.index(edge)]
+
+    in_terms_of_indep_vars = {v:R(v) for v in independent_vars}
+    in_terms_of_indep_vars['M'] = M
+    in_terms_of_indep_vars['L'] = L
+    edge_gluings = EdgeGluings(gen_obs_class)
+
+    in_terms_of_indep_vars_data = { v: (1, 0, 0, v) for v in independent_vars }
+
+    for around_one_edge in arrows_around_edges(manifold):
+        tet0, face0, edge0 = around_one_edge[0]
+        indep_var = R(var(tet0, edge0))
+        sign, m_e, l_e = 1, 0, 0
+        for tet1, face1, edge1 in around_one_edge[:-1]:
+            (tet2, face2, edge2), a_sign = edge_gluings[tet1, face1, edge1]
+            sign = a_sign * sign
+            m_e -= sum(m_star[tet1, t3m.TwoSubsimplices[face1], t3m.ZeroSubsimplices[v]] for v in edge1)
+            l_e -= sum(l_star[tet1, t3m.TwoSubsimplices[face1], t3m.ZeroSubsimplices[v]] for v in edge1)
+            mvar = M if m_e > 0 else m
+            lvar = L if l_e > 0 else l
+            dep_var = var(tet2, edge2)
+            in_terms_of_indep_vars_data[dep_var] = (sign, m_e, l_e, var(tet0, edge0))
+            in_terms_of_indep_vars[dep_var] = sign*(mvar**abs(m_e))*(lvar**abs(l_e))*indep_var
+
+    tet_vars = [in_terms_of_indep_vars[v] for v in tet_vars]
+    rels = [R(first_var_name) - 1, M*m - 1, L*l - 1]
+    for tet in range(n):
+        a, b, c, d, e, f = tet_vars[6*tet:6*(tet+1)]
+        rels.append(simplify_equation(c*d + a*f - b*e))
+
+    # These last equations ensure the ptolemy coordinates are nonzero.
+    # For larger numbers of tetrahedra, this appears to make computing
+    # Groebner basis much faster even though there are extra variables
+    # compared the approach where one uses a single variable.
+
+    if nonzero_cond:
+        for v in independent_vars:
+            rels.append(R(v) * R(v.swapcase()) - 1)
+
+    if return_full_var_dict == 'data':
+        return R.ideal(rels), in_terms_of_indep_vars_data
+    if return_full_var_dict:
+        return R.ideal(rels), in_terms_of_indep_vars
+    else:
+        return R.ideal(rels)
+
+
+def apoly(manifold, rational_coeff=False, method='sage'):
+    """
+    Computes the SL(2, C) version of the A-polynomial starting from
+    the extended Ptolemy variety.
+
+    By default, uses Sage (which is to say Singular) to eliminate
+    variables.  Surprisingly, Macaulay2 is *much* slower.
+
+    sage: M = Manifold('m003')
+    sage: I = apoly(M)
+    sage: I.gens()
+    [M^4*L^2 + M^3*L^2 - M*L^4 - 2*M^2*L^2 - M^3 + M*L^2 + L^2]
+    """
+    I = extended_ptolemy_equations(manifold)
+    R = I.ring()
+    if rational_coeff is False:
+        F = GF(31991)
+        R = R.change_ring(F)
+        I = I.change_ring(R)
+    to_elim = [R(x) for x in R.variable_names() if x not in ['M', 'L']]
+    if method == 'sage':
+        return I.elimination_ideal(to_elim)
+    elif method == 'M2':
+        from sage.all import macaulay2
+        I_m2 = macaulay2(I)
+        return I_m2.eliminate('{' + repr(to_elim)[1:-1] + '}').to_sage()
+    else:
+        raise ValueError("method flag should be in ['sage', 'M2']")
+
+
+def sample_apoly_points_via_giac_rur(manifold, n):
+    import giac_rur
+    I = extended_ptolemy_equations(manifold)
+    R = I.ring()
+    p = cyclotomic_polynomial(n, var=R('M'))
+    I = I + [p]
+    return giac_rur.rational_univariate_representation(I)
+
+def ptolemy_ideal_for_filled(manifold, nonzero_cond=True, return_full_var_dict=False, notation = 'short'):
+    assert manifold.cusp_info('is_complete') == [False]
+    a, b = [int(x) for x in manifold.cusp_info(0)['filling']]
+    I, var_dict = extended_ptolemy_equations(
+        manifold, nonzero_cond=nonzero_cond,
+        return_full_var_dict = True if not return_full_var_dict else return_full_var_dict,
+        notation = notation)
+    R = I.ring()
+    if (a, b) == (1, 0):
+        new_gens = [p.subs(M=1, m=1) for p in I.gens()] + [R('M - 1'), R('m - 1')]
+        I = R.ideal([p for p in new_gens if p != 0])
+    else:
+        mvar = R('M') if a > 0 else R('m')
+        lvar = R('l') if b > 0 else R('L')
+        I = I + [mvar**abs(a) - lvar**abs(b)]
+    if return_full_var_dict:
+        return I, var_dict
+    else:
+        return I
+
+def rur_for_dehn_filling(manifold):
+    import giac_rur
+    I = ptolemy_ideal_for_filled(manifold)
+    return giac_rur.rational_univariate_representation(I)
+
+def test_as_cusped(manifold):
+    import giac_rur
+    for obs in manifold.ptolemy_generalized_obstruction_classes(2):
+        I = extended_ptolemy_equations(manifold, obs)
+        R = I.ring()
+        M, L = R('M'), R('L')
+        I = I + [M - 1, L - 1]
+        if I.dimension() == 0:
+            print(giac_rur.rational_univariate_representation(I))
+
+def test_direct(manifold):
+    import giac_rur
+    for obs in manifold.ptolemy_generalized_obstruction_classes(2):
+        I = manifold.ptolemy_variety(2, obs).ideal_with_non_zero_condition
+        if I.dimension() == 0:
+            print(giac_rur.rational_univariate_representation(I))
+
+
+def clean_complex(z, epsilon=1e-14):
+    r, i = abs(z.real), abs(z.imag)
+    if r < epsilon and i < epsilon:
+        return 0.0
+    elif r < epsilon:
+        ans = z.imag*1j
+    elif i < epsilon:
+        ans = z.real
+    else:
+        ans = z
+    assert abs(z - ans) < epsilon
+    return ans
+
+def shapes_of_SL2C_reps_for_filled(manifold, phc_solver=None):
+    """
+    Use CyPHC to find the shapes corresponding to SL2C representations
+    of the given closed manifold, as well as those which are
+    boundary-parabolic with respect to the Dehn-filling description.
+
+    sage: M = Manifold('m006(-5, 1)')
+    sage: shape_sets = shapes_of_SL2C_reps_for_filled(M)
+    sage: len(shape_sets)
+    24
+    sage: max(shapes['err'] for shapes in shape_sets) < 1e-13
+    True
+    """
+    if phc_solver is None:
+        import phc_wrapper
+        phc_solver = phc_wrapper.phc_direct
+    n = manifold.num_tetrahedra()
+    I, var_dict = ptolemy_ideal_for_filled(manifold,
+                        nonzero_cond=False, return_full_var_dict=True)
+    sols = phc_solver(I)
+    vars = I.ring().gens()
+    ans = []
+    for sol in sols:
+        indep_values = {v:sol[repr(v)] for v in vars}
+        sol_dict = {v:poly.subs(indep_values) for v, poly in var_dict.items()}
+        shape_dict = {'M':sol_dict['M'], 'L':sol_dict['L']}
+        for i in range(n):
+            i = repr(i)
+            top = sol_dict['b' + i]*sol_dict['e' + i]
+            bottom = sol_dict['c' + i]*sol_dict['d' + i]
+            shape_dict['z' + i] = clean_complex(top/bottom)
+
+        for attr in ['err', 'rco', 'res', 'mult']:
+            shape_dict[attr] = sol[attr]
+        ans.append(shape_dict)
+    return ans
+
+
+def doctest_globals():
+    import snappy
+    return {'Manifold': snappy.Manifold}
+
+
+if __name__ == '__main__':
+    from snappy.sage_helper import doctest_modules
+    import sys
+    current_module = sys.modules[__name__]
+    doctest_modules([current_module], extraglobs=doctest_globals())

snappy/dev/extended_ptolemy/giac_helper.py

@@ -0,0 +1,43 @@
+"""
+
+Giac [1] is included in Sage 6.8 (July 2015) and newer with Sage
+providing a pexpect interpreter interface.  Additionally, there is a
+Cython-based wrapper for Giac [2] with a Sage-specific incarnation [3]
+which is installable as an optional Sage spkg::
+
+  sage -i giacpy_sage
+
+This module is to make it easy to access a version of Giac from within
+Sage, preferring the Cython-based wrapper if available.
+
+[1] https://www-fourier.ujf-grenoble.fr/~parisse/giac.html
+[2] https://pypi.org/project/giacpy
+[3] https://gitlab.math.univ-paris-diderot.fr/han/giacpy-sage
+
+"""
+
+from snappy.sage_helper import _within_sage
+
+giac = None
+have_giac = False
+have_giacpy = False
+
+if _within_sage:
+    try:
+        from giacpy_sage import libgiac as giac
+        have_giac = have_giacpy = True
+    except ImportError:
+        # Older versions of giacpy_sage were called giacpy
+        try:
+            from giacpy import libgiac as giac
+            have_giac = have_giacpy = True
+        except ImportError:
+            try:
+                # Fallback to pexpect interface.
+                from sage.all import giac
+                have_giac = True
+                have_giacpy = False
+            except ImportError as e:
+                raise ImportError(e.args[0] +
+                                  'Probably your version of SageMath is too old '
+                                  'to ship with Giac.')

snappy/dev/extended_ptolemy/giac_rur.py

@@ -0,0 +1,129 @@
+"""
+Sage convenience wrapper for Giac's rational univariate representation
+functionality.
+"""
+
+from sage.all import QQ, PolynomialRing, NumberField
+from .giac_helper import giac
+
+# The main function of this file is:
+
+def rational_univariate_representation(ideal):
+    """
+    Suppose an ideal I in QQ[x_1,...,x_n] is 0 dimensional, and we
+    want to describe all the points of the finite set V(I) in CC^n.  A
+    rational univariate representation (RUR) of V(I), is a collection
+    of univariate polynomials h, g_0, g_1, ... , g_n in QQ[t] where
+    deg(h) = #V(I) and deg(g_i) < deg(h) such that the points of V(I)
+    correspond precisely to
+
+       (g_1(z)/g_0(z), (g_2(z)/g_0(z), ... (g_n(z)/g_0(z))
+
+    where z in CC is a root of h.
+
+    In this variant, we factor h into irreducibles return each part of
+    the RUR individually.
+
+    Example:
+
+    sage: R = PolynomialRing(QQ, ['x', 'y', 'z'])
+    sage: x, y, z = R.gens()
+    sage: I = R.ideal([x + y + z*z, x*y*z - 3, x*x + y*y + z*z - 2])
+    sage: ans = rational_univariate_representation(I)
+    sage: len(ans)
+    1
+    sage: K, rep, mult = ans[0]
+    sage: mult
+    1
+    sage: h = K.polynomial(); h
+    x^10 - 2*x^9 - 4*x^8 + 6*x^7 + 7*x^6 - 13*x^5 - 17/2*x^4 + 36*x^3 + 63/2*x^2 + 81/2
+    sage: rep[y]
+    a
+    sage: 1215 * rep[x]  # Here g0 = 1215
+    8*a^9 + 8*a^8 - 8*a^7 - 246*a^6 + 128*a^5 + 550*a^4 - 308*a^3 - 636*a^2 + 639*a + 1917
+    sage: I.subs(rep).is_zero()
+    True
+
+    Here is an example using a Ptolemy variety:
+
+    sage: M = Manifold('t00000')
+    sage: obs = M.ptolemy_generalized_obstruction_classes(2)[1]
+    sage: V = M.ptolemy_variety(2, obs)
+    sage: I = V.ideal_with_non_zero_condition
+    sage: ans = rational_univariate_representation(I)
+    sage: ans[0][0].polynomial()
+    x^8 - 4*x^7 - 2*x^6 + 14*x^5 + 14*x^4 - 7*x^3 - 13*x^2 - x + 5
+
+    For more, see:
+
+    https://en.wikipedia.org/wiki/System_of_polynomial_equations#Rational_univariate_representation
+
+    """
+    R = ideal.ring()
+
+    # A "feature" introduced in Sage-9.4 is that
+    # ideal.gens() vs R.gens()
+    # returns
+    # a <class 'sage.rings.polynomial.multi_polynomial_sequence.PolynomialSequence_generic’>
+    # vs a
+    # <class 'sage.rings.polynomial.multi_polynomial_libsingular.MPolynomial_libsingular’>
+    # so that giac(_) turns the variable x into x vs sageVARx.
+    #
+    # And giving "gbasis([x],[sageVARx],rur)" instead of "gbasis([x],[x],rur)" doesn't
+    # produce the desired result...
+    #
+    # Thus, we have the following work-around:
+    good_vars = R.ideal(R.gens()).gens()
+    J = giac(ideal.gens())
+    rur = J.gbasis(good_vars, 'rur')
+    # Yikes: giacpy_sage vs the giac interface give different types.
+    # So using repr.
+    if repr(rur[0]) != 'rur':
+        raise ValueError(('Could not find RUR, got %r instead. '
+                          'Is the variety 0-dimensional?') % rur[0])
+
+    # [x.sage() for rur[4:]] doesn't work with the giac interface (it tries
+    # to convert the slicing to a giac expression that giac does not understand)
+    #
+    # However, rur.sage()[0] gave some trouble, too.
+    #
+    # So we convert with .sage() after having checked we have rur, but before
+    # we inspect the other items.
+    rur = rur.sage()
+
+    # Defining polynomial of number field, as a symbolic expression.
+    p = rur[2]
+    assert len(p.variables()) == 1
+    v = p.variables()[0]
+
+    S = PolynomialRing(QQ, repr(v))
+    T = PolynomialRing(QQ, 'x')
+    p = T(S(p))
+    p = p/p.leading_coefficient()
+
+    ans = []
+    for q, e in p.factor():
+        K = NumberField(q, 'a')
+
+        def toK(f):
+            return K(T(S(f)))
+
+        denom = toK(rur[3])
+        rep = [toK(f)/denom for f in rur[4:]]
+        sub_dict = dict(zip(R.gens(), rep))
+        assert all(g.subs(sub_dict) == 0 for g in ideal.gens())
+        ans.append((K, sub_dict, e))
+
+    return ans
+
+
+def doctest_globals():
+    import snappy
+    return {'Manifold': snappy.Manifold}
+
+
+if __name__ == '__main__':
+    from snappy.sage_helper import doctest_modules
+    import sys
+    current_module = sys.modules[__name__]
+    doctest_modules([current_module], extraglobs=doctest_globals())

snappy/dev/extended_ptolemy/gluing.py

@@ -0,0 +1,46 @@
+import snappy
+from sage.all import ZZ, PolynomialRing
+
+def make_rect_eqn(R, A, B, c, vars_per_tet=1):
+    n = len(A)
+    R_vars = R.gens()
+    if vars_per_tet == 2:
+        Z, W = R_vars[:n], R_vars[n:]
+    else:
+        Z = R_vars
+    left, right = R(1), R(1)
+    for i, a in enumerate(A):
+        term = Z[i]**abs(a)
+        if a > 0:
+            left *= term
+        elif a < 0:
+            right *= term
+    for i, b in enumerate(B):
+        if vars_per_tet==1:
+            term = (1 - Z[i])**abs(b)
+        else:
+            term = W[i]**abs(b)
+        if b > 0:
+            left *= term
+        elif b < 0:
+            right *= term
+    return left - c*right
+
+def gluing_variety_ideal(manifold, vars_per_tet=1):
+    manifold = manifold.copy()
+    n = manifold.num_tetrahedra()
+    var_names = ['z%d' % i for i in range(n)]
+    ideal_gens = []
+    if vars_per_tet!=1:
+        assert vars_per_tet==2
+        var_names += ['w%d' % i for i in range(n)]
+    R = PolynomialRing(ZZ, var_names)
+    if vars_per_tet==2:
+        ideal_gens += [R('z%d + w%d - 1' % (i, i)) for i in range(n)]
+    eqn_data = snappy.snap.shapes.enough_gluing_equations(manifold)
+    ideal_gens += [make_rect_eqn(R, A, B, c, vars_per_tet) for A, B, c in eqn_data]
+    return R.ideal(ideal_gens)
+                       
+                       
+
+