Related papers: Minimal signatures with undecidability of represen…
We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…
A common theme in factorised databases and knowledge compilation is the representation of solution sets in a useful yet succinct data structure. In this paper, we study the representation of the result of join queries (or, equivalently, the…
We introduce a fragment of second-order unification, referred to as \emph{Second-Order Ground Unification (SOGU)}, with the following properties: (i) only one second-order variable is allowed, and (ii) first-order variables do not occur. We…
The Heisenberg uncertainty relation is known to be obtainable by a purely mathematical argument. Based on that fact, here it is shown that the Heisenberg uncertainty relation remains valid when Quantum Mechanics is re-formulated within far…
We define a variant of intersection space theory that applies to many compact complex and real analytic spaces $X$, including all complex projective varieties; this is a significant extension to a theory which has so far only been shown to…
A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…
Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…
A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semibounded if the corresponding operators $i\dd\pi(x)$ from the derived representation are uniformly bounded from above on some non-empty open subset of…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable…
A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
This article investigates Dehornoy's monomial representations for structure groups and Coxeter-like groups associated with a set-theoretic solution to the Yang--Baxter equation. Using the brace structure of these groups and the language of…
We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…
A hemiimplicative semilattice is a bounded semilattice $(A, \wedge, 1)$ endowed with a binary operation $\to$, satisfying that for every $a, b, c \in A$, $a \leq b \to c$ implies $a \wedge b \leq c$ (that is to say, one of the conditionals…
We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…
Using techniques developed in [Lasserre02], we show that some minimum cardinality problems subject to linear inequalities can be represented as finite sequences of semidefinite programs. In particular, we provide a semidefinite…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
For a semisimple Lie group $G$ satisfying the equal rank condition, the most basic family of unitary irreducible representations is the discrete series found by Harish-Chandra. In this paper, we study some of the branching laws for discrete…