Involution approach to investigating polynomial systems
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Involutive bases of polynomial ideals
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
Mathematics and Computers in Simulation - Special issue: Simplification of systems of algebraic and differential equations with applications
Method of Separative Monomials for Involutive Divisions
Programming and Computing Software
On an Algorithmic Optimization in Computation of Involutive Bases
Programming and Computing Software
Computation of Janet Bases for Toric Ideals
Programming and Computing Software
Involutive divisions: Slice and pair properties
Programming and Computing Software
On a method for finding the roots of an ideal
Programming and Computing Software
Programming and Computing Software
On constructivity of involutive divisions
Programming and Computing Software
Involutive divisions and monomial orderings
Programming and Computing Software
Involutive method for computing Gröbner bases over $$ \mathbb{F}_2 $$
Programming and Computing Software
Thomas decomposition of algebraic and differential systems
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Algorithmic Thomas decomposition of algebraic and differential systems
Journal of Symbolic Computation
| Hi-index | 0.00 |
An algorithm for fast search for the involutive monomial Janet divisor is suggested. Such search is an important part of the construction of monomial and polynomial Janet bases. For a data structure for a finite set of monomials, the binary tree is taken, which reflects properties of the Janet division.