Related papers: Partition regularity of infinite parallelepiped se…

We prove that for each multiplicative subgroup $A$ of finite index in $\mathbb{Q}^+$, the set of integers $a$ with $a, a+1 \in A$ is an IP-set. This generalizes a theorem of Hildebrand concerning completely multiplicative functions taking…

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Generalising results of Erd\H{o}s-Freud and Lindstr\"om, we prove that the largest Sidon subset of a bounded interval of integers is equidistributed in Bohr neighbourhoods. We establish this by showing that extremal Sidon sets are…

We study models of HST, a nonstandard set theory which includes, in particular, the ZFC Replacement and Separation schemata in the language containing the membership and standardness predicates, and Saturation for well-orderable families of…

There exist two notions of typicality in computability theory, namely, genericity and randomness. In this article, we introduce a new notion of genericity, called partition genericity, which is at the intersection of these two notions of…

Hindman conjectured that any finite partition of $\mathbb{N}$ has a monochromatic $\{x,y,x+y,xy\}$. Recently, Bowen proved the result for all 2-partition. In this paper, we extend Bowen's result to any semiring $(S,+,\cdot)$ such that $Ss$…

Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

A subset $A$ of $\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\in \mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from…

A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.

We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…

Good semigroups form a class of submonoids of $\mathbb{N}^d$ containing the value semigroups of curve singularities. In this article, we describe a partition of the complements of good semigroup ideals, having as main application the…

In their proof of the IP Szemer\'edi theorem, a far reaching extension of the classic theorem of Szemer\'edi on arithmetic progressions, Furstenberg and Katznelson introduced an important class of additively large sets called…

We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to…

We construct the \emph{inverse partition semigroup} $\mathcal{IP}_X$, isomorphic to the \emph{dual symmetric inverse monoid} $\mathcal{I}^{\ast}_X$, introduced in [6]. We give a convenient geometric illustration for elements of…

Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the…

Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…

The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is regular. In this work we answer to the problem posed as an…