Short proofs of ideal membership
type: Item
instance of: scholarly article
title: Short proofs of ideal membership
zbMATH Open document ID: 1540.6833
author: Clemens Hofstadler
author: Thibaut Verron
published in: Journal of Symbolic Computation
publication date: 2024-05-24T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7852638
zbMATH Keywords: noncommutative polynomials
zbMATH Keywords: signature Gröbner basis
zbMATH Keywords: automated proofs
zbMATH Keywords: proof simplification
zbMATH Keywords: linear programming
MaRDI profile type: MaRDI publication profile
cites work: How to Automatise Proofs of Operator Statements: Moore–Penrose Inverse; A Case Study
cites work: The Ideal Membership Problem and Abelian Groups
cites work: On the complexity of CSP-based ideal membership problems
cites work: Decoding by Linear Programming
cites work: Atomic decomposition by basis pursuit
cites work: Compatible rewriting of noncommutative polynomials for proving operator identities
cites work: Entropy-based algorithms for best basis selection
cites work: Algebraic proof methods for identities of matrices and operators: improvements of Hartwig's triple reverse order law
cites work: Heights of varieties in multiprojective spaces and arithmetic nullstellensätze
cites work: Q5808752
cites work: A generalization of the Sherman-Morrison-Woodbury formula
cites work: Reverse order law for the Moore-Penrose inverse
cites work: Compressed sensing
cites work: A survey on signature-based algorithms for computing Gröbner bases
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane
cites work: On the complexity of the generalized MinRank problem
cites work: Sparse Gröbner bases
cites work: On the complexity of computing Gröbner bases for weighted homogeneous systems
cites work: Q4198056
cites work: Q4317807
cites work: Signature Gröbner bases in free algebras over rings
cites work: Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra
cites work: Certifying operator identities via noncommutative Gröbner bases
cites work: Handbook of linear algebra
cites work: On the effective Nullstellensatz
cites work: Proof simplification and automated theorem proving
cites work: Moore-Penrose inverse in rings with involution
cites work: Sharp Effective Nullstellensatz
cites work: Axioms for a theory of signature bases
cites work: Letterplace
cites work: The Moore-Penrose inverses of products and differences of projections in a \(C^*\)-algebra
cites work: Matching pursuits with time-frequency dictionaries
cites work: The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
cites work: Membership in polynomial ideals over Q is exponential space complete
cites work: The complexity of the word problems for commutative semigroups and polynomial ideals
cites work: Complexity of Membership Problems of Different Types of Polynomial Ideals
cites work: Interior-point methods
cites work: Formal proofs of operator identities by a single formal computation
cites work: Generalized inverses of morphisms with kernels
cites work: Formally verifying proofs for algebraic identities of matrices
cites work: Q4221106
cites work: Solving Polynomial Equation Systems
cites work: Finding shortest proofs: An application of linked inference rules
DOI: 10.1016/J.JSC.2024.102325
description: scientific article; zbMATH DE number 7852638