English
Related papers

Related papers: Classifying complements for groups. Applications

200 papers

A morphism of linear algebraic groups $\phi:K\rightarrow G$ is called an epimorphism if it admits right cancellation. A subgroup $H\leq G$ is epimorphic if the inclusion map is an epimorphism. For $G$ a simple algebraic group over an…

Group Theory · Mathematics 2025-05-05 Donna M. Testerman , Adam R. Thomas

According to Comfort, Raczkowski and Trigos-Arrieta, a dense subgroup D of a compact abelian group G determines G if the restriction homomorphism G^ --> D^ of the dual groups is a topological isomorphism. We introduce four conditions on D…

General Topology · Mathematics 2016-03-25 Dikran Dikranjan , Dmitri Shakhmatov

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…

Geometric Topology · Mathematics 2009-09-25 R. A. Litherland

A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…

Combinatorics · Mathematics 2021-02-23 Junyang Zhang , Sanming Zhou

A description of a ring of functions on the base of a universal formal deformation for several moduli problems is given. The answer is given in terms of a homology group of a certain dg Lie algebra canonically (up to an essentially unique…

alg-geom · Mathematics 2008-02-03 Vladimir Hinich , Vadim Schechtman

Homotopic morphisms of $\mathbb E$-triangles in extriangulated categories are introduced. Any morphism of $\mathbb E$-triangles is a composition of homotopic morphisms. Any morphism $(\alpha_1, \alpha_2, \alpha_3)$ of $\mathbb E$-triangles…

Category Theory · Mathematics 2026-04-27 Chencheng Zhang , Xue-Song Lu , Pu Zhang

We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…

Group Theory · Mathematics 2007-05-23 Daniel Matei , Alexander I. Suciu

In group representations several inductions given by tensoring with appropriate bimodules may be reconstructed via homology of $G$-posets with $G$-equivariant coefficients. For this purpose, we need various local categories of a finite…

Representation Theory · Mathematics 2018-10-23 Fei Xu

A subgroup $H$ of a finite group $G$ is submodular in $G$ if there is a subgroup chain $H=H_0\leq\ldots\leq H_i\leq H_{i+1}\leq \ldots \leq H_n=G$ such that $H_i$ is a modular subgroup of $H_{i+1}$ for every $i$. We investigate finite…

Group Theory · Mathematics 2023-07-31 Victor S. Monakhov , Irina L. Sokhor

It is well known [Lov\'asz, 67] that up to isomorphism a graph~$G$ is determined by the homomorphism counts $\hom(F, G)$, i.e., the number of homomorphisms from $F$ to $G$, where $F$ ranges over all graphs. Thus, in principle, we can answer…

Computational Complexity · Computer Science 2023-04-21 Yijia Chen , Jörg Flum , Mingjun Liu , Zhiyang Xun

Representation learning seeks meaningful sensory representations without supervision and can model aspects of human development. Although many neural networks empirically learn useful features, a principled account of what makes a…

Machine Learning · Computer Science 2026-05-07 Takayuki Komatsu , Yoshiyuki Ohmura , Yasuo Kuniyoshi

Let $G$ be a finite group and $A$ be a normal subgroup of $G$. We denote by $ncc(A)$ the number of $G$-conjugacy classes of $A$ and $A$ is called $n$-decomposable, if $ncc(A)=n$. Set ${\cal K}_G = \{ncc(A)| A \lhd G \}$. Let $X$ be a…

Group Theory · Mathematics 2007-08-07 Ali Reza Ashrafi , Geetha Venkataraman

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

Computational Complexity · Computer Science 2013-09-17 John Faben , Mark Jerrum

We characterize the groups isomorphic to full automorphism groups of ordered abelian groups. The result will follow from classical theorems on ordered groups adding an argument from proofs used to realize rings as endomorphism rings of…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

A Hom-group G is a nonassociative version of a group where associativity, invertibility, and unitality are twisted by a map \alpha: G\longrightarrow G. Introducing the Hom-group algebra KG, we observe that Hom-groups are providing examples…

Group Theory · Mathematics 2018-03-28 Mohammad Hassanzadeh

A notion of stratification is introduced for any compactly generated triangulated category T endowed with an action of a graded commutative noetherian ring R. The utility of this notion is demonstrated by establishing diverse consequences…

Category Theory · Mathematics 2014-02-26 Dave Benson , Srikanth B. Iyengar , Henning Krause

Every countable group $G$ can be embedded in a finitely generated group $G^*$ that is hopfian and complete, i.e. $G^*$ has trivial centre and every epimorphism $G^*\to G^*$ is an inner automorphism. Every finite subgroup of $G^*$ is…

Group Theory · Mathematics 2024-11-20 Martin R. Bridson , Hamish Short

The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of…

Combinatorics · Mathematics 2021-02-12 Domingos M. Cardoso , Helena Gomes , Sofia J. Pinheiro

Let G be a group and H a subgroup of G of finite index. In this article, it is proved that if the number of isomorphism classes of right transversals of H in G is 5, then the index of H in G is 6 and the permutation representation of G on…

Group Theory · Mathematics 2024-01-09 Vivek Kumar Jain , Raja Rawat

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Combinatorics · Mathematics 2021-12-07 G. Arunkumar , Peter J. Cameron , Rajat Kanti Nath , Lavanya Selvaganesh