Arithmetical structures on dominated polynomials
Carlos E. Valencia, Ralihe R. Villagr\'an

TL;DR
This paper introduces an algorithm for computing arithmetical structures on dominated polynomials, extending previous matrix-based methods to a new class of multivariate polynomials.
Contribution
It adapts existing matrix algorithms to handle dominated polynomials, providing a novel computational approach for this polynomial class.
Findings
Developed an algorithm for dominated polynomial arithmetical structures
Extended matrix-based methods to multivariate polynomials
Demonstrated the algorithm's effectiveness on examples
Abstract
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated polynomial is an integer multivariate polynomial such that contains a monomial which is divided by all its monomials.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Algebra and Logic · Commutative Algebra and Its Applications
