Multilinear Cayley factorization
The author develops an algorithm which solves the Cayley factorization of a homogeneous bracket polynomial \(P\) which is multilinear. The algorithm has seven steps. In step 1 we first find the atomic extensors for the bracket polynomial \(P(a,b,\ldots,z)\) of rank \(d\) which is multilinear in the \(N\) points \(a,b,\ldots,z\). In step 2 we rewrite \(P\) as a bracket polynomial which is dotted in each atomic extensor. In step 3 we apply straightening with the \(d\) elements of \(E\) first in the linear order, if there exists an atomic extensor \(E\) of step 1. The result must have \(E\) as the first row of every resulting tableau. In step 4 we find a primitive factor if any, for pairs of extensors \(E=\{e_ 1,e_ 2,\ldots,e_ k\}\), \(F=\{f_ 1,f_ 2,\ldots,f_ \ell\}\) such that \(k+\ell\geq d\). Step 5 checks if such \(E\) and \(F\) do not exist. Then no factorization is possible. In step 6 we recompute the atomic extensors by trying to extend the current ones. Finally in step 7 we go to step 2 and repeat. An example is worked out.
- Gröbner bases and invariant theory
- scientific article; zbMATH DE number 3167805 (Why is no real title available?)
- scientific article; zbMATH DE number 4010742 (Why is no real title available?)
- scientific article; zbMATH DE number 4057704 (Why is no real title available?)
- scientific article; zbMATH DE number 3445419 (Why is no real title available?)
- scientific article; zbMATH DE number 3237914 (Why is no real title available?)
- scientific article; zbMATH DE number 3088637 (Why is no real title available?)
- Invariant-theoretic methods in scene analysis and structural mechanics
- Multilinear Algebra
- On the application of Buchberger's algorithm to automated geometry theorem proving
- On the exterior calculus of invariant theory
- On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
- On the synthetic factorization of projectively invariant polynomials
- Polytopal and nonpolytopal spheres. An algorithmic approach
- Some examples of the use of distances as coordinates for euclidean geometry
- Symbolic method in invariant theory
- The Algebraic Geometry of Motions of Bar-and-Body Frameworks
- The Algebraic Geometry of Stresses in Frameworks
- The Bracket Ring of a Combinatorial Geometry. I
- The dotted straightening algorithm
- On the synthetic factorization of projectively invariant polynomials
- Invariant and geometric aspects of algebraic complexity theory. I
- Invariant computations for analytic projective geometry
- Computational algebraic geometry of projective configurations
- Graphical operations on projective spaces
- Arguesian identities in linear lattices
- On the Cayley factorization of calotte conditions
- Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. I: Incidence geometry.
- Automated short proof generation for projective geometric theorems with Cayley and bracket algebras. II: Conic geometry.
- Geometric identities in lattice theory
- Algorithms for detecting dependencies and rigid subsystems for CAD
- Multidimensional butterfly factorization
- Grassmann-Cayley algebra and robotics
- Straightening Euclidean invariants
- Mechanical theorem proving in projective geometry
- Arguesian identities in the congruence variety of Abelian groups
- Definable relations in finite dimensional subspace lattices with involution. II. Quantifier-free and homogeneous descriptions
- A Pascal's theorem for rational normal curves
- Cayley factorization and the area principle
- The dotted straightening algorithm
- Cayley factorization and a straightening algorithm
This page was built for publication: Multilinear Cayley factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176387)
