Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 41 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 474 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

A characterization of finite abelian groups via sets of lengths in transfer Krull monoids (1711.05437v2)

Published 15 Nov 2017 in math.NT, math.AC, and math.CO

Abstract: Let $H$ be a transfer Krull monoid over a finite ablian group $G$ (for example, rings of integers, holomorphy rings in algebraic function fields, and regular congruence monoids in these domains). Then each nonunit $a \in H$ can be written as a product of irreducible elements, say $a = u_1 \ldots u_k$, and the number of factors $k$ is called the length of the factorization. The set $\mathsf L (a)$ of all possible factorization lengths is the set of lengths of $a$. It is classical that the system $\mathcal L (H) = { \mathsf L (a) \mid a \in H }$ of all sets of lengths depends only on the group $G$, and a standing conjecture states that conversely the system $\mathcal L (H)$ is characteristic for the group $G$. Let $H'$ be a further transfer Krull monoid over a finite ablian group $G'$ and suppose that $\mathcal L (H)= \mathcal L (H')$. We prove that, if $G\cong C_nr$ with $r\le n-3$ or ($r\ge n-1\ge 2$ and $n$ is a prime power), then $G$ and $G'$ are isomorphic.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)