Related papers: The Network Satisfaction Problem for Relation Alge…

Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…

For $n\geq 3$, let $(H_n, E)$ denote the $n$-th Henson graph, i.e., the unique countable homogeneous graph with exactly those finite graphs as induced subgraphs that do not embed the complete graph on $n$ vertices. We show that for all…

In ``Monk Algebras and Ramsey Theory,'' \emph{J. Log. Algebr. Methods Program.} (2022), Kramer and Maddux prove various representability results in furtherance of the goal of finding the smallest weakly representable but not representable…

The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main…

We prove that the isomorphism problem for separable nuclear C*-algebras is complete in the class of orbit equivalence relations. In fact, already the isomorphism of simple, separable AI C*-algebras is a complete orbit equivalence relation.…

We present a structural classification of constraint satisfaction problems (CSP) described by reflexive complete $2$-edge-coloured graphs. In particular, this classification extends the structural dichotomy for graph homomorphism problems…

In Alm-Hirsch-Maddux (2016), relation algebras $\mathfrak{L}(q,n)$ were defined that generalize Roger Lyndon's relation algebras from projective lines, so that $\mathfrak{L}(q,0)$ is a Lyndon algebra. In that paper, it was shown that if…

We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with…

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

In this paper, we consider relational structures arising from Comer's finite field construction, where the cosets need not be sum free. These Comer schemes generalize the notion of a Ramsey scheme and may be of independent interest. As an…

By means of principal isotopes lH(a,b) of the algebra lH [Ra 99] we give an exhaustive and not repetitive description of all 4-dimensional absolute-valued algebras satisfying (x^p, x^q, x^r) = 0 for fixed integers p, q, r \in\{1,2\}. For…

We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…

To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…

We exhibit finite cyclic group representations for relation algebras $57_{65}$ and $63_{65}$. As a consequence, of the ten symmetric integral RAs on four atoms having at least one flexible atom, all are now known to have a representation…

The present article is a part of the study of solvable Leibniz algebras with a given nilradical. In this paper solvable Leibniz algebras, whose nilradicals is naturally graded $p$-filiform non-Lie Leibniz algebra $(n-p\geq4)$ and the…

Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…

A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

All solvable Lie algebras with Heisenberg nilradical have already been classified. We extend this result to a classification of solvable Leibniz algebras with Heisenberg nilradical. As an example, we show the complete classification of all…

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in the literature, and the class of word-representable split…