Related papers: A characterization of finite factorization positiv…

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namely the factorization conjecture and the triangle conjecture,…

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…

We show that for any integer n and any field k of characteristic different from 2 there are at most finitely many isomorphism classes of quadratic morphisms from the projective line over k to itself with a finite postcritical orbit of size…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We examine the problem of projecting subsets of a commutative, positively ordered monoid into an $o$-ideal. We prove that to this end one may restrict to a sufficient subset, for whose cardinality we provide an explicit upper bound. Several…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

We study cocompleteness, co-wellpoweredness and generators in the centralizer category of an object or morphism in a monoidal category, and the center or the weak center of a monoidal category. We explicitly give some answers for when…

Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…

A subgroup $H$ of a finite group $G$ is submodular in $G$ if there is a subgroup chain $H=H_0\leq\ldots\leq H_i\leq H_{i+1}\leq \ldots \leq H_n=G$ such that $H_i$ is a modular subgroup of $H_{i+1}$ for every $i$. We investigate finite…

We prove a generalisation to any characteristic of a result of Macdonald that describes strict polynomial functors in characteristic zero in terms of representations of the groupoid of finite sets and bijections. Our result will give an…

The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of…

We show that being finitely presentable and being finitely presentable with solvable word problem are quasi-isometry invariants of finitely generated left cancellative monoids. Our main tool is an elementary, but useful, geometric…

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 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.

We study Question 7.9 in the paper "Monoids in the mapping class group" by Etnyre and Van Horn-Morris; whether a symmetric mapping class admitting a positive factorization is a lift of a quasi-positive braid. We answer affirmatively for…

We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions,…

Given a monoid defined by a presentation, and a homotopy base for the derivation graph associated to the presentation, and given an arbitrary subgroup of the monoid, we give a homotopy base (and presentation) for the subgroup. If the monoid…