相关论文: Classifying word problems of finitely generated al…
We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
The constraint satisfaction probem (CSP) is a well-acknowledged framework in which many combinatorial search problems can be naturally formulated. The CSP may be viewed as the problem of deciding the truth of a logical sentence consisting…
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…
In this paper we prove that every recursively presented Lie algebra over a field which is a finite extention of its simple subfield can be embedded in a recursively presented Lie algebra defined by relations which are equalities of…
We consider finitely generated normal algebras over an algebraically closed field of characteristic zero that come with a complexity one grading by a finitely generated abelian group such that the conditions of a UFD are satisfied for…
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
Let $C^{pr}_m$ be the upper semilattice of degrees of computable sets with respect to primitive recursive $m$-reducibility. We prove that the first-order theory of $C^{pr}_m$ is hereditarily undecidable.
We classify irreducible finite-dimensional modules of a collection of real Lie superalgebras that includes the simple ones, their classical variants, complex Lie superalgebras after restriction of scalars, and all real Lie algebras. Our…
The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static…
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…
Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems…
We solve a class of lifting problems involving approximate polynomial relations (soft polynomial relations). Various associated C*-algebras are therefore projective. The technical lemma we need is a new manifestation of Akemann and…
We introduce a new framework linking group theory and formal language theory which generalizes a number of ways these topics have been linked in the past. For a language class C in the Chomsky hierarchy, we say a group is epiC if it admits…
The conjugacy of split Cartan subalgebras in the finite dimensional simple case (Chevalley) and in the symmetrizable Kac-Moody case (Peterson-Kac) are fundamental results of the theory of Lie algebras. Among the Kac-Moody Lie algebras the…
It is possible to translate a modified version of K. Worytkiewicz's combinatorial semantics of CCS (Milner's Calculus of Communicating Systems) in terms of labelled precubical sets into a categorical semantics of CCS in terms of labelled…
We characterize relatively norm compact sets in the regular $C^*$-algebra of finitely generated Coxeter groups using a geometrically defined positive semigroup acting on the algebra.
This paper investigates big Ramsey degrees of unrestricted relational structures in (possibly) infinite languages. Despite significant progress in the study of big Ramsey degrees, the big Ramsey degrees of many classes of structures with…
We analyze the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely…