Algorithms for computing bases for 3-variable homogeneous integer-valued polynomials (Q2186049)

For a positive integer \(n\), we recall that \[ \mathrm{Int}(\mathbb{Z}^n,\mathbb{Z})= \big\{f(x_1,\ldots,x_n)\in\mathbb{Q}[x_1,\ldots,x_n]; f(\mathbb{Z}^n)\subseteq \mathbb{Z}\big\}. \] This is an integral domain, called the ring of integer-valued polynomials (IVPs) of \(n\) variables. It is also a free \(\mathbb{Z}\)-module and a standard basis is known since long time ago. Let \(m\) be an other positive integer. Denote \(\mathrm{Int}^m(\mathbb{Z}^n,\mathbb{Z})\) the submodule of \(\mathrm{Int}(\mathbb{Z}^n,\mathbb{Z})\) consisting of homogeneous IVPs of degree \(m\). These two modules are studied for their topological applications. The purpose of this paper is to compute bases for the \(3-\)variables homogeneous IVPs. The author used two different methods based on tools from linear algebra: Smith normal form and Hermite normal form of a matrix.