相关论文: Automatic Structures: Richness and Limitations
The field of constraint satisfaction problems (CSPs) studies homomorphism problems between relational structures where the target structure is fixed. Classifying the complexity of these problems has been a central quest of the field,…
We present three examples of countable homogeneous structures (also called Fraisse limits) whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures. Our first…
We develop a theory of generalized presentations of groups. We give generalized presentations of the symmetric group $\Sigma(X)$ for an arbitrary set $X$ and of the automorphism group of the free group of countable rank, $Aut(F_{\omega})$.
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…
For any finite dimensional basic associative algebra, we study the presentation spaces and their relation with the representation spaces. We prove two propositions about a general presentation, one on its subrepresentations and the other on…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…
We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.
We describe the structure of the algebraic group of automorphisms of all simple finite dimensional Lie superalgebras. Using this and \'etale cohomology considerations, we list all different isomorphism classes of the corresponding twisted…
We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…
Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…
The paper is intended to be a survey on some topics within the framework of automorphisms of a relatively free groups of infinite rank. We discuss such properties as tameness, primitivity, small index, Bergman property, and so on.
We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
In this note we study associative dialgebras proving that the most interesting such structures arise precisely when the algebra is not semiprime. In fact the presence of some "perfection" property (simpleness, primitiveness, primeness or…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…
The main result of this paper is that the isomorphism for omega-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov,…