SearcharxivSearch

arXiv · 1411.1382

The ring of polynomials integral-valued over a finite set of integral elements

Abstract

Let $D$ be an integral domain with quotient field $K$ and $\Omega$ a finite subset of $D$. McQuillan proved that the ring ${\rm Int}(\Omega,D)$ of polynomials in $K[X]$ which are integer-valued over $\Omega$, that is, $f\in K[X]$ such that $f(\Omega)\subset D$, is a Pr\"ufer domain if and only if $D$ is Pr\"ufer. Under the further assumption that $D$ is integrally closed, we generalize his result by considering a finite set $S$ of a $D$-algebra $A$ which is finitely generated and torsion-free as a $D$-module, and the ring ${\rm Int}_K(S,A)$ of integer-valued polynomials over $S$, that is, polynomials over $K$ whose image over $S$ is contained in $A$. We show that the integral closure of ${\rm Int}_K(S,A)$ is equal to the contraction to $K[X]$ of ${\rm Int}(\Omega_S,D_F)$, for some finite subset $\Omega_S$ of integral elements over $D$ contained in an algebraic closure $\bar K$ of $K$, where $D_F$ is the integral closure of $D$ in $F=K(\Omega_S)$. Moreover, the integral closure of ${\rm Int}_K(S,A)$ is Pr\"ufer if and only if $D$ is Pr\"ufer. The result is obtained by means of the study of pullbacks of the form $D[X]+p(X)K[X]$, where $p(X)$ is a monic non-constant polynomial over $D$: we prove that the integral closure of such a pullback is equal to the ring of polynomials over $K$ which are integral-valued over the set of roots $\Omega_p$ of $p(X)$ in $\bar K$.

Explore related subjects

Keep this discovery

BibTeXRIS

G. Peruginelli. 2014-11-05. The ring of polynomials integral-valued over a finite set of integral elements. https://doi.org/10.1216/jca-2016-8-1-113

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA