中文
相关论文

相关论文: A realization theorem for sets of lengths in numer…

200 篇论文

Let $H$ be an atomic monoid. The set of distances $\Delta (H)$ of $H$ is the set of all $d \in \mathbb{N}$ with the following property: there are irreducible elements $u\_1, \ldots, u\_k, v\_1 \ldots, v\_{k+d}$ such that $u\_1 \cdot \ldots…

交换代数 · 数学 2017-01-19 Alfred Geroldinger , Wolfgang Schmid

We explicitly determine those sets of nonnegative integers which occur as sets of lengths in all numerical monoids.

交换代数 · 数学 2018-07-04 Alfred Geroldinger , Wolfgang Schmid

We construct monoid algebras which satisfy the ascending chain condition on principal ideals and which have the property that every nonempty subset of $\mathbb{N}_{\ge 2}$ occurs as a length set.

交换代数 · 数学 2024-04-18 Alfred Geroldinger , Felix Gotti

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…

组合数学 · 数学 2017-06-13 Alfred Geroldinger , Emil Daniel Schwab

Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. Then every element $a \in H$ has a factorization into irreducible elements, and the set $\mathsf L (a)$ of all possible factorization…

交换代数 · 数学 2015-05-25 Alfred Geroldinger , Wolfgang Schmid

For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…

交换代数 · 数学 2023-11-13 Gilad Moskowitz , Christopher O'Neill

Oftentimes the elements of a ring or semigroup $H$ can be written as finite products of irreducible elements, say $a=u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{\ell}$, where the number of irreducible factors is distinct. The set…

群论 · 数学 2016-08-11 Alfred Geroldinger

Let $\mathcal O$ be a holomorphy ring in a global field $K$, and $R$ a classical maximal $\mathcal O$-order in a central simple algebra over $K$. We study sets of lengths of factorizations of cancellative elements of $R$ into atoms…

环与代数 · 数学 2013-08-15 Daniel Smertnig

Let $H$ be a monoid (written multiplicatively). We call $H$ Archimedean if, for all $a, b \in H$ such that $b$ is a non-unit, there is an integer $k \ge 1$ with $b^k \in HaH$; strongly Archimedean if, for each $a \in H$, there is an integer…

环与代数 · 数学 2025-04-04 Pedro A. Garcia-Sanchez , Salvatore Tringali

A numerical set $T$ is a subset of $\mathbb N_0$ that contains $0$ and has finite complement. The atom monoid of $T$ is the set of $x \in \mathbb N_0$ such that $x+T \subseteq T$. Marzuola and Miller introduced the anti-atom problem: how…

组合数学 · 数学 2023-06-19 April Chen , Nathan Kaplan , Liam Lawson , Christopher O'Neill , Deepesh Singhal

Let $\mathcal S \subseteq \mathbb Z^m \oplus T$ be a finitely generated and reduced monoid. In this paper we develop a general strategy to study the set of elements in $\mathcal S$ having at least two factorizations of the same length,…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

组合数学 · 数学 2017-04-13 Kitty Meeks , Andrew Treglown

If $H$ is a monoid and $a=u_1 \cdots u_k \in H$ with atoms (irreducible elements) $u_1, \ldots, u_k$, then $k$ is a length of $a$, the set of lengths of $a$ is denoted by $\mathsf L(a)$, and $\mathcal L(H)=\{\,\mathsf L (a) \mid a \in H…

环与代数 · 数学 2019-04-10 Daniel Smertnig

The set $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ of all finite subsets of $\mathbb{N}_0$ containing the zero element is a monoid with set addition as operation. If a set $A\in\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ can be written in the…

交换代数 · 数学 2025-08-15 Andreas Reinhart

For $\ell\geq 2$ and $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ of degree $k\geq 2$, we show that every set $A\subseteq \{1,2,\dots,N\}$ lacking nonzero differences in $h(\mathbb{Z}^{\ell})$ satisfies $|A|\ll_h Ne^{-c(\log N)^{\mu}}$, where…

数论 · 数学 2021-09-07 John R. Doyle , Alex Rice

Let $H$ be a Krull monoid with finite class group $G$. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of all possible factorization lengths $k$ is…

交换代数 · 数学 2019-07-09 Alfred Geroldinger , Qinghai Zhong

We provide a countable series of bisimple $\mathcal{H}$-trivial finitely presented congruence-free monoids.

群论 · 数学 2013-01-24 Victor Maltcev

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…

群论 · 数学 2016-07-25 Desmond F. Cummins , Sergei V. Ivanov

Let $A$ be an infinite set of nonnegative integers. For $h \geq 2$, let $hA$ be the set of all sums of $h$ not necessarily distinct elements of $A$. If every sufficiently large integer in the sumset $hA$ has at least two representations,…

数论 · 数学 2016-05-04 Melvyn B. Nathanson

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

交换代数 · 数学 2024-04-29 Alfred Geroldinger , Florian Kainrath
‹ 上一页 1 2 3 10 下一页 ›