相关论文: Almost $\mathcal{R}$-trivial monoids are almost ne…

Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

We introduce a ramified monoid, attached to each Brauer--type monoid, that is, to the symmetric group, to the Jones and Brauer monoids among others. Ramified monoids correspond to a class of tied monoids which arise from knot theory and are…

In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…

In this article we continue with the study started in [1] of nearly Frobenius structures in some representative families of finite dimensional algebras, as the radical square zero algebras, string algebras and the toupie algebras. We prove…

We extend the Kechris--Pestov--Todor\v{c}evi\'c correspondence to weak Fra\"{\i}ss\'{e} categories and automorphism groups of generic objects. The new ingredient is the weak Ramsey property. We demonstrate the theory on several examples…

In a previous paper, we stated a general almost purity theorem in the style of Faltings: if R is a ring for which the Frobenius maps on finite p-typical Witt vectors over R are surjective, then the integral closure of R in a finite \'etale…

We prove that the group of almost-automorphisms of the infinite rooted regular $d$-ary tree $\mathcal{T}_d$ arises naturally as the Thompson-like group of a so called $d$-ary cloning system. A similar phenomenon occurs for any…

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

The goal of this paper is to undertake an in-depth study of the phenomenon behind the Furstenberg--S\'ark\"ozy theorem, which, in its modern form due to Kamae and Mend\`es-France, states that if $E$ is a set of integers with positive…

Simple Hurwitz numbers enumerate branched morphisms between Riemann surfaces with fixed ramification data. In recent years, several variants of this notion for genus $0$ base curves have appeared in the literature. Among them are so-called…

There are several families of atomic monoids whose arithmetical invariants have received a great deal of attention during the last two decades. The factorization theory of finitely generated monoids, strongly primary monoids, Krull monoids,…

We introduce a class of inverse monoids, called Tarski monoids, that can be regarded as non-commutative generalizations of the unique countable, atomless Boolean algebra. These inverse monoids are related to a class of etale topological…

We complete the proof of the Nisnevich conjecture in equal characteristic: for a smooth algebraic variety $X$ over a field $k$, a $k$-smooth divisor $D \subset X$, and a reductive $X$-group $G$ whose base change $G_D$ is totally isotropic,…

Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…

We prove additive and multiplicative partition theorems, obtaining combinatorial results for p-quasicyclic groups, where p is a prime number. We also get density results for p-quasicyclic groups via left F{\o}lner sequences of non-empty…

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

We examine a wide class of stochastic approximation algorithms for solving (stochastic) nonlinear problems on Riemannian manifolds. Such algorithms arise naturally in the study of Riemannian optimization, game theory and optimal transport,…

We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set. Namely, we…

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally finite quasi-transitive graphs avoiding a minor, which is…