Related papers: Which sets are sets of lengths in all numerical mo…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

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…

We will show that, consistently, every uncountable set can be continuously mapped onto a non measure zero set, while there exists an uncountable set whose all continuous images into a Polish space are meager.

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

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…

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

The set of distances of a monoid or of a domain 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 \cdot u_k = v_1 \cdot…

We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.

In this note we prove that any affine algebraic monoid can be obtained as the endomorphisms' monoid of a finite-dimensional (nonassociative) algebra.

We introduce a new invariant describing the structure of sets of lengths in atomic monoids and domains. For an atomic monoid $H$, let $\Delta_{\rho} (H)$ be the set of all positive integers $d$ which occur as differences of arbitrarily long…

We analyze the set of increasingly enumerable additive submonoids of R, for instance, the set of logarithms of the positive integers with respect to a given base. We call them $\omega$-monoids. The $\omega$-monoids for which consecutive…

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

Let $S \subset \mathbb{N}_0$ be a numerical monoid and let $\mathcal P_{\mathrm{fin}} (S)$, resp $\mathcal P_{\mathrm{fin},0}(S)$, denote the power monoid, resp. the restricted power monoid, of $S$, that is the set of all finite nonempty…

We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.