The following pages link to Computation of Hilbert functions (Q1199706):
Displayed 24 items.
- Two remarks on independent sets (Q686973) (← links)
- Reverse search for monomial ideals (Q840715) (← links)
- Methods for computing in algebraic geometry and commutative algebra (Q921066) (← links)
- Computing the support of monomial iterated mapping cones (Q992802) (← links)
- The slice algorithm for irreducible decomposition of monomial ideals (Q1008570) (← links)
- On the complexity of counting components of algebraic varieties (Q1030247) (← links)
- Direct methods for primary decomposition (Q1209132) (← links)
- Quasi complete intersections, powers of ideals and deficiency modules (Q1270980) (← links)
- Finding sparse systems of parameters (Q1328769) (← links)
- On the computation of versal deformations (Q1356270) (← links)
- Associated primes and arithmetic degrees (Q1359020) (← links)
- Computation of Hilbert-Poincaré series (Q1361198) (← links)
- On the Jacobian ideal of a trilinear form (Q1375366) (← links)
- A formal theory of matrix primeness (Q1388099) (← links)
- Gröbner bases, invariant theory and equivariant dynamics (Q1808673) (← links)
- Invariants of \(S_ 4\) and the shape of sets of vectors (Q1908903) (← links)
- The dimension method in elementary and differential geometry (Q1924742) (← links)
- A family of metrics for biopolymers based on counting independent sets (Q2490489) (← links)
- On arithmetic Macaulayfication of Noetherian rings (Q2750947) (← links)
- Efficient Algorithms for Computing Nœther Normalization (Q3597984) (← links)
- Gluing and Hilbert functions of monomial curves (Q3631825) (← links)
- (Q4668858) (← links)
- An algorithm for the hilbert-samuel function of a primary ideal (Q4834881) (← links)
- On Macaulayfication of Noetherian schemes (Q4955696) (← links)