Macaulay2 Engine
Loading...
Searching...
No Matches

◆ hilb_comp() [1/2]

hilb_comp::hilb_comp ( const PolynomialRing * R,
const Matrix * M )

Definition at line 343 of file hilb.cpp.

344 : S(m->get_ring()->cast_to_PolynomialRing()),
345 R(RR),
346 M(S->getMonoid()),
347 D(S->degree_monoid()),
348 mi_stash(new stash("hilb mi", sizeof(Nmi_node))),
349 input_mat(m),
350 this_comp(0),
351 n_components(m->n_rows()),
352 current(nullptr),
353 part_table(std::max(1, S->n_vars()), mi_stash)
354{
355 assert(D == R->getMonoid());
356 one = R->getCoefficientRing()->from_long(1);
357 minus_one = R->getCoefficientRing()->from_long(-1);
358 LOCAL_deg1 = D->make_one();
359
360 result_poincare = R->from_long(0);
361 nsteps = 0;
362 maxdepth = 0;
363 nideal = 0;
364 nrecurse = 0;
365
366 // Collect the 'this_comp' monideal of the input matrix
367 // Set up the computation for that
369}
int nideal
Definition hilb.hpp:116
const Monoid * D
Definition hilb.hpp:97
ring_elem result_poincare
Definition hilb.hpp:103
ring_elem minus_one
Definition hilb.hpp:121
const Matrix * input_mat
Definition hilb.hpp:102
int nrecurse
Definition hilb.hpp:117
const PolynomialRing * R
Definition hilb.hpp:95
void next_monideal()
Definition hilb.cpp:314
const PolynomialRing * S
Definition hilb.hpp:94
monomial LOCAL_deg1
Definition hilb.hpp:125
hilb_step * current
Definition hilb.hpp:110
int nsteps
Definition hilb.hpp:113
partition_table part_table
Definition hilb.hpp:127
int n_components
Definition hilb.hpp:106
int this_comp
Definition hilb.hpp:105
int maxdepth
Definition hilb.hpp:115
const Monoid * M
Definition hilb.hpp:96
ring_elem one
Definition hilb.hpp:120
stash * mi_stash
Definition hilb.hpp:99

References current, D, input_mat, LOCAL_deg1, M, Matrix, max, maxdepth, mi_stash, minus_one, n_components, next_monideal(), nideal, nrecurse, nsteps, one, part_table, R, result_poincare, S, and this_comp.

Referenced by hilbertNumerator(), and hilbertNumerator().