Related papers: Automatic Structures: Richness and Limitations

We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization,…

The classical subset construction for non-deterministic automata can be generalized to other side-effects captured by a monad. The key insight is that both the state space of the determinized automaton and its semantics---languages over an…

We describe a technique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. Using this, we characterize automorphism groups of…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

We describe the group of continuous automorphisms of all simple infinite-dimensional linearly compact Lie superalgebras and use it in order to classify F-forms of these superalgebras over any field F of characteristic zero.

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

We show that the automorphism groups of certain countable structures obtained using the Hrushovski amalgamation method are simple groups. The structures we consider are the 'uncollapsed' structures of infinite Morley rank obtained by the ab…

In this paper, we study the category of modules over the Smith algebra which are free of finite rank over the unital polynomial subalgebra generated by the Cartan element $h$ and obtain families of such simple modules of arbitrary rank. In…

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…

We prove the Freiheitssatz for right-symmetric algebras and the decidability of the word problem for right-symmetric algebras with a single defining relation. We also prove that two generated subalgebras of free right-symmetric algebras are…

We introduce a theory of "patterns" in order to study geodesics in a certain class of group presentations. Using patterns we show that there does not exist a geodesic automatic structure for certain group presentations, and that certain…

The symplectic blob algebra $b_n$ ($n \in \mathbb{N}$) is a finite dimensional algebra defined by a multiplication rule on a basis of certain diagrams. The rank $r(n)$ of $b_n$ is not known in general, but $r(n)/n$ grows unboundedly with…

We show that the closure of the compactly supported mapping class group of an infinite type surface is not perfect and that its abelianization contains a direct summand isomorphic to an uncountable direct sum of rationals. We also extend…