scientific article; zbMATH DE number 5052246
From MaRDI portal
Publication:5486584
zbMATH Open1104.13012arXivmath/0501111MaRDI QIDQ5486584FDOQ5486584
Authors: Vladimir Gerdt 
Publication date: 11 September 2006
Full work available at URL: https://arxiv.org/abs/math/0501111
Title of this publication is not available (Why is that?)
Recommendations
- A Gröbner approach to involutive bases
- Computation of Gröbner bases
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- scientific article; zbMATH DE number 1487697
- Gröbner bases and involutive methods for algebraic and differential equations
- Computing Gröbner bases and invariants of the symmetric algebra
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- scientific article; zbMATH DE number 1241621
- An efficient method for computing comprehensive Gröbner bases
- Computation of involutive and Gröbner bases using the tableau representation of polynomials
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (51)
- Using dynamic memory reallocation in GInv
- Computing the resolution regularity of bi-homogeneous ideals
- On FGLM algorithms with tropical Gröbner bases
- Title not available (Why is that?)
- Thomas decomposition of algebraic and differential systems
- An application of the Gröbner basis in computation for the minimal polynomials and inverses of block circulant matrices
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- On selection of nonmultiplicative prolongations in computation of Janet bases
- \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
- Title not available (Why is that?)
- Recent progress in an algebraic analysis approach to linear systems
- Numerical elimination and moduli space of vacua
- Efficiency estimate for distributed computation of Gröbner bases and involutive bases
- A strongly-consistent difference scheme for 3D nonlinear Navier-Stokes equations
- Computation of involutive and Gröbner bases using the tableau representation of polynomials
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- Algorithmic Thomas decomposition of algebraic and differential systems
- Algebraic construction of a strongly consistent, permutationally symmetric and conservative difference scheme for 3D steady Stokes flow
- A Gröbner approach to involutive bases
- Computing coupled border bases
- Nœther bases and their applications
- Exploring the potential energy landscape over a large parameter-space
- Modular algorithms for computing Gröbner bases.
- Role of involutive criteria in computing Boolean Gröbner bases
- Noether normalization guided by monomial cone decompositions
- On decomposition of algebraic PDE systems into simple subsystems
- Degree upper bounds for involutive bases
- Relative Gröbner and involutive bases for ideals in quotient rings
- New order bounds in differential elimination algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Term-ordering free involutive bases
- Discretization of quasilinear evolution equations by computer algebra methods
- Recursive structures in involutive bases theory
- From Analytical Mechanics Problems to Rewriting Theory Through M. Janet’s Work
- Complete involutive rewriting systems
- Computing minimal associated primes in polynomial rings over the integers
- Effectiveness of involutive criteria in computation of polynomial Janet bases
- Involutive division techniques: some generalizations and optimizations
- Title not available (Why is that?)
- BIBasis, a package for REDUCE and Macaulay2 computer algebra systems to compute Boolean involutive and Gröbner bases
- Complementary decompositions of monomial ideals and involutive bases
- On computation of Boolean involutive bases
- Involutive bases algorithm incorporating F\(_5\) criterion
- A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
- On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases
- A general framework for Noetherian well ordered polynomial reductions
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- Algebraically simple involutive differential systems and the Cauchy problem
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5486584)
