Related papers: The intersection of subgroups in free groups and l…

A perfect code in a graph $\Gamma$ is a subset $C$ of $V(\Gamma)$ such that no two vertices in $C$ are adjacent and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in $C$. Let $G$ be a finite group and $C$ a subset…

Let $F$ be any finite-rank free group, and $R$ be any finite subset of $\{g, [g]: g \in F-\{1\}\}$, where $[g]:= \{fgf^{-1}:f\in F\}$. By an $R$-allocating $F$-factorization we mean a set $\mathcal{H}$ of nontrivial subgroups of $F$ such…

We show that, if $H$ is a random subgroup of a finitely generated free group $F_k$, only inner automorphisms of $F_k$ may leave $H$ invariant. A similar result holds for random subgroups of toral relatively hyperbolic groups, more generally…

A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $\alpha'(H)$ of $H$ is the size of a maximum matching in $H$. A subset $D$ of vertices of $H$ is a dominating set of $H$ if for every $v\in…

The main result of this paper is that given a group $G$ acting geometrically by isometries on a CAT(0) space $X$ and a cyclic subgroup $H$ of $G$ generated by a rank-1 isometry of $X$, $H$ has bounded packing in $G$. We give two proofs of…

In order to enumerate the fake projective planes, as announced in~\cite{CS}, we found explicit generators and a presentation for each maximal arithmetic subgroup $\bar\Gamma$ of~$PU(2,1)$ for which the (appropriately normalized) covolume…

The covering number of a nontrivial finite group $G$, denoted $\sigma(G)$, is the smallest number of proper subgroups of $G$ whose set-theoretic union equals $G$. In this article, we focus on a dual problem to that of covering numbers of…

We show that the intersection of three subgroups in a free group is related to the computation of the third homotopy group $\pi_3$. This generalizes a result of Gutierrez-Ratcliffe who relate the intersection of two subgroups with the…

The aim of this paper is to study the intersection hypergraph $\tilde{\Gamma}_\mathcal{H}(\mathbb{Z}_n)$ and co-maximal hypergraph $Co_\mathcal{H}(\mathbb{Z}_n)$ on the subgroups of $\mathbb{Z}_n$. We prove that the intersection and…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…

We investigate the minimum distance of the error correcting code formed by the homomorphisms between two finite groups $G$ and $H$. We prove some general structural results on how the distance behaves with respect to natural group…

Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, which can be modeled as a temporal bipartite graph. However, the…

We study the critical exponents of discrete subgroups of a higher rank semi-simple real linear Lie group $G$. Let us fix a Cartan subspace $\mathfrak a\subset \mathfrak g$ of the Lie algebra of $G$. We show that if $\Gamma< G$ is a discrete…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

In this paper, we obtain several results on the commensurability of two Kleinian groups and their limit sets. We prove that two finitely generated subgroups $G_1$ and $G_2$ of an infinite co-volume Kleinian group $G \subset…

Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…

Let $H$, $T$ and $C_n$ be a graph, a tree and a cycle of order $n$, respectively. Let $H^{(i)}$ be the complete join of $H$ and an empty graph on $i$ vertices. Then the Cartesian product $H\Box T$ of $H$ and $T$ can be obtained by applying…

Let G be an acylindrically hyperbolic group. We consider a random subgroup H in G, generated by a finite collection of independent random walks. We show that, with asymptotic probability one, such a random subgroup H of G is a free group,…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…