English
Related papers

Related papers: On locally compact semitopological graph inverse s…

200 papers

In this paper we introduce an inverse semigroup $\mathcal{S}(E,C)$ associated to a separated graph $(E,C)$ and describe its internal structure. In particular we show that it is strongly $E^*$-unitary and can be realized as a partial…

Operator Algebras · Mathematics 2025-06-03 Pere Ara , Alcides Buss , Ado Dalla Costa

Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…

Geometric Topology · Mathematics 2026-01-09 Rachmiel Klein

We further investigate the weak topology generated by the irreducible unitary representations of a group $G$. A deep result due to Ernest \cite{Ernest1971} and Hughes \cite{Hughes1973} asserts that every weakly compact subset of a locally…

General Topology · Mathematics 2021-03-25 María V. Ferrer , Salvador Hernández

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

Combinatorics · Mathematics 2015-10-14 Mohammad Farrokhi Derakhshandeh Ghouchan , Mehdi Rajabian , Ahmad Erfanian

We show that every abstract homomorphism $\varphi$ from a locally compact group $L$ to a graph product $G_\Gamma$, endowed with the discrete topology, is either continuous or $\varphi(L)$ lies in a 'small' parabolic subgroup. In particular,…

Group Theory · Mathematics 2019-08-14 Linus Kramer , Olga Varghese

We develop a homotopy theory of directed graphs based on cubical homotopy groups, also referred to as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups…

Algebraic Topology · Mathematics 2026-05-07 Briony Eldridge , Sergei O. Ivanov , Xiaomeng Xu , Shing-Tung Yau , Mengmeng Zhang

Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…

Combinatorics · Mathematics 2015-06-09 Tien Chih , Demitri Plessas

We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…

Combinatorics · Mathematics 2010-10-29 Alice Devillers , Michael Giudici , Cai Heng Li , Cheryl E. Praeger

Let $G$ be the fundamental group of a finite graph of groups with Noetherian edges and locally tame vertices. We prove that $G$ is locally tame. It follows that if a finitely presented group $H$ has a non-trivial $JSJ$-decomposition over…

Group Theory · Mathematics 2018-09-06 Rita Gitik

Given a class $\mathfrak F$ of finite groups, we consider the graph $\widetilde\Gamma_{\mathfrak F}(G)$ whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h\rangle\notin\mathfrak…

Group Theory · Mathematics 2021-09-10 Andrea Lucchini , Daniele Nemmi

A graph is locally chordal if each of its small-radius balls is chordal. In an earlier work [AKK25], the authors and Kobler proved that locally chordal graphs can be characterized by having chordal local covers, by forbidding short cycles…

Combinatorics · Mathematics 2025-12-23 Tara Abrishami , Paul Knappe

For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…

Group Theory · Mathematics 2025-11-17 K. Auinger , J. Bitterlich , M. Otto

We initiate the study of the $p$-local commensurability graph of a group, where $p$ is a prime. This graph has vertices consisting of all finite-index subgroups of a group, where an edge is drawn between $A$ and $B$ if $[A : A\cap B]$ and…

Group Theory · Mathematics 2015-08-27 Khalid Bou-Rabee , Daniel Studenmund

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

Combinatorics · Mathematics 2011-01-13 Matthias Hamann

We consider a version of the notion of F-inverse semigroup (studied in the algebraic theory of inverse semigroups). We point out that an action of such an inverse semigroup on a locally compact space has associated a natural groupoid…

funct-an · Mathematics 2008-02-03 Alexandru Nica

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

Group Theory · Mathematics 2016-12-15 Adeleh Abdolghafourian , Mohammad A. Iranmanesh , Alice C. Niemeyer

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Dynamical Systems · Mathematics 2018-10-08 Toke Meier Carlsen , Marius Lie Winger

In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…

Combinatorics · Mathematics 2024-12-02 Siddharth Malviy , Vipul Kakkar

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

Combinatorics · Mathematics 2012-06-27 David Galvin

The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…

Combinatorics · Mathematics 2025-09-09 Tito Augusto Cuchilla , Joseph Hound , Cole Plepel , Andrés R. Vindas-Meléndez , Louis Ye