English
Related papers

Related papers: On $k$-geodetic graphs and groups

200 papers

A finite group is called $\psi$-divisible iff $\psi(H)|\psi(G)$ for any subgroup $H$ of a finite group $G$. Here, $\psi(G)$ is the sum of element orders of $G$. For now, the only known examples of such groups are the cyclic ones of…

Group Theory · Mathematics 2022-03-02 Mihai-Silviu Lazorec

We examine closed geodesics in the quotient of hyperbolic three space by the discrete group of isometries SL(2,Z[i]). There is a correspondence between closed geodesics in the manifold, the complex continued fractions originally studied by…

Number Theory · Mathematics 2019-07-09 Katie McKeon

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Combinatorics · Mathematics 2022-10-28 Yanan Hu , Xingzhi Zhan , Leilei Zhang

The 'contracting boundary' of a proper geodesic metric space consists of equivalence classes of geodesic rays that behave like rays in a hyperbolic space. We introduce a geometrically relevant, quasi-isometry invariant topology on the…

Metric Geometry · Mathematics 2019-08-21 Christopher H. Cashen , John M. Mackay

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Group Theory · Mathematics 2024-02-12 David G. Costanzo , Mark L. Lewis , Stefano Schmidt , Eyob Tsegaye , Gabe Udell

Let G be a finitely presented group, and G' its commutator subgroup. Let C be the Cayley graph of G' with all commutators in G as generators. Then C is large scale simply connected. Furthermore, if G is a torsion-free nonelementary…

Group Theory · Mathematics 2014-10-01 Danny Calegari , Dongping Zhuang

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

A connected linear algebraic group G is called a Cayley group if the Lie algebra of G endowed with the adjoint G-action and the group variety of G endowed with the conjugation G-action are birationally G-isomorphic. In particular, the…

Algebraic Geometry · Mathematics 2009-07-06 Nicole Lemire , Vladimir L. Popov , Zinovy Reichstein

k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theory of the fundamental groupoid of a k-graph, and relate it…

Combinatorics · Mathematics 2007-05-23 David Pask , John Quigg , Iain Raeburn

In a graph $G$, a geodesic between two vertices $x$ and $y$ is a shortest path connecting $x$ to $y$. A subset $S$ of the vertices of $G$ is in general position if no vertex of $S$ lies on any geodesic between two other vertices of $S$. The…

Combinatorics · Mathematics 2019-07-23 Balázs Patkós

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette

The $k$-dominating graph $D_k(G)$ of a graph $G$ is defined on the vertex set consisting of dominating sets of $G$ with cardinality at most $k$, two such sets being adjacent if they differ by either adding or deleting a single vertex. A…

Combinatorics · Mathematics 2016-04-26 Saeid Alikhani , Davood Fatehi , Sandi Klavžar

Given a graph $G = (V,E)$, a set $S \subset V$ is called a $k$-\emph{metric generator} for $G$ if any pair of different vertices of $G$ is distinguished by at least $k$ elements of $S$. A graph is $k$-\emph{metric dimensional} if $k$ is the…

Combinatorics · Mathematics 2019-03-29 Samuel G. Corregidor , Álvaro Martínez-Pérez

Let $A$ be a finite dimensional $Q-$algebra and $\Gamma subset A$ a $Z-$order. We classify those $A$ with the property that $Z^2$ does not embed in $\mathcal{U}(\Gamma)$. We call this last property the hyperbolic property. We apply this in…

Rings and Algebras · Mathematics 2007-11-21 E. Iwaki , S. O. Juriaans , A. C. Souza Filho

The main theorem of this paper classifies the quasi-geodesics in a Coxeter group that are tracked by geodesics. As corollaries, we show that if a Coxeter group acts geometrically on a CAT(0) space X then CAT(0) rays (and lines) are tracked…

Group Theory · Mathematics 2014-02-26 Michael L. Mihalik , Steven Tschantz

A connected graph is called \emph{geodetic} if there is a unique shortest path between each pair of vertices. We introduce a systematic method for constructing new presentations of free products that give rise to previously unknown geodetic…

Group Theory · Mathematics 2025-12-18 Joshua Abraham , Murray Elder , Adam Piggott , Kane Townsend

We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…

Combinatorics · Mathematics 2007-05-23 Alina Vdovina

Let S be a finite graph and G be the corresponding free partially commutative group. In this paper we study subgroups generated by vertices of the graph S, which we call canonical parabolic subgroups. A natural extension of the definition…

Group Theory · Mathematics 2007-05-23 A. J. Duncan , I. V. Kazachkov , V. N. Remeslennikov

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

Combinatorics · Mathematics 2011-11-29 Ebrahim Ghaderpour , Dave Witte Morris

We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…

Group Theory · Mathematics 2007-05-23 David B. A. Epstein , Derek F. Holt