English
Related papers

Related papers: Local commensurability graphs of solvable groups

200 papers

For a fixed integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with adjacency defined by a single elementary transfer of a cell in the Ferrers diagram. In a previous paper, the clique complex $K_n =…

General Mathematics · Mathematics 2026-04-02 Fedor B. Lyudogovskiy

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…

Combinatorics · Mathematics 2015-07-28 Pablo Candela , Balázs Szegedy , Lluís Vena

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

Computational Complexity · Computer Science 2017-10-17 Mikhail Tikhomirov

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. Define then the character degree graph $\Delta(G)$ as the (simple undirected) graph whose vertices are the prime…

Group Theory · Mathematics 2022-09-16 Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…

Combinatorics · Mathematics 2025-08-15 Peter Dankelmann , Sonwabile Mafunda , Sufiyan Mallu

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local…

Group Theory · Mathematics 2016-10-13 Federico Berlai , Michal Ferov

The nonsoluble length $\lambda(G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series of $G$ each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The…

Group Theory · Mathematics 2015-01-15 Eloisa Detomi , Pavel Shumyatsky

We prove the definability, and actually the finiteness of the commutator width, of many commutator subgroups in groups definable in o-minimal structures. It applies in particular to derived series and to lower central series of solvable…

Logic · Mathematics 2010-06-02 E. Baro , E. Jaligot , M. Otero

Let $A$ and $A'$ be two Artin groups of spherical type, and let $A_1,\dots,A_p$ (resp. $A'_1,\dots,A'_q$) be the irreducible components of $A$ (resp. $A'$). We show that $A$ and $A'$ are commensurable if and only if $p=q$ and, up to…

Group Theory · Mathematics 2020-11-11 María Cumplido , Luis Paris

A discrete subgroup $\Gamma$ of a locally compact group $H$ is called a uniform lattice if the quotient $H/\Gamma$ is compact. Such an $H$ is called an envelope of $\Gamma$. In this paper we study the problem of classifying envelopes of…

Group Theory · Mathematics 2014-04-22 Tullia Dymarz

We prove that the outer automorphism group $Out(G)$ is residually finite when the group $G$ is virtually compact special (in the sense of Haglund and Wise) or when $G$ is isomorphic to the fundamental group of some compact $3$-manifold. To…

Group Theory · Mathematics 2017-03-22 Yago Antolin , Ashot Minasyan , Alessandro Sisto

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

Group Theory · Mathematics 2018-11-06 Zeinab Akhlaghi , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

A subgroup $\Delta\leq \Gamma$ is commensurated if $|\Delta:\Delta\cap \gamma\Delta\gamma^{-1}|<\infty$ for all $\gamma\in \Gamma$. We show a finitely generated branch group is just infinite if and only if every commensurated subgroup is…

Group Theory · Mathematics 2016-07-27 Phillip Wesolek

We use assembly maps to study $\mathbf{TC}(\mathbb{A}[G];p)$, the topological cyclic homology at a prime $p$ of the group algebra of a discrete group $G$ with coefficients in a connective ring spectrum $\mathbb{A}$. For any finite group, we…

K-Theory and Homology · Mathematics 2019-10-02 Wolfgang Lueck , Holger Reich , John Rognes , Marco Varisco

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Logic in Computer Science · Computer Science 2023-11-28 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz , Szymon Toruńczyk

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Combinatorics · Mathematics 2022-10-26 Ziyu Huang , Thomas Michael Keller , Shane Kissinger , Wen Plotnick , Maya Roma

We study model geometries of finitely generated groups. If a finitely generated group does not contain a non-trivial finite rank free abelian commensurated subgroup, we show any model geometry is dominated by either a symmetric space of…

Group Theory · Mathematics 2024-09-06 Alex Margolis

Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…

Representation Theory · Mathematics 2019-01-14 Donnie Munyao Kasyoki , Paul Odhiambo Oleche

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

Group Theory · Mathematics 2018-09-28 Zeinab Akhlaghi , Carlo Casolo , Silvio Dolfi , Emanuele Pacifici , Lucia Sanus

The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph's metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This…

Combinatorics · Mathematics 2023-11-07 Amal S. Alali , Shahbaz Ali , Muhammad Adnan , Delfim F. M. Torres