
TL;DR
This paper investigates the algebraic structure of $n$-dimensional sequences over a commutative ring, providing explicit formulas for their generating functions and characteristic polynomial ideals, and introduces algorithms for computing these ideals.
Contribution
It offers explicit partitioned sum expressions for the generating functions and characteristic ideals of $n$-dimensional sequences, and develops algorithms for their computation over factorial domains.
Findings
Explicit $2^n$-fold sum formulas for generating functions.
Characterization of the ideal Ann$(s)$ for eventually rectilinear sequences.
Polynomial-time algorithms for computing characteristic ideals over fields.
Abstract
Let be a commutative ring and let We study , the generating function and Ann, the ideal of characteristic polynomials of , an --dimensional sequence over . We express as a partitioned sum. That is, we give (i) a --fold ``border'' partition (ii) an explicit expression for the product as a --fold sum; the support of each summand is contained in precisely one member of the partition. A key summand is , the ``border polynomial'' of and , which is divisible by . We say that is {\em eventually rectilinear} if the elimination ideals Ann contain an for . In this case, we show that is the ideal quotient When and…
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
TopicsDigital Image Processing Techniques · Computational Geometry and Mesh Generation
