The following pages link to Generating differential invariants (Q886192):
Displaying 50 items.
- Affine differential invariants of functions on the plane (Q364560) (← links)
- Poisson structures for geometric curve flows in semi-simple homogeneous spaces (Q618232) (← links)
- On structure-preserving point transformations of differential equations (Q653517) (← links)
- Differential invariant algebras of Lie pseudo-groups (Q734830) (← links)
- Differential invariants and operators of invariant differentiation of the projectable action of Lie groups (Q895044) (← links)
- Differential invariants of a Lie group action: syzygies on a generating set (Q1008571) (← links)
- Differential invariants of surfaces (Q1012338) (← links)
- Recursive moving frames (Q1758368) (← links)
- Schwarps: locally projective image warps based on 2D Schwarzian derivatives (Q1991493) (← links)
- Invariants of surfaces in three-dimensional affine geometry (Q2023412) (← links)
- Convergent normal form for five dimensional totally nondegenerate CR manifolds in \(\mathbb{C}^4\) (Q2050608) (← links)
- Lagrangian curves in a 4-dimensional affine symplectic space (Q2255618) (← links)
- Exact solutions via equivalence transformations of variable-coefficient fifth-order KdV equations (Q2279244) (← links)
- Invariant parameterization and turbulence modeling on the beta-plane (Q2448776) (← links)
- On the reduction of nonlinear mechanical systems via moving frames: a bead on a rotating wire hoop and a spinning top (Q2661117) (← links)
- Involutive moving frames. II: The Lie-Tresse theorem (Q2665763) (← links)
- (Q2735198) (← links)
- Symmetry transformations of an ideal steady fluid flow determined by a potential function (Q2832734) (← links)
- Symmetry preserving parameterization schemes (Q2865530) (← links)
- A new incremental algorithm for computing Groebner bases (Q2946515) (← links)
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals (Q2946516) (← links)
- A new algorithm for computing comprehensive Gröbner systems (Q2946517) (← links)
- Finding all bessel type solutions for linear differential equations with rational function coefficients (Q2946518) (← links)
- Simultaneously row- and column-reduced higher-order linear differential systems (Q2946519) (← links)
- Consistency of finite difference approximations for linear PDE systems and its algorithmic verification (Q2946520) (← links)
- Computation with semialgebraic sets represented by cylindrical algebraic formulas (Q2946521) (← links)
- Black-box/white-box simplification and applications to quantifier elimination (Q2946522) (← links)
- Parametric quantified SAT solving (Q2946524) (← links)
- A method for semi-rectifying algebraic and differential systems using scaling type lie point symmetries with linear algebra (Q2946525) (← links)
- Absolute factoring of non-holonomic ideals in the plane (Q2946526) (← links)
- Algorithms for Bernstein--Sato polynomials and multiplier ideals (Q2946527) (← links)
- Global optimization of polynomials using generalized critical values and sums of squares (Q2946528) (← links)
- A Slice algorithm for corners and Hilbert-Poincaré series of monomial ideals (Q2946529) (← links)
- Composition collisions and projective polynomials (Q2946530) (← links)
- Decomposition of generic multivariate polynomials (Q2946531) (← links)
- NumGfun (Q2946532) (← links)
- Chebyshev interpolation polynomial-based tools for rigorous computing (Q2946533) (← links)
- Blind image deconvolution via fast approximate GCD (Q2946534) (← links)
- Polynomial integration on regions defined by a triangle and a conic (Q2946535) (← links)
- Computing the singularities of rational space curves (Q2946536) (← links)
- Solving schubert problems with Littlewood-Richardson homotopies (Q2946537) (← links)
- When can we detect that a P-finite sequence is positive? (Q2946538) (← links)
- Complexity of creative telescoping for bivariate rational functions (Q2946539) (← links)
- Partial denominator bounds for partial linear difference equations (Q2946540) (← links)
- Real and complex polynomial root-finding with eigen-solving and preprocessing (Q2946541) (← links)
- Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method (Q2946543) (← links)
- Random polynomials and expected complexity of bisection methods for real solving (Q2946544) (← links)
- The DMM bound (Q2946545) (← links)
- Solving Bezout-like polynomial equations for the design of interpolatory subdivision schemes (Q2946546) (← links)
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology (Q2946547) (← links)
