Related papers: Finite Representation Property for Relation Algebr…
For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the…
One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
In this series of papers, we investigate properties of a finite group which are determined by its low degree irreducible representations over a number field $F$, i.e. its representations on matrix rings $\operatorname{M}_n(D)$ with $n \leq…
In this paper we will study an important but rather technical result which is called The Reduction Property. The result tells us how much arithmetical conservation there is between two arithmetical theories. Both theories essentially speak…
A subclass of nondeterministic Finite Automata generated by means of regular Grammars (GFAs, for short) is introduced. A process algebra is proposed, whose semantics maps a term to a GFA. We prove a representability theorem: for each GFA…
If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…
In order to deal with the curse of dimensionality in reinforcement learning (RL), it is common practice to make parametric assumptions where values or policies are functions of some low dimensional feature space. This work focuses on the…
Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F)…
A non-self-adjoint operator algebra is said to be residually finite dimensional (RFD) if it embeds into a product of matrix algebras. We characterize RFD operator algebras in terms of their matrix state space, and moreover show that an…
A domain $R$ is said to have the finite factorization property if every nonzero non-unit element of $R$ has at least one and at most finitely many distinct factorizations up to multiplication of irreducible factors by central units. Let $k$…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
Finite families of biorthogonal rational functions and orthogonal polynomials of Racah-type are studied within a unified algebraic framework based on the meta Racah algebra and its finite-dimensional representations. These functions are…
Assume that ${\mathbb F}$ is an algebraically closed field with characteristic zero. The Racah algebra $\Re$ is the unital associative ${\mathbb F}$-algebra defined by generators and relations in the following way. The generators are $A$,…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…
We survey recent developments concerning two properties of classes of finite structures: the Ramsey property and the extension property for partial automorphisms (EPPA).
We investigate infinite-exponent partition relations on arbitrary relational structures, with a focus on linear orders and graphs. Any such relation contradicts the Axiom of Choice. We show that there are some such relations which are…
Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…
Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…