Related papers: Classifying word problems of finitely generated al…
We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…
We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…
Classifying isomorphism classes of group gradings on algebras presents a compelling challenge, particularly within the realms of non-simple and infinite-dimensional algebras, which have been relatively unexplored. This study focuses on a…
In this article, we introduce and investigate a class of C$^{\ast}$-algebras generated by reduced graph products of C$^{\ast}$-algebras, augmented with families of projections naturally associated with words in right-angled Coxeter groups.…
After substantial progress over the last 15 years, the "algebraic CSP-dichotomy conjecture" reduces to the following: every local constraint satisfaction problem (CSP) associated with a finite idempotent algebra is tractable if and only if…
Classical affine Lie algebras appear e.g. as symmetries of infinite dimensional integrable systems and are related to certain differential equations. They are central extensions of current algebras associated to finite-dimensional Lie…
The paper deals with $C^*$-algebras generated by a net of Hilbert spaces over a partially ordered set. The family of those algebras constitutes a net of $C^*$-algebras over the same set. It is shown that every such an algebra is graded by…
We study linear versions of Reedy categories in relation with finite dimensional algebras and abelian model structures. We prove that, for a linear Reedy category $\mathcal{C}$ over a field, the category of left $\mathcal{C}$--modules…
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…
A gradual semantics takes a weighted argumentation framework as input and outputs a final acceptability degree for each argument, with different semantics performing the computation in different manners. In this work, we consider the…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
Finite rational $\cw$ algebras are very natural structures appearing in coset constructions when a Kac-Moody subalgebra is factored out. In this letter we address the problem of relating these algebras to integrable hierarchies of…
Gao and Jackson showed that any countable Borel equivalence relation (CBER) induced by a countable abelian Polish group is hyperfinite. This prompted Hjorth to ask if this is in fact true for all CBERs classifiable by (uncountable) abelian…
The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…
We show that the category of countable Borel equivalence relations (CBERs) is dually equivalent to the category of countable $\mathcal{L}_{\omega_1\omega}$ theories which admit a one-sorted interpretation of a particular theory we call…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…