SearcharxivSearch

arXiv · 2408.01518

From Ideal Membership Problem for polynomial rings to Dehn Functions of Metabelian Groups

Abstract

The ideal membership problem asks whether an element in the ring belongs to the given ideal. In this paper, we propose a function that reflecting the complexity of the ideal membership problem in the ring of Laurent polynomials with integer coefficients. We also connect the complexity function we define to the Dehn function of a metabelian group, in the hope of constructing a metabelian group with superexponential Dehn function.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenhao Wang. 2024-08-02. From Ideal Membership Problem for polynomial rings to Dehn Functions of Metabelian Groups. https://arxiv.org/abs/2408.01518

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR