From Polynomial Invariants to Linear Loops

DOI10.1145/3597066.3597109arXiv2302.06323OpenAlexW4383213547WikidataQ131122464 ScholiaQ131122464MaRDI QIDQ6081960

George Kenison, Anton Varonka, Laura Kovács

Publication date: 3 November 2023

Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.06323

zbMATH Keywords

toric idealsprogram synthesisloop invariantsC-finite sequences

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive margins and primary decomposition
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• Binomial ideals
• Polynomial invariants by linear algebra
• When is a polynomial ideal binomial after an ambient automorphism?
• Efficiently and effectively recognizing toricity of steady state varieties
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Solving Non-linear Arithmetic
• Invariant Generation for Multi-Path Loops with Polynomial Assignments
• Generalized Reduction to Compute Toric Ideals
• Binomial Ideals
• Automatic Generation of Polynomial Loop Invariants
• Toric varieties from cyclic matrix semigroups
• Polynomial Invariants for Affine Programs
• On the Number of Solutions of Diophantine Equations
• Ideals, Varieties, and Algorithms
• Rational Points on Elliptic Curves
• Reasoning Algebraically About P-Solvable Loops
• Algebra-Based Reasoning for Loop Synthesis

This page was built for publication: From Polynomial Invariants to Linear Loops