中文
相关论文

相关论文: Poly-free constructions for right-angled Artin gro…

200 篇论文

Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number $\chi$ contains a rainbow independent set of size $\lceil\frac12\chi\rceil$. This is sharp up to a factor…

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

In this note we prove that the affine Artin group of type $\widetilde B_n$ is virtually poly-free. The proof also gives another solution of the $K(\pi, 1)$ problem for $\widetilde B_n$.

群论 · 数学 2025-10-31 Li Li , S. K. Roushon

If $G$ is a graph and $\mathcal{H}$ is a set of subgraphs of $G$, we say that an edge-coloring of $G$ is $\mathcal{H}$-polychromatic if every graph from $\mathcal{H}$ gets all colors present in $G$ on its edges. The…

组合数学 · 数学 2020-09-21 John Goldwasser , Ryan Hansen

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

A graph is unichord free if it does not contain a cycle with exactly one chord as its subgraph. In [3], it is shown that a graph is unichord free if and only if every minimal vertex separator is a stable set. In this paper, we first show…

离散数学 · 计算机科学 2014-10-27 Mahati Kumar , S. Manasvini , N. Sadagopan , Adithya Seshadri

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 consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group $A(K)$ has such a subgroup if its defining graph $K$ contains an $n$-hole (i.e. an induced…

群论 · 数学 2011-11-10 John Crisp , Michah Sageev , Mark Sapir

We prove that every non-finitely generated projective module over the integral group ring of a polycyclic-by-finite group G is free if and only if G is polycyclic.

环与代数 · 数学 2007-05-23 Peter A. Linnell , Gena Puninski , Patrick F. Smith

We develop a new criterion to tell if a group $G$ has the maximal gap of $1/2$ in stable commutator length (scl). For amalgamated free products $G = A \star_C B$ we show that every element $g$ in the commutator subgroup of $G$ which does…

几何拓扑 · 数学 2018-09-17 Nicolaus Heuer

Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…

几何拓扑 · 数学 2023-08-25 Takuya Katayama , Erika Kuno

A class of graphs is $\chi$-bounded if there is a function $f$ such that every graph $G$ in the class has chromatic number at most $f(\omega(G))$, where $\omega(G)$ is the clique number of $G$; the class is polynomially $\chi$-bounded if…

组合数学 · 数学 2023-03-24 Maria Chudnovsky , Alex Scott , Paul Seymour , Sophie Spirkl

We extend previous results by Cumplido, Martin and Vaskou on parabolic subgroups of large-type Artin groups to a broader family of two-dimensional Artin groups. In particular, we prove that an arbitrary intersection of parabolic subgroups…

群论 · 数学 2022-05-26 Martin Axel Blufstein

Many NP-complete graph problems are polynomial-time solvable on graph classes of bounded clique-width. Several of these problems are polynomial-time solvable on a hereditary graph class ${\cal G}$ if they are so on the atoms (graphs with no…

离散数学 · 计算机科学 2026-02-19 Konrad K. Dabrowski , Tomáš Masařík , Jana Novotná , Daniël Paulusma , Paweł Rzążewski

Let $G$ be a finitely generated polyfree group. If $G$ has nonzero Euler characteristic then we show that $Aut(G)$ has a finite index subgroup in which every automorphism has infinite Reidemeister number. For certain $G$ of length 2, we…

群论 · 数学 2015-03-13 Alexander Fel'shtyn , Daciberg Gonçalves , Peter Wong

In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that…

群论 · 数学 2007-05-23 Thomas Brady , Jonathan P. McCammond

We prove that every subnormal subgroup of p-power index in a right-angled Artin group is conjugacy p-separable. As an application, we prove that every right-angled Artin group is conjugacy separable in the class of torsion-free nilpotent…

群论 · 数学 2013-03-05 Emmanuel Toinet

A hole is a chordless cycle with at least four vertices. A pan is a graph which consists of a hole and a single vertex with precisely one neighbor on the hole. An even hole is a hole with an even number of vertices. We prove that a (pan,…

离散数学 · 计算机科学 2017-03-01 Kathie Cameron , Steven Chaplick , Chinh T. Hoang

For a finite group $G$, let $\Delta(G)$ denote the character graph built on the set of degrees of the irreducible complex characters of $G$. In graph theory, a perfect graph is a graph $\Gamma$ in which the chromatic number of every induced…

群论 · 数学 2023-06-22 Mahdi Ebrahimi

Recent research of the author has given an explicit geometric description of free (two-sided) adequate semigroups and monoids, as sets of labelled directed trees under a natural combinatorial multiplication. In this paper we show that there…

环与代数 · 数学 2009-05-08 Mark Kambites