English
Related papers

Related papers: Twin-width VII: groups

200 papers

We introduce merge-width, a family of graph parameters that unifies several structural graph measures, including treewidth, degeneracy, twin-width, clique-width, and generalized coloring numbers. Our parameters are based on new…

Combinatorics · Mathematics 2025-02-26 Jan Dreier , Szymon Toruńczyk

In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and power graphs. In both cases we prove a polynomial relation between the treewidth of a graph in the family and…

Discrete Mathematics · Computer Science 2007-05-23 Erik D. Demaine , MohammadTaghi Hajiaghayi

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…

Group Theory · Mathematics 2015-03-13 Daniele D'Angeli , Emanuele Rodaro

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

Combinatorics · Mathematics 2025-09-03 Xiwang Cao

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

Combinatorics · Mathematics 2016-07-15 Jin-Xin Zhou

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Combinatorics · Mathematics 2024-06-11 Bartłomiej Bychawski

We study the existence of polynomial kernels, for parameterized problems without a polynomial kernel on general graphs, when restricted to graphs of bounded twin-width. Our main result is that a polynomial kernel for $k$-Dominating Set on…

Data Structures and Algorithms · Computer Science 2021-09-15 Édouard Bonnet , Eun Jung Kim , Amadeus Reinald , Stéphan Thomassé , Rémi Watrigant

We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…

Group Theory · Mathematics 2018-01-03 Olga Kharlampovich , Alexei Miasnikov , Pascal Weil

Fiber bundles over infinite fields with non-trivial ultra-norms are considered. For them geometric wrap groups are defined and investigated. Besides fields also Cayley-Dickson algebras over fields of characteristic not equal to two are…

Group Theory · Mathematics 2018-12-18 S. V. Ludkovsky

We prove that every class of graphs $\mathscr C$ that is monadically stable and has bounded twin-width can be transduced from some class with bounded sparse twin-width. This generalizes analogous results for classes of bounded linear…

Logic in Computer Science · Computer Science 2022-09-20 Jakub Gajarský , Michał Pilipczuk , Szymon Toruńczyk

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…

Combinatorics · Mathematics 2014-12-02 Xiwang Cao , Mei Lu , Daqing Wan , Li-Ping Wang , Qiang Wang

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no subgraph isomorphic to $H_1$ or $H_2$. We continue a recent study into the clique-width of $(H_1,H_2)$-free graphs and present three new classes of…

Discrete Mathematics · Computer Science 2015-01-14 Konrad K. Dabrowski , Shenwei Huang , Daniël Paulusma

The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…

Group Theory · Mathematics 2011-05-30 Kei Nakamura

We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy-Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite…

Classical Analysis and ODEs · Mathematics 2016-02-03 Javier Soria , Pedro Tradacete

We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex…

Group Theory · Mathematics 2019-02-07 Mauricio Gutierrez , Adam Piggott

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

Metric Geometry · Mathematics 2024-10-29 Or Kalifa

For a large class of groups, we exhibit an infinite-dimensional space of homogeneous quasimorphisms that are invariant under the action of the automorphism group. This class includes non-elementary hyperbolic groups, infinitely-ended…

Group Theory · Mathematics 2025-12-02 Francesco Fournier-Facio , Richard D. Wade

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

Group Theory · Mathematics 2024-01-10 Amandine Escalier , Camille Horbez

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic

In this paper, we introduce the t-graphs defined on finitely-generate groups. We study some general aspects of the t-graphs on 2-generator groups, emphasising establishing necessary conditions for their connectedness. In particular, we…

Group Theory · Mathematics 2022-02-01 G. Diaz-Porto , I. S. Gutierrez , A. Torres-Grandisson