Related papers: Power monoids and their arithmetic: a survey

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

In computer science, especially when dealing with quantum computing or other non-standard models of computation, basic notions in probability theory like "a predicate" vary wildly. There seems to be one constant: the only useful example of…

We study some of the factorization invariants of the class of Puiseux monoids generated by geometric sequences, and we compare and contrast them with the known results for numerical monoids generated by arithmetic sequences. The class we…

We study the semiring $\mathbb{N}_0[\alpha]$ as an additive monoid where $\alpha$ is a positive real algebraic number. In the atomic case, the atoms of $\mathbb{N}_0[\alpha]$ are precisely the powers $\alpha^n$ up to a certain nonnegative…

We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We characterize the submonoids $M$ of the additive monoid $\Q_+$ of nonnegative rational numbers for which the irreducible and the prime elements in the monoid domain $F[X;M]$ coincide. We present a diagram of implications between some…

We define and explore semireflection monoids on a finite-dimensional vector space. These are monoids generated by semireflections: linear maps fixing a subspace of codimension 1. We mostly focus on the case of projection monoids (where the…

The set of all subsets of any inverse semigroup forms an involution semiring under set-theoretical union and element-wise multiplication and inversion. We find structural conditions on a finite inverse semigroup guaranteeing that neither…

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…

In this paper we study the system of sets of lengths of non-finitely generated atomic Puiseux monoids (a Puiseux monoid is an additive submonoid of $\mathbb{Q}_{\ge 0}$). We begin by presenting a BF-monoid $M$ with full system of sets of…

A set $S\subseteq 2^E$ of subsets of a finite set $E$ is \emph{powerful} if, for all $X\subseteq E$, the number of subsets of $X$ in $S$ is a power of 2. Each powerful set is associated with a non-negative integer valued function, which we…

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…

Let $M$ be a cancellative and commutative (additive) monoid. The monoid $M$ is atomic if every non-invertible element can be written as a sum of irreducible elements, which are also called atoms. Also, $M$ satisfies the ascending chain…

The catenary degree is an invariant that measures the distance between factorizations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb Z_{\ge 0}$ occur as the set of catenary degrees of a…