Related papers: Ramsey monoids
We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…
Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
We introduce the class of strongly sofic monoids. This class of monoids strictly contains the class of sofic groups and is a proper subclass of the class of sofic monoids. We define and investigate sofic topological entropy for actions of…
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 develop the theory of Fra\"iss\'e limits for classes of finite-dimensional multi-seminormed spaces, which are defined to be vector spaces equipped with a finite sequence of seminorms. We define a notion of a Fra\"iss\'e Fr\'echet space…
We prove Roth type theorems in finite groups. Our main tool is the Triangle Removal Lemma of Ruzsa and Szemer\'edi.
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
Let $\mathfrak{M}_n$ be the multiplicative monoid of $n \times n$ matrices over a finite field. The monoid algebra $\mathbf{C}[\mathfrak{M}_n]$ has been studied for several decades. One of the important early results is Kov\'acs' theorem…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…
We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this…
In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
We develop a finite KKG-theory of C*-algebras following Arlettaz- H.Inassaridze's approach to finite algebraic K-theory. The Browder- Karoubi-Lambre's theorem on the orders of the elements for finite algebraic K-theory is extended to finite…
We present a method for proving that a semigroup is finitely based and find some new sufficient conditions under which a monoid is finitely based. As an application, we find a class of finite monoids where the finite basis property behaves…
This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…
We give a parametrization with perfect subsets of $2^{\infty}$ of the abstract Ramsey theorem (see \cite{todo}) Our main tool is an extension of the parametrized version of the combinatorial forcing developed in \cite{nash} and \cite{todo},…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
This paper is the third part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…
There is a longstanding conjecture, due to Gregory Cherlin and Boris Zilber, that all simple groups of finite Morley rank are simple algebraic groups. One of the major theorems in the area is Borovik's trichotomy theorem. The "trichotomy"…