中文
相关论文

相关论文: Expanders, rank and graphs of groups

200 篇论文

It was recently shown that gl^(1|1) admits an infinite family of simple current extensions. Here, these findings are reviewed and explicit free field realisations of the extended algebras are constructed. The leading contributions to the…

高能物理 - 理论 · 物理学 2011-11-23 Thomas Creutzig , David Ridout

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

算子代数 · 数学 2007-05-23 Alex Kumjian , David Pask

An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…

群论 · 数学 2014-09-12 Mikhail I. Ostrovskii , David Rosenthal

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

群论 · 数学 2020-05-01 Andrea Lucchini

The subdirect product of two finite groups $A$ and $B$ is defined as a subgroup of the direct product $A \times B$, which is a well-known notion in finite group theory. While it is clear that, under appropriate choices of sets of generators…

组合数学 · 数学 2026-03-31 Yanga Bavuma , Francesco G. Russo , Stefano Spessato

In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…

组合数学 · 数学 2021-01-13 Federico Vigolo

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

组合数学 · 数学 2009-10-30 Reinhard Diestel , Philipp Sprüssel

We prove the following theorem: Let $\pi$ be the fundamental group of a finite graph of groups with finitely generated vertex groups $G_v$ having asdim $G_v\le n$ for all vertices $v$. Then asdim$\pi\le n+1$. This gives the best possible…

群论 · 数学 2007-05-23 G. Bell , A. Dranishnikov

We prove that for a finitely generated group G with a free factor system and an injective endomorphism that preserves the free factor system, the ascending HNN extension of G is hyperbolic relative to a collection of maximal parabolic…

群论 · 数学 2024-12-12 Swathi Krishna

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…

群论 · 数学 2011-05-30 Kei Nakamura

Given a group $G = H_1 \ast_A H_2$ which is the free product of two finitely generated groups $H_1$ and $H_2$ with amalgamation over a cyclic subgroup $A$ which is malnormal in $G$, we study relations between the structure of its subgroups…

群论 · 数学 2026-03-18 Martin Kreuzer , Anja Moldenhauer , Gerhard Rosenberger

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

群论 · 数学 2020-06-23 Cristina Acciarri , Andrea Lucchini

In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has…

群论 · 数学 2011-12-09 Mustafa Gokhan Benli

Let $\mathbb{E}$ be the HNN-extension of a group $B$ with subgroups $H$ and $K$ associated according to an isomorphism $\varphi\colon H \to K$. Suppose that $H$ and $K$ are normal in $B$ and $(H \cap K)\varphi = H \cap K$. Under these…

群论 · 数学 2025-05-05 E. V. Sokolov , E. A. Tumanova

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

群论 · 数学 2024-12-25 Koichi Oyakawa

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

组合数学 · 数学 2008-08-12 Benjamin Steinberg

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

组合数学 · 数学 2024-01-17 Martin Otto

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

群论 · 数学 2011-04-22 Eloisa Detomi , Andrea Lucchini
‹ 上一页 1 8 9 10 下一页 ›