中文
相关论文

相关论文: Splittings and poly-freeness of triangle Artin gro…

200 篇论文

We show that a triangle Artin group $\text{Art}_{MNP}$ where $M\leq N\leq P$ splits as an amalgamated product or an HNN extension of finite rank free groups, provided that either $M>2$, or $N>3$. We also prove that all even three generator…

群论 · 数学 2021-03-03 Kasia Jankiewicz

We prove that any large even Artin group is poly-free and that any even Artin group based on a triangle graph is also poly-free.

群论 · 数学 2020-09-21 Ruben Blasco-Garcia

We show that every right-angled Artin group AG defined by a graph G of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of G. Further, a characterization of all…

群论 · 数学 2007-05-23 Susan Hermiller , Zoran Sunik

We find a condition on the underlying graph of an Artin group that fully determines if it is subgroup separable. As a consequence, an Artin group is subgroup separable if and only if it can be obtained from Artin groups of ranks at most 2…

群论 · 数学 2021-05-10 Kisnney Almeida , Igor Lima

We show that a right-angled Artin group, defined by a graph $\Gamma$ that has at least three vertices, does not split over an infinite cyclic subgroup if and only if $\Gamma$ is biconnected. Further, we compute JSJ--decompositions of…

群论 · 数学 2014-08-04 Matt Clay

We prove that an Artin group splits over infinite cyclic subgroups if and only if its defining graph has a separating vertex, and explicitly construct a JSJ decomposition over infinite cyclic subgroups for all Artin groups. We then use…

群论 · 数学 2025-09-01 Oli Jones , Giorgio Mangioni , Giovanni Sartori

We provide two simple proofs of the fact that even Artin groups of FC-type are poly-free which was recently established by R. Blasco-Garcia, C. Mart\'inez-P\'erez and L. Paris. More generally, let $\Gamma$ be a finite simplicial graph with…

群论 · 数学 2021-08-17 Xiaolei Wu

We show that many $2$-dimensional Artin groups are residually finite. This includes $3$-generator Artin groups with labels $\geq 4$ except for $(2m+1, 4,4)$ for any $m\geq 2$. As a first step towards residual finiteness we show that these…

群论 · 数学 2022-05-10 Kasia Jankiewicz

We generalize to (certain) Artin groups some results previously known for right-angled Artin groups (RAAGs). First, we generalize a result by Droms, B. Servatius, and H. Servatius, and prove that the derived subgroup of an Artin group is…

In this article, we characterise geometrically when a right-angled Artin group splits over an abelian subgroup. More precisely, given a finite graph $\Gamma$, we show that $A(\Gamma)$ splits over an abelian subgroup if and only if it is…

群论 · 数学 2026-03-27 Oussama Bensaid , Anthony Genevois , Romain Tessera

We prove that triangle Artin groups of the type $A_{2,3,2n}$ are residually finite for all $n\geq4$. This requires splitting these triangle Artin groups as graphs of groups and then proving that each of these graphs of groups has finite…

群论 · 数学 2024-12-11 Greyson Meyer

We study Artin kernels, i.e. kernels of discrete characters of right-angled Artin groups, and we show that they decompose as graphs of groups in a way that can be explicitly computed from the underlying graph. When the underlying graph is…

群论 · 数学 2024-05-03 Danielle Barquinero , Lorenzo Ruffoni , Kaidi Ye

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

几何拓扑 · 数学 2010-06-24 Jee Hyoun Kim , Ki Hyoung Ko , Hyo Won Park

Paul Erd\H{o}s suggested the following problem: Determine or estimate the number of maximal triangle-free graphs on $n$ vertices. Here we show that the number of maximal triangle-free graphs is at most $2^{n^2/8+o(n^2)}$, which matches the…

组合数学 · 数学 2014-09-30 József Balogh , Šárka Petříčková

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

群论 · 数学 2023-09-15 Daniel Berlyne

We prove that even Artin groups of FC type are poly-free and residually finite.

群论 · 数学 2017-05-17 Ruben Blasco-Garcia , Conchita Martinez-Perez , Luis Paris

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

群论 · 数学 2026-05-27 Kanéda Blot , Ville Salo

Recently, settling a question of Erd\H{o}s, Balogh and Pet\v{r}\'{i}\v{c}kov\'{a} showed that there are at most $2^{n^2/8+o(n^2)}$ $n$-vertex maximal triangle-free graphs, matching the previously known lower bound. Here we characterize the…

组合数学 · 数学 2016-08-07 József Balogh , Hong Liu , Šárka Petříčková , Maryam Sharifzadeh

We give necessary and sufficient conditions on the graph of a right-angled Artin group that determine whether the group is subgroup separable or not. Moreover, we investigate the profinite topology of the direct product of two free groups.…

群论 · 数学 2009-05-11 V. Metaftsis , E. Raptis

Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…

组合数学 · 数学 2020-07-15 Wouter Cames van Batenburg , Jan Goedgebeur , Gwenaël Joret
‹ 上一页 1 2 3 10 下一页 ›