Searcharxiv⌕ Search

arXiv subjects

Alfred Geroldinger

Publications and source records attributed to Alfred Geroldinger.

At least 37 records · Page 2Linked to original sources
arXiv2020

On the incomparability of systems of sets of lengths

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. We consider the system $\mathcal L (H)$ of all sets of lengths of $H$ and study when $\mathcal L (H)$ contains or is contained in a system $\mathcal L (H')$ of a Krull monoid $H'$ with finite class group $G'$, prime divisors in all classes and Davenport constant $\mathsf D (G')=\mathsf D (G)$. Among others, we show that if $G$ is either cyclic of order $m \ge 7$ or an elementary $2$-group of rank $m-1 \ge 6$, and $G'$ is any group which is non-isomorphic to $G$ but with Davenport constant $\mathsf D (G')=\mathsf D (G)$, then the systems $\mathcal L (H)$ and $\mathcal L (H')$ are incomparable.

math.AC↗
arXiv2020

On product-one sequences over dihedral groups

Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product equals the identity element of the group. The set of all product-one sequences over $G$ (with concatenation of sequences as the operation) is a finitely generated C-monoid. Product-one sequences over dihedral groups have a variety of extremal properties. This article provides a detailed investigation, with methods from arithmetic combinatorics, of the arithmetic of the monoid of product-one sequences over dihedral groups.

math.NT↗
arXiv2020

On strongly primary monoids, with a focus on Puiseux monoids

Primary and strongly primary monoids and domains play a central role in the ideal and factorization theory of commutative monoids and domains. It is well-known that primary monoids satisfying the ascending chain condition on divisorial ideals (e.g., numerical monoids) are strongly primary; and the multiplicative monoid of non-zero elements of a one-dimensional local domain is primary and it is strongly primary if the domain is Noetherian. In the present paper, we focus on the study of additive submonoids of the non-negative rationals, called Puiseux monoids. It is easy to see that Puiseux monoids are primary monoids, and we provide conditions ensuring that they are strongly primary. Then we study local and global tameness of strongly primary Puiseux monoids; most notably, we establish an algebraic characterization of when a Puiseux monoid is globally tame. Moreover, we obtain a result on the structure of sets of lengths of all locally tame strongly primary monoids.

math.AC↗
arXiv2020

On a zero-sum problem arising from factorization theory

We study a zero-sum problem dealing with minimal zero-sum sequences of maximal length over finite abelian groups. A positive answer to this problem yields a structural description of sets of lengths with maximal elasticity in transfer Krull monoids over finite abelian groups.

math.CO↗
arXiv2020

On strongly primary monoids and domains

A commutative integral domain is primary if and only if it is one-dimensional and local. A domain is strongly primary if and only if it is local and each nonzero principal ideal contains a power of the maximal ideal. Hence one-dimensional local Mori domains are strongly primary. We prove among other results, that if $R$ is a domain such that the conductor $(R:\widehat R)$ vanishes, then $Λ(R)$ is finite, that is, there exists a positive integer $k$ such that each non-zero non-unit of $R$ is a product of at most $k$ irreducible elements. Using this result we obtain that every strongly primary domain is locally tame, and that a domain $R$ is globally tame if and only if $Λ(R)=\infty$. In particular, we answer Problem 38 in {P.-J. Cahen, M.~Fontana, S.~Frisch, and S.~Glaz, Open problems in commutative ring theory, Commutative Algebra, Springer 2014} in the affirmative. Many of our results are formulated for monoids.

math.AC↗
arXiv2019

Factorization Theory in Commutative Monoids

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and the multiplicative monoids of domains (including Krull domains, rings of integer-valued polynomials, orders in algebraic number fields) and of their ideals. We offer examples for all these classes of monoids and discuss their main arithmetical finiteness properties. These describe the structure of their sets of lengths, of the unions of sets of lengths, and their catenary degrees. We also provide examples where these finiteness properties do not hold.

math.AC↗
arXiv2019

A characterization of class groups via sets of lengths

Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1 \cdot \ldots \cdot u\_k$, with irreducibles $u\_1, \ldots u\_k \in H$, then $k$ is called the length of the factorization and the set $\mathsf L (a)$ of all possible $k$ is called the set of lengths of $a$. It is well-known that the system $\mathcal L (H) = \{\mathsf L (a) \mid a \in H \}$ depends only on the class group $G$. In the present paper we study the inverse question asking whether or not the system $\mathcal L (H)$ is characteristic for the class group. Consider a further Krull monoid $H'$ with class group $G'$ such that every class contains a prime divisor and suppose that $\mathcal L (H) = \mathcal L (H')$. We show that, if one of the groups $G$ and $G'$ is finite and has rank at most two, then $G$ and $G'$ are isomorphic (apart from two well-known pairings).

math.AC↗
arXiv2018

A characterization of seminormal C-monoids

It is well-known that a C-monoid is completely integrally closed if and only if its reduced class semigroup is a group and if this holds, then the C-monoid is a Krull monoid and the reduced class semigroup coincides with the usual class group of Krull monoids. We prove that a C-monoid is seminormal if and only if its reduced class semigroup is a union of groups. Based on this characterization we establish a criterion (in terms of the class semigroup) when seminormal C-monoids are half-factorial.

math.AC↗
arXiv2018

Sets of Arithmetical Invariants in Transfer Krull Monoids

Transfer Krull monoids are a recent concept including all commutative Krull domains and also, for example, wide classes of non-commutative Dedekind domains. We show that transfer Krull monoids are fully elastic (i.e., every rational number between $1$ and the elasticity of the monoid can be realized as the elasticity of an element). In commutative Krull monoids which have sufficiently many prime divisors in all classes of their class group, the set of catenary degrees and the set of tame degrees are intervals. Without the assumption on the distribution of prime divisors, arbitrary finite sets can be realized as sets of catenary degrees and as sets of tame degrees.

math.AC↗
arXiv2017

The monotone catenary degree of monoids of ideals

Factoring ideals in integral domains is a central topic in multiplicative ideal theory. In the present paper we study monoids of ideals and consider factorizations of ideals into multiplicatively irreducible ideals. The focus is on the monoid of nonzero divisorial ideals and on the monoid of $v$-invertible divisorial ideals in weakly Krull Mori domains. Under suitable algebraic finiteness conditions we establish arithmetical finiteness results, in particular for the monotone catenary degree and for the structure of sets of lengths and of their unions.

math.AC↗
arXiv2017

Long sets of lengths with maximal elasticity

We introduce a new invariant describing the structure of sets of lengths in atomic monoids and domains. For an atomic monoid $H$, let $Δ_ρ (H)$ be the set of all positive integers $d$ which occur as differences of arbitrarily long arithmetical progressions contained in sets of lengths having maximal elasticity $ρ(H)$. We study $Δ_ρ (H)$ for transfer Krull monoids of finite type (including commutative Krull domains with finite class group) with methods from additive combinatorics, and also for a class of weakly Krull domains (including orders in algebraic number fields) for which we use ideal theoretic methods.

math.AC↗
arXiv2017

Systems of sets of lengths: Transfer Krull monoids versus weakly Krull monoids

Transfer Krull monoids are monoids which allow a weak transfer homomorphism to a commutative Krull monoid, and hence the system of sets of lengths of a transfer Krull monoid coincides with that of the associated commutative Krull monoid. We unveil a couple of new features of the system of sets of lengths of transfer Krull monoids over finite abelian groups G, and we provide a complete description of the system for all groups G having Davenport constant D(G) = 5 (these are the smallest groups for which no such descriptions were known so far). Under reasonable algebraic finiteness assumptions, sets of lengths of transfer Krull monoids and of weakly Krull monoids satisfy the Structure Theorem for Sets of Lengths. In spite of this common feature we demonstrate that systems of sets of lengths for a variety of classes of weakly Krull monoids are different from the system of sets of lengths of any transfer Krull monoid.

math.AC↗
arXiv2017

Sets of lengths in atomic unit-cancellative finitely presented monoids

For an element $a$ of a monoid $H$, its set of lengths $\mathsf L (a) \subset \mathbb N$ is the set of all positive integers $k$ for which there is a factorization $a=u_1 \cdot \ldots \cdot u_k$ into $k$ atoms. We study the system $\mathcal L (H) = \{\mathsf L (a) \mid a \in H \}$ with a focus on the unions $\mathcal U_k (H) \subset \mathbb N$ which are the unions of all sets of lengths containing a given $k \in \mathbb N$. The Structure Theorem for Unions -- stating that for all sufficiently large $k$, the sets $\mathcal U_k (H)$ are almost arithmetical progressions with the same difference and global bound -- has found much attention for commutative monoids and domains. We show that it holds true for the not necessarily commutative monoids in the title satisfying suitable algebraic finiteness conditions. Furthermore, we give an explicit description of the system of sets of lengths of monoids $B_{n} = \langle a,b \mid ba=b^{n} \rangle$ for $n \in \N_{\ge 2}$. Based on this description, we show that the monoids $B_n$ are not transfer Krull, which implies that their systems $\mathcal L (B_n)$ are distinct from systems of sets of lengths of commutative Krull monoids and others.

math.CO↗
arXiv2017

Arithmetic of commutative semigroups with a focus on semigroups of ideals and modules

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$ with the property that there are atoms $u_1, \ldots, u_k, v_1, \ldots, v_{\ell}$ such that $u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{\ell}$ (thus, $\mathscr U_k (H)$ is the union of all sets of lengths containing $k$). The Structure Theorem for Unions states that, for all sufficiently large $k$, the sets $\mathscr U_k (H)$ are almost arithmetical progressions with the same difference and global bound. We present a new approach to this result in the framework of arithmetic combinatorics, by deriving, for suitably defined families of subsets of the non-negative integers, a characterization of when the Structure Theorem holds. This abstract approach allows us to verify, for the first time, the Structure Theorem for a variety of possibly non-cancellative semigroups, including semigroups of (not necessarily invertible) ideals and semigroups of modules. Furthermore, we provide the very first example of a semigroup (actually, a locally tame Krull monoid) that does not satisfy the Structure Theorem.

math.AC↗