English
Related papers

Related papers: Sets of Lengths

200 papers

Let $D$ be a principal ideal domain with infinite spectrum such that for every nonzero prime ideal $M$ of $D$, the residue field $D/M$ is finite. Let $K$ be the quotient field of $D$. We investigate sets of lengths in the ring of…

Commutative Algebra · Mathematics 2026-03-23 Zaituni Kansiime , Sholastica Luambano , Sarah Nakato , Hadijah Nalule , Yvette Ndayikunda

We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…

Formal Languages and Automata Theory · Computer Science 2015-03-24 Paul Bell , Daniel Reidenbach , Jeffrey Shallit

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

Let $G$ be a finite soluble group and $h(G)$ its Fitting length. The aim of this paper is to give certain upper bounds for $h(G)$ as functions of the Fitting length of at least three Hall subgroups of $G$ which factorize $G$ in a particular…

Group Theory · Mathematics 2015-07-29 Giorgio Busetto , Enrico Jabara

We show that for every finite nonempty set L of integers greater than or equal to 2 there are a numerical monoid H and a squarefree element a $\in$ H whose set of lengths L(a) is equal to L.

Commutative Algebra · Mathematics 2018-01-18 Alfred Geroldinger , Wolfgang Schmid

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Logic · Mathematics 2014-07-23 Leigh Evron , Joseph R. Mileti , Ethan Ratliff-Crain

Let H be a Krull monoid with finite class group G and suppose that every class contains a prime divisor. Then sets of lengths in H have a well-defined structure which just depends on the class group G. With methods from additive…

Commutative Algebra · Mathematics 2019-06-14 Alfred Geroldinger , Wolfgang Schmid

Let $G$ be a finite group. A finite unordered sequence $S = g_1 \boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their…

Commutative Algebra · Mathematics 2018-02-06 Jun Seok Oh

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

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,…

Commutative Algebra · Mathematics 2023-11-13 Gilad Moskowitz , Christopher O'Neill

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

Group Theory · Mathematics 2011-07-27 Hiroki Kodama

Let $\mathcal A$ be an $\mathbb F$-algebra and let $\mathcal S$ be its generating set. The length of $\mathcal S$ is the smallest number $k$ such that $\mathcal A$ equals the $\mathbb F$-linear span of all products of length at most $k$ of…

Rings and Algebras · Mathematics 2025-05-19 M. A. Khrystik

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli

In an atomic, cancellative, commutative monoid $S$, the elasticity of an element provides a coarse measure of its non-unique factorizations by comparing the largest and smallest values in its set of factorization lengths (called its length…

Combinatorics · Mathematics 2018-08-15 Thomas Barron , Christopher O'Neill , Roberto Pelayo

A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…

Rings and Algebras · Mathematics 2019-03-06 Jason P. Bell , Albert Heinle , Viktor Levandovskyy

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…

Rings and Algebras · Mathematics 2023-08-28 Nik Stopar

B. A. Barnes introduced so-called Fredholm elements in a semiprime ring whose definition is inspired by Atkinson's theorem. Here the socle of a semiprime ring generalizes the ideal of finite-rank operators on a Banach space. In this paper,…

Rings and Algebras · Mathematics 2024-04-29 Niklas Ludwig

Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A})^{(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a…

Number Theory · Mathematics 2022-05-03 Melvyn B. Nathanson

Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…

Logic · Mathematics 2024-02-01 Tobias Kaiser

For a numerical monoid $\langle n_1, \dots, n_k \rangle$ minimally generated by $n_1, \dots, n_k \in \mathbb{N}$ with $n_1 < \cdots < n_k$, the longest and shortest factorization lengths of an element $x$, denoted as $L(x)$ and $\ell(x)$,…

Commutative Algebra · Mathematics 2023-11-08 Baian Liu , JiaYan Yap