中文
相关论文

相关论文: The Andrews-Curtis Conjecture and Black Box Groups

200 篇论文

Let S be a surface and let Mod(S,K) be the mapping class group of S permuting a Cantor subset K of S. We prove two structure theorems for normal subgroups of Mod(S,K). (Purity:) if S has finite type, every normal subgroup of Mod(S,K) either…

几何拓扑 · 数学 2022-01-12 Danny Calegari , Lvzhou Chen

There are two main constructions of supercharacter theories for a group $ G $. The first, defined by Diaconis and Isaacs, comes from the action of a group $A$ via automorphisms on our given group $G$. The second, defined by Hendrickson, is…

环与代数 · 数学 2015-03-11 Farid Aliniaeifard

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

群论 · 数学 2019-08-07 Anthony Genevois , Alexandre Martin

We examine distortion of finitely generated normal subgroups. We show a connection between subgroup distortion and group divergence. We suggest a method computing the distortion of normal subgroups by decomposing the whole group into…

群论 · 数学 2020-09-16 Hung Cong Tran

The stable Andrews-Curtis conjecture in combinatorial group theory is the statement that every balanced presentation of the trivial group can be simplified to the trivial form by elementary moves corresponding to "handle-slides" together…

几何拓扑 · 数学 2014-06-27 Selman Akbulut

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

群论 · 数学 2025-11-07 Angsuman Das , Arnab Mandal , Labani Sarkar

We consider vertices, a notion originating in local representation theory of finite groups, for the category $\mathcal{O}$ of a rational Cherednik algebra and prove the analogue of the Dipper-Du Conjecture for Hecke algebras of symmetric…

表示论 · 数学 2021-06-08 Emily Norton

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

概率论 · 数学 2023-05-10 Kiril Bangachev , Guy Bresler

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

组合数学 · 数学 2012-06-29 Derrick Stolee

The Surface Group Conjectures are statements about recognising surface groups among one-relator groups, using either the structure of their finite-index subgroups, or all subgroups. We resolve these conjectures in the two generator case.…

群论 · 数学 2022-08-10 Giles Gardam , Dawid Kielak , Alan D. Logan

The conjecture of Brown, Erd\H{o}s and S\'os from 1973 states that, for any $k \ge 3$, if a $3$-uniform hypergraph $H$ with $n$ vertices does not contain a set of $k+3$ vertices spanning at least $k$ edges then it has $o(n^2)$ edges. The…

组合数学 · 数学 2019-05-07 Rajko Nenadov , Benny Sudakov , Mykhaylo Tyomkyn

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…

Let A denote the algebraic closure of the rationals Q in the complex numbers C. Suppose G is a torsion-free group which contains a congruence subgroup as a normal subgroup of finite index and denote by U(G) the C-algebra of closed densely…

环与代数 · 数学 2007-05-23 Daniel R. Farkas , Peter A. Linnell

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

群论 · 数学 2016-10-26 Jack Button , Maurice Chiodo , Mariano Zeron-Medina Laris

We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…

统计力学 · 物理学 2009-11-07 Jesper Dall , Michael Christensen

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…

群论 · 数学 2013-01-21 Mathieu Carette

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

群论 · 数学 2017-05-17 Michael W. Davis , Matthew Kahle

We prove the Farrell-Jones Isomorphism Conjecture about the algebraic K-theory of a group ring RG in the case where the group G is the fundamental group of a closed Riemannian manifold with strictly negative sectional curvature. The…

代数拓扑 · 数学 2007-05-23 A. Bartels , H. Reich

The Tits Conjecture, proved by Crisp and Paris, states that squares of the standard generators of any Artin group generate an obvious right-angled Artin subgroup. We consider a larger set of elements consisting of all the centers of the…

群论 · 数学 2022-01-19 Kasia Jankiewicz , Kevin Schreve

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

历史与综述 · 数学 2024-07-18 Sergey Kurapov , Maxim Davidovsky