Andrew J. Duncan, Ilya V. Kazachkov, Vladimir N. Remeslennikov
In a previous paper we investigated the centraliser dimension of groups. In the current paper we study properties of centraliser dimension for the class of free partially commutative groups and, as a corollary, we obtain an efficient algorithm for computation of centraliser dimension in these groups.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let S be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph S, which we call canonical parabolic subgroups. A natural extension of the definition leads to canonical quasiparabolic subgroups. It is shown that the centralisers of subsets of G are the conjugates of canonical quasiparabolic centralisers satisfying certain graph theoretic conditions.
In this paper we establish results that will be required for the study of the algebraic geometry of partially-commutative groups. We define classes of groups axiomatised by sentences determined by a graph. Among the classes which arise this way we find CSA and CT groups. We study the centraliser dimension of a group, with particular attention to the height of the lattice of centralisers, which we call the centraliser dimension of the group. The behaviour of centraliser dimension under several common group operations is described. Groups with centraliser dimension 2 are studied in detail. It is…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially commutative groups (or right-angled Artin groups). In this paper we construct orthogonality theory for graphs with the study of partially commutative groups in mind. The theory developed here provides tools for the study of the structure of the centraliser lattice of partially commutative groups and for their automorphism groups.
In this note we give two examples of partially commutative subgroups of partially commutative groups. Our examples are counterexamples to the Extension Graph Conjecture and to the Weakly Chordal Conjecture of Kim and Koberda, \cite{KK}. On the other hand we extend the class of partially commutative groups for which it is known that the Extension Graph Conjecture holds, to include those with commutation graph containing no induced $C_4$ or $P_3$. In the process, some new embeddings of surface groups into partially commutative groups emerge.
We construct an ordered set of commutators in a partially commutative nilpotent group $F(X; Γ; \mathfrak N_m)$. This set allows us to define a canonical form for each element of $F(X; Γ; \mathfrak N_m)$. Namely, we construct a Maltsev basis for the group $F(X; Γ; \mathfrak N_m).$
The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups $\mathbb{G}(Δ)$ and $\mathbb{G}(Γ)$ are quasi-isometric, then $\mathbb{G}(Δ)$ is a (nice) subgroup of $\mathbb{G}(Γ)$ and vice-versa. We show that the conjecture holds for all known cases of quasi-isometric classification of partially commutative groups, namely for the classes of $n$-tress and atomic graphs. As in the classical Mostow rigidity theory for irre…
Version 2: Corrected Section 3.3: instead of lexicographical normal forms we now use a normal form due to V. Diekert and A. Muscholl. Consequent changes made and some misprints corrected. Using an analogue of Makanin-Razborov diagrams, we give an effective description of the solution set of systems of equations over a partially commutative group (right-angled Artin group) $G$. Equivalently, we give a parametrisation of $Hom(H, G)$, where $H$ is a finitely generated group.
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial optimisation. We obtain a method applicable to a wide range of problems and give results which indicate good behaviour of the genetic algorithm, hinting at the presence of a new deterministic solution and a framework for further results.
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $Γ$, the authors introduce an infinite, locally infinite graph $Γ^e$, called the extension graph of $Γ$. They show that each finite induced subgraph $Δ$ of $Γ^e$ gives rise to an embedding between the partially commutative groups $G(Δ)$ and $G(Γ)$. Furthermore, it is proven that in many instances the converse also holds. Our first result is the decidability of the Extension Graph Embedding Problem: there is an algorithm that given two finite simplicial …
The structure of a certain subgroup $S$ of the automorphism group of a partially commutative group (RAAG) $G$ is described in detail: namely the subgroup generated by inversions and elementary transvections. We define admissible subsets of the generators of $G$, and show that $S$ is the subgroup of automorphisms which fix all subgroups $\langle Y\rangle$ of $G$, for all admissible subsets $Y$. A decomposition of $S$ as an iterated tower of semi-direct products in given and the structure of the factors of this decomposition described. The construction allows a presentation of $S$ to be computed…
This is a survey of results on partially commutative groups and partially commutative algebras.
The original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.
The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $Γ$ we construct an arithmetic subgroup $St(L(G))$, represented as a subgroup of $GL(n,Z)$, where $n$ is the number of vertices of the graph $Γ$. In the last section of the paper we give a description of the decomposition of the group of automorphisms $St^{conj}(L(G))$ as a semidirect product of the group of conjugating automorphisms $Conj(G)$ and $St(L(G))$. This result is closely related to Theorem 1.4 of …
We generalise a key result of one-relator group theory, namely Magnus's Freiheitssatz, to partially commutative groups, under sufficiently strong conditions on the relator. The main theorem shows that under our conditions, on an element $r$ of a partially commutative group $\mathbb{G}$, certain Magnus subgroups embed in the quotient $G=\mathbb{G}/N(r)$; that if $r=s^n$ has root $s$ in $\mathbb{G}$ then the order of $s$ in $G$ is $n$, and under slightly stronger conditions that the word problem of $G$ is decidable. We also give conditions under which the question of which Magnus subgroups of $\…
In this paper, we find a criterium for universal equivalence of partially commutative Lie algebras whose defining graphs are trees. Besides, we obtain bases for partially commutative metabelian Lie algebras.
We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show how Aut(G) decomposes in terms of the connected components of C: obtaining a particularly clear decomposition theorem in the special case where C has no isolated vertices. If C has no vertices of a type we call dominated then we give a semi-direct decompostion of Aut(G) into a subgroup of locally conjugating automorphisms by the subgroup stabilising a certa…
In this paper, linear bases for the partially commutative Lie algebras are found. The method of the Gröbner--Shirshov bases is used. It easily follows from the structure that the equality problem is algorithmically solvable for the partially commutative Lie algebras.
In this version small mistakes are corrected and the exposition is changed as suggested by the referee (to appear in Canadian Journal of Mathematics). The first main result of the paper is a criterion for a partially commutative group $\GG$ to be a domain. It allows us to reduce the study of algebraic sets over $\GG$ to the study of irreducible algebraic sets, and reduce the elementary theory of $\GG$ (of a coordinate group over $\GG$) to the elementary theories of the direct factors of $\GG$ (to the elementary theory of coordinate groups of irreducible algebraic sets). Then we establish norma…
We introduce a class of spaces, called real cubings, and study the stucture of groups acting nicely on these spaces. Just as cubings are a natural generalisation of simplicial trees, real cubings can be regarded as a natural generalisation of real trees. Our main result states that a finitely generated group $G$ acts nicely (essentially freely and co-specially) on a real cubing if and only if it is a subgroup of a graph tower (a higher dimensional generalisation of $ω$-residually free towers and NTQ-groups). It follows that $G$ acts freely, essentially freely and co-specially on a real cubing …
We show that in the class of partially commutative groups, the conditions of being Howson, being fully residually free, and being free product of free-abelian groups, are equivalent.
Solutions of Word Equations over Partially Commutative Structures
本文研究部分交换幺半群及其商群上的字方程系统，证明解集构成EDT0L语言，并给出有效构造算法，从而在NSPACE(n log n)内可判定可满足性和有限性。
We show that for each fixed $k$, the problem of finding $k$ pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces needed to cover all sources and sinks. Moreover, the method can be extended to any fixed compact orientable surface (instead of the plane) and to rooted trees (instead of paths). Our approach is algebraic and is based on cohomology over graph (nonabelian) groups. More precisely, let $D=(V,A)$ be a directed graph and let $(G,\cdot)$ be a group. Call two functi…
We consider the class of finitely generated groups whose relators are powers of commutators of the generators. This class contains as a small subclass graph groups (also called RAAGs), namely if all powers are one. Graph groups are the only torsionfree groups in this class. The generators are of infinite order, but we may also add torsion by assigning arbitrary orders to the generators. Then the above mentioned small subclass contains partially commutative Shephard groups. We show that these groups embed into Coxeter groups as finite index subgroups, thus establishing the linearity of these gr…
Permawound Unipotent Groups
该研究引入永久缠绕幂幺群，利用其“普遍存在性”和“刚性”性质，证明有限生成域上非分裂光滑幂幺群一阶上同调无限，还表明特定域上交换p - 挠缠绕幂幺群是交换伪约化群的最大幂幺商，部分解答了托塔罗的问题。
On a class of poly-context-free groups generated by automata
本文研究树自动机群及其推广，通过引入可约自动机群类证明其作为多上下文无关群直极限的结构定理，并证明至少含两个生成元的树自动机群非有限生成且为顺从群。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。