Almost monomial subalgebras of $$\mathbb {K}[x]$$ and their LAGBI bases

We investigate subalgebras of finite codimension in $$\mathbb {K}[x]$$ . In earlier work we have introduced a way of describing such subalgebras in terms of their so called (subalgebra) spectrum and a set of conditions for subalgebra membership that can be expressed by evaluating polynomials and their derivatives in points of the spectrum only. In this paper we focus on subalgebras with a single element in their spectrum. This includes, among others, all monomial subalgebras. Moreover, any subalgebra given by only conditions involving derivatives can be obtained as a finite intersection of algebras with single spectrum. Our main result is an efficient algorithm for finding the set of defining conditions given a set of generators for a single spectrum subalgebra. As an important step on the way to an algorithm we introduce a new canonical basis (with many similarities to SAGBI basis), that we name LAGBI basis, for our single spectrum algebras. We then find an efficient algorithm for computing a LAGBI basis and finally incorporate it into our main algorithm for finding defining conditions. In the process we also find the derivations of a single spectrum subalgebra.

Authors

Institutions

Publication Details

Journal
Applicable Algebra in Engineering Communication and Computing
Published
2026-01-07
DOI
https://doi.org/10.1007/s00200-025-00712-7
Citations
1
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
45.17

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Almost monomial subalgebras of $$\mathbb {K}[x]$$ and their LAGBI bases

Anna Torstensson, Victor Ufnarovski, Erik Kennerland
1 citations
Applicable Algebra in Engineering Communication and Computing
Polynomial and algebraic computation
45.17
article

Almost monomial subalgebras of $$\mathbb {K}[x]$$ and their LAGBI bases

Anna Torstensson, Victor Ufnarovski, Erik Kennerland
article en
1 citations

Abstract

We investigate subalgebras of finite codimension in $$\mathbb {K}[x]$$ . In earlier work we have introduced a way of describing such subalgebras in terms of their so called (subalgebra) spectrum and a set of conditions for subalgebra membership that can be expressed by evaluating polynomials and their derivatives in points of the spectrum only. In this paper we focus on subalgebras with a single element in their spectrum. This includes, among others, all monomial subalgebras. Moreover, any subalgebra given by only conditions involving derivatives can be obtained as a finite intersection of algebras with single spectrum. Our main result is an efficient algorithm for finding the set of defining conditions given a set of generators for a single spectrum subalgebra. As an important step on the way to an algorithm we introduce a new canonical basis (with many similarities to SAGBI basis), that we name LAGBI basis, for our single spectrum algebras. We then find an efficient algorithm for computing a LAGBI basis and finally incorporate it into our main algorithm for finding defining conditions. In the process we also find the derivations of a single spectrum subalgebra.

Applicable Algebra in Engineering Communication and Computing
Lund University (SE)
Lunds Universitet
Openalex Percentile: Top 1%
Polynomial and algebraic computation
45.17
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.