Related papers: The structure theorem for sets of length for numer…
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…
This article introduces patterns of ideals of numerical semigroups, thereby unifying previous definitions of patterns of numerical semigroups. Several results of general interest are proved. More precisely, this article presents results on…
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…
Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…
The complete algebraic structure of semisimple finite group algebra of a generalized strongly monomial group is provided. This work extends the work of Broche and del R{\'{\i}}o on strongly monomial groups. The theory is complimented by an…
The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…
In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
Let $G$ be a finite abelian group and $S$ a sequence with elements of $G$. Let $|S|$ denote the length of $S$ and $\mathrm{supp}(S)$ the set of all the distinct terms in $S$. For an integer $k$ with $k\in [1, |S|]$, let $\Sigma_{k}(S)…
Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…
Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…
Sheaves of structures are useful to give constructions in universal algebra and model theory. We can describe their logical behavior in terms of Heyting-valued structures. In this paper, we first provide a systematic treatment of sheaves of…
Following the work done by Olshanskii for groups, we describe, for a given semigroup $S$, which functions $l : S \rightarrow \mathbb{N}$ can be realized up to equivalence as length functions $g \mapsto |g|_{H}$ by embedding $S$ into a…
Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…
Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…