Related papers: Formal language convexity in left-orderable groups

We prove various results about the Local Converse Problem for split reductive groups $G$ over a non-archimedean local field~$F$ of characteristic $0$ and residual characteristic $p$. In particular, we prove that when $G$ is a symplectic or…

If G is a finitely generated powerful pro-p group satisfying a certain law v=1, and if G can be generated by a normal subset T of finite width which satisfies a positive law, we prove that G is nilpotent. Furthermore, the nilpotency class…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments…

One can observe that Coxeter groups and right-angled Artin groups share the same solution to the word problem. On the other hand, in his study of reflection subgroups of Coxeter groups Dyer introduces a family of groups, which we call Dyer…

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

In this paper, we survey some of the recent advances on embeddings into finitely generated (left-orderable) simple group such that the overgroup preserves algorithmic, geometric, or algebraic information about the embedded group. We discuss…

Shumyatsky and the second author proved that if G is a finitely generated residually finite p-group satisfying a law, then, for almost all primes, the fact that a normal and commutator-closed set of generators satisfies a positive law…

In this paper, which is part of a study of positive representations of locally compact groups in Banach lattices, we initiate the theory of positive representations of finite groups in Riesz spaces. If such a representation has only the…

Uhlenbeck proved that a set of simple elements generates the group of rational loops in GL(n,C) that satisfy the U(n)-reality condition. For an arbitrary complex reductive group, a choice of representation defines a notion of rationality…

In the present paper we continue studying regular free group actions on $\mathbb{Z}^n$-trees. We show that every finitely generated $\mathbb{Z}^n$-free group $G$ can be embedded into a finitely generated $\mathbb{Z}^n$-free group $H$ acting…

Given a regular subgroup R of AGL_n(F), one can ask if R contains nontrivial translations. A negative answer to this question was given by Liebeck, Praeger and Saxl for AGL_2(p) (p a prime), AGL_3(p) (p odd) and for AGL_4(2). A positive…

The orthogonal groups are a series of simple Lie groups associated to symmetric bilinear forms. There is no analogous series associated to symmetric trilinear forms. We introduce an infinite dimensional group-like object that can be viewed…

We study the observation congruences induced by rational polyhedral cones on vector-valued quantitative languages. The extreme rays of the dual cone define intrinsic covectors, and these covectors classify every incremental residual future…

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

For each positive integer $k$ we present an example of Coxeter system $(G_k,S_k)$ such that $G_k$ is a word-hyperbolic Coxeter group, for any two generating reflections $s,t\in S_k$ the product $st$ has finite order, and the Coxeter graph…

We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

We examine the relationship between finitely and infinitely generated relatively hyperbolic groups, in two different contexts. First, we elaborate on a remark from math.GR/0601311, which states that the version of Dehn filling in relatively…