Related papers: Translation Monoids and Recursive Evaluation in Fi…

The paper considers algorithmic properties of classical and non-classical first-order logics and theories in bounded languages. The main idea is to prove the undecidability of various fragments of classical and non-classical first-order…

Let us say that an element of a given family $\A$ of subsets of $\R^d$ can be reconstructed using $n$ test sets if there exist $T_1,...,T_n \subset \R^d$ such that whenever $A,B\in \A$ and the Lebesgue measures of $A \cap T_i$ and $B \cap…

In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system $\Re$ that satisfies the condition that each rule in…

We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…

In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show…

We present several naturally occurring classes of spectral spaces using commutative algebra on pointed monoids. For this purpose, our main tools are finite type closure operations and continuous valuations on monoids which we introduce in…

We give a definition of monoidal categorifications of quantum cluster algebras and provide a criterion for a monoidal category of finite-dimensional graded $R$-modules to become a monoidal categorification of a quantum cluster algebra,…

Let $M(A,I)$ be a free partially commutative monoid with involution and $G(A,I)$ be its quotient group, e.g. a right-angled Artin or Coxeter group. Given a system of word equations over $M(A,I)$ with recognizable constraints with input size…

We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…

In 2021, Dzhunusov and Zaitseva classified two-dimensional normal affine commutative algebraic monoids. In this work, we extend this classification to noncommutative monoid structures on normal affine surfaces. We prove that two-dimensional…

Let $A$ be a separable, unital, simple C*-algebra with stable rank one. We show that every strictly positive, lower semicontinuous, affine function on the simplex of normalized quasitraces of $A$ is realized as the rank of an operator in…

We propose a design pattern for tackling text ranking problems, dubbed "Expando-Mono-Duo", that has been empirically validated for a number of ad hoc retrieval tasks in different domains. At the core, our design relies on pretrained…

An algebraic isopair is a commuting pair of pure isometries that is annihilated by a polynomial defining a distinguished variety $\mathcal{V}$. The notion of the rank of a pure algebraic isopair with finite bimultiplicity is introduced. For…

We consider subalgebras $\mathcal{A}$ of the algebra $M_n$ of $n \times n$ complex matrices that contain all diagonal matrices, known in the literature as the structural matrix algebras (SMAs). Let $\mathcal{A} \subseteq M_n$ be an…

We study the action of monads on categories equipped with several monoidal structures. We identify the structure and conditions that guarantee that the higher monoidal structure is inherited by the category of algebras over the monad.…

The Corona Factorization Property of a C*-algebra, originally defined to study extensions of C*-algebras, has turned out to say something important about intrinsic structural properties of the C*-algebra. We show in this paper that a…

We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursive algorithm for computing rank one tensor completion. This…

Motivated by the study of word problems of monoids, we explore two ways of viewing binary relations on $A^*$ as languages. We exhibit a hierarchy of classes of binary relations on $A^*$, according to the class of languages the relation…

It is well-known that the category of Kleisli algebras for a monoidal monad carries a canonical monoidal structure. We define the notion of a commutative graded monad and present a strictly two-categorical proof that Kleisli algebras for…

Braided monoidal categories arise naturally as centres of monoidal categories and have been the focus of much recent attention in both mathematics and physics. By suitably restricting the use of the exchange rule, we obtain a sequent…