Janet’s approach to presentations and resolutions for polynomials and linear pdes

By Wilhelm Plesken, Daniel Robertz. 2005

53 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Mechanics, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/91d044b6a5aa3d7dc71396d3ea2ca1df76e9d820

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

1. Xinxian Zheng
2. Marius Vladoiu
3. Jürgen Herzog
4. Adam Van Tuyl
5. Huy Tài Hà
6. Rafael H. Villarreal
7. Asia Rauf
8. Susan Morey

In Computational Mechanics

1. Jürgen Herzog
2. Xinxian Zheng
3. Marius Vladoiu

In Computational Theory and Mathematics

1. Marius Vladoiu
2. Xinxian Zheng
3. Jürgen Herzog
4. Adam Van Tuyl
5. Huy Tài Hà
6. Rafael H. Villarreal
7. Susan Morey
8. Sara Faridi

Citations in the corpus

• How to compute the Stanley depth of a monomial ideal (2007, methodology): “We now give a lower bound for the sdepth of a monomial ideal by u sing a strategy which is modeled after the Janet algorithm (see [16] and [17]) and w hich allows to use induction on the number of variables.”