Related papers: Axiomatisability problems for S-posets

There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…

We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…

We consider the value 1 problem for probabilistic automata over finite words: it asks whether a given probabilistic automaton accepts words with probability arbitrarily close to 1. This problem is known to be undecidable. However, different…

We investigate the complexity of the separation problem associated to classes of regular languages. For a class C, C-separation takes two regular languages as input and asks whether there exists a third language in C which includes the…

One of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO_2) is fixed-parameter tractable (fpt) on C by linear time parameterized algorithms,…

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…

We introduce the constrained topological sorting problem (CTS): given a regular language K and a directed acyclic graph G with labeled vertices, determine if G has a topological sort that forms a word in K. This natural problem applies to…

The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete…

We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…

For a finite relational structure A, let CSP(A) denote the CSP instances whose constraint relations are taken from A. The resulting family of problems CSP(A) has been considered heavily in a variety of computational contexts. In this…

We give an elementary construction of the exact completion of a weakly lex category for categories enriched in the cartesian closed category $\mathsf{Pos}$ of partially ordered sets. Paralleling the ordinary case, we characterize categories…

Let G denote a group and let W be an algebra over a commutative ring R. We will say that W is a G-graded twisted algebra (not necessarily commutative, neither associative) if there exists a G-grading W=\bigoplus_{g \in G}W_{g} where each…

We investigate the notions of amenability and its related homological notions for a class of $I\times I$-upper triangular matrix algebra, say $UP(I,A)$, where $A$ is a Banach algebra equipped with a non-zero character. We show that…

From any poset isomorphic to the poset of gaps of a numerical semigroup $S$ with the order induced by $S$, one can recover $S$. As an application, we prove that two different numerical semigroups cannot have isomorphic posets (with respect…

In this note we show that the irreducible twisted modules of a holomorphic, $C_2$-cofinite vertex operator algebra $V$ have $L_0$-weights at least as large as the smallest $L_0$-weight of $V$. Hence, if $V$ is of CFT-type, then the twisted…

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz…

We investigate questions related to the notion of recognizability of sequences of morphisms, a generalization of Moss{\'e}'s Theorem. We consider the most general class of morphisms including ones with erasable letters. The main result…

We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it…

Given a 2-category $\twocat{K}$ admitting a calculus of bimodules, and a 2-monad T on it compatible with such calculus, we construct a 2-category $\twocat{L}$ with a 2-monad S on it such that: (1)S has the adjoint-pseudo-algebra property.…