相关论文: Combinations of parabolically geometrically finite…

In this article, we consider qualified notions of geometric finiteness in mapping class groups called parabolically geometrically finite (PGF) and reducibly geometrically finite (RGF). We examine several constructions of subgroups and…

We construct a new family of examples of parabolically geometrically finite subgroups of the mapping class group in the sense of Dowdall-Durham-Leininger-Sisto and prove they are undistorted in Mod($S$).

We prove combination theorems in the spirit of Klein and Maskit in the context of discrete convergence groups acting geometrically finitely on their limit sets. As special cases, we obtain combination theorems for geometrically finite…

A G-gain graph is a graph whose oriented edges are labeled invertibly from a group G. Zaslavsky proposed two matroids of G-gain graphs, called frame matroids and lift matroids, and investigated linear representations of them. Each matroid…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

In this note we construct a "restriction" map from the cocenter of a reductive group G over a local non-archimedean field F to the cocenter of a Levi subgroup. We show that the dual map corresponds to parabolic induction and deduce that…

In this article, we study acylindrical graphs of groups, local quasiconvexity, and Cannon-Thurston maps in the setting of totally disconnected locally compact (TDLC) hyperbolic groups, extending several fundamental notions and results from…

We establish a combination theorem for parafree groups. These groups were introduced by Baumslag in the sixties. One of the current motivations for a better understanding of their structure is that they show up naturally in connection with…

In this paper, we prove a combination theorem for a relatively acylindrical graph of relatively hyperbolic groups (Theorem 1.1). Here, we are extending the technique of [Tom21] and constructing Bowditch boundary of the fundamental group of…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Parabolic cut pairs in the boundaries of relatively hyperbolic group are a new and previously unexplored phenomenon. In this paper, we give a way to create examples of relatively hyperbolic groups with parabolic cut pairs on their boundary…

The aim of this article is to give a survey of combination theorems occurring in hyperbolic geometry, geometric group theory and complex dynamics, with a particular focus on Thurston's contribution and influence in the field.

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

Finite symmetries abound in particle physics, from the weak doublets and generation triplets to the baryon octet and many others. These are usually studied by starting from a Lie group, and breaking the symmetry by choosing a particular…

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

We introduce a new approach to representation theory of finite groups that uses some basic algebraic geometry and allows to do all the theory without using characters. With this approach, to any finite group $G$ we associate a finite number…

We study polynomial group convolutional neural networks (PGCNNs) for an arbitrary finite group $G$. In particular, we introduce a new mathematical framework for PGCNNs using the language of graded group algebras. This framework yields two…