Search arXivSearch

arXiv · 1604.08337

Decomposition of integer-valued polynomial algebras

Abstract

Let $D$ be a commutative domain with field of fractions $K$, let $A$ be a torsion-free $D$-algebra, and let $B$ be the extension of $A$ to a $K$-algebra. The set of integer-valued polynomials on $A$ is ${\rm Int}(A) = \{f \in B[X] \mid f(A) \subseteq A\}$, and the intersection of ${\rm Int}(A)$ with $K[X]$ is ${\rm Int}_K(A)$, which is a commutative subring of $K[X]$. The set ${\rm Int}(A)$ may or may not be a ring, but it always has the structure of a left ${\rm Int}_K(A)$-module. A $D$-algebra $A$ which is free as a $D$-module and of finite rank is called ${\rm Int}_K$-decomposable if a $D$-module basis for $A$ is also an ${\rm Int}_K(A)$-module basis for ${\rm Int}(A)$; in other words, if ${\rm Int}(A)$ can be generated by ${\rm Int}_K(A)$ and $A$. A classification of such algebras has been given when $D$ is a Dedekind domain with finite residue rings. In the present article, we modify the definition of ${\rm Int}_K$-decomposable so that it can be applied to $D$-algebras that are not necessarily free by defining $A$ to be ${\rm Int}_K$-decomposable when ${\rm Int}(A) \cong {\rm Int}_K(A) \otimes_D A$. We then provide multiple characterizations of such algebras in the case where $D$ is a discrete valuation ring or a Dedekind domain with finite residue rings. In particular, if $D$ is the ring of integers of a number field $K$, we show that ${\rm Int}_K$-decomposable algebras $A$ correspond to maximal $D$-orders in a separable $K$-algebra $B$, whose simple components have as center the same finite unramified Galois extension $F$ of $K$ and are unramified at each finite place of $F$. Finally, when both $D$ and $A$ are rings of integers in number fields, we show that ${\rm Int}_K$-decomposable algebras correspond to unramified Galois extensions of $K$.

Explore related subjects

Keep this discovery

BibTeXRIS

Giulio Peruginelli, Nicholas J. Werner. 2016-04-28. Decomposition of integer-valued polynomial algebras. https://doi.org/10.1016/j.jpaa.2017.10.007

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