flint-sys 0.9.0

Bindings to the FLINT C library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133

/*
    Copyright (C) 2021 Daniel Schultz

    This file is part of FLINT.

    FLINT is free software: you can redistribute it and/or modify it under
    the terms of the GNU Lesser General Public License (LGPL) as published
    by the Free Software Foundation; either version 3 of the License, or
    (at your option) any later version.  See <https://www.gnu.org/licenses/>.
*/

#include "mpoly.h"

/* this file does not need to change with new orderings */

/*
    Convert B to A using the variable permutation vector perm.
    A must be constructed with bits = Abits.

    operation on each term:

        for 0 <= l < n
            Aexp[l] = shift[l]

        for 0 <= k < m + 2
            l = perm[k]
            Aexp[l] += scale[l]*Bexp[k]
*/
void mpoly_from_mpolyl_perm_inflate(
    ulong * Bexps,
    flint_bitcnt_t Bbits,
    const mpoly_ctx_t Bctx,
    ulong * Aexps,
    flint_bitcnt_t Abits,
    const mpoly_ctx_t Actx,
    slong length,
    const slong * perm,
    const ulong * shift,
    const ulong * stride)
{
    slong i, k, l;
    slong n = Bctx->nvars;
    slong m = Actx->nvars;
    slong NB = mpoly_words_per_exp_sp(Bbits, Bctx);
    slong NA = mpoly_words_per_exp_sp(Abits, Actx);
    ulong * aexps, * bexps;
    TMP_INIT;

    FLINT_ASSERT(Actx->ord == ORD_LEX);
    FLINT_ASSERT(Bbits <= FLINT_BITS);
    FLINT_ASSERT(Abits <= FLINT_BITS);
    FLINT_ASSERT(m <= n);

    TMP_START;

    aexps = TMP_ARRAY_ALLOC(m + n, ulong);
    bexps = aexps + m;

    for (i = 0; i < length; i++)
    {
	    mpoly_get_monomial_ui(aexps, Aexps + NA*i, Abits, Actx);

        for (l = 0; l < n; l++)
        {
            bexps[l] = shift[l];
        }
        for (k = 0; k < m; k++)
        {
            l = perm[k];
            bexps[l] += stride[l]*aexps[k];
        }

        mpoly_set_monomial_ui(Bexps + NB*i, bexps, Bbits, Bctx);
    }

    TMP_END;
}



void mpoly_to_mpolyl_perm_deflate(
    ulong * Aexps,
    flint_bitcnt_t Abits,
    const mpoly_ctx_t Actx,
    ulong * Bexps,
    flint_bitcnt_t Bbits,
    const mpoly_ctx_t Bctx,
    slong length,
    const slong * perm,
    const ulong * shift,
    const ulong * stride)
{
    slong j, k, l;
    slong m = Actx->nvars;
    slong n = Bctx->nvars;
    slong NA = mpoly_words_per_exp_sp(Abits, Actx);
    slong NB = mpoly_words_per_exp_sp(Bbits, Bctx);
    ulong * aexps, * bexps;
    TMP_INIT;

    FLINT_ASSERT(Actx->ord == ORD_LEX);
    FLINT_ASSERT(Abits <= FLINT_BITS);
    FLINT_ASSERT(Bbits <= FLINT_BITS);
    FLINT_ASSERT(m <= n);

    TMP_START;

    aexps = TMP_ARRAY_ALLOC(m + n, ulong);
    bexps = aexps + m;

    for (j = 0; j < length; j++)
    {
        mpoly_get_monomial_ui(bexps, Bexps + NB*j, Bbits, Bctx);
        for (k = 0; k < m; k++)
        {
            l = perm[k];
            if (stride[l] == 1)
            {
                aexps[k] = (bexps[l] - shift[l]);
            }
            else
            {
                FLINT_ASSERT(stride[l] != 0);
                FLINT_ASSERT(((bexps[l] - shift[l]) % stride[l]) == 0);
                aexps[k] = (bexps[l] - shift[l]) / stride[l];
            }
        }

        mpoly_set_monomial_ui(Aexps + NA*j, aexps, Abits, Actx);
    }

    TMP_END;
}