Related papers: Maximal intersections in finite groups

We determine the structure of the intersection of a finitely generated subgroup of a semiabelian variety $G$ defined over a finite field with a closed subvariety $X\subset G$.

We show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing. We then use knowledge about intersections of conjugates to characterize finite families of…

Let $G$ be a connected graph on $n$ vertices. The Gallai number $Gal(G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$. Gr\"unbaum constructed a graph $G$ with $Gal(G)=3$. Very recently, Long,…

A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…

We investigate the ratio $\avM(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph $G$. If many maximal matchings have a size close to $\maxM(G)$, this graph invariant has a value close to 1.…

Let $G$ be a group and $S$ be the set of all non-trivial proper subgroups of $G$. The intersection hypergraph of $G$, denoted by $\tilde{\Gamma}_\mathcal{H}(G)$, is a hypergraph whose vertex set is $\{H \in S \,\, | \,\, H \cap K = \{e\}…

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…

This paper is a survey on the works [MS77, MS79, MS81] on maximal subgroups in finitely generated linear groups, and the works that followed it [GG08, GG13b, GG13a, Kap03, Iva92, HO16, GM16, AGS14, Sf90, Sf98, Per05, AKT16, FG18, GS17]…

Recently, a method was proposed and tested to find saddle points of the action in simulations of non-abelian lattice gauge theory. The idea, called `extremization', is to minimize $\int(\dl S/\dl A_\mu)^2$. The method was implemented in an…

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

This paper studies groups of maximal size acting harmonically on a finite graph. Our main result states that these maximal graph groups are exactly the finite quotients of the modular group $\Gamma=\left<x,y \ | \ x^2=y^3=1\right>$ of size…

Maximal Center Gauge (MCG) aims to detect center vortices by maximizing a gauge functional and then projecting onto the center elements of the respective group. The requirement for unrestricted maximization of the gauge functional has…

Given a finite group $G$, we denote by $L(G)$ the subgroup lattice of $G$ and by ${\cal CD}(G)$ the Chermak-Delgado lattice of $G$. In this note, we determine the finite groups $G$ such that $|{\cal CD}(G)|=|L(G)|-k$, $k=1,2$.

The representation dimension of a finite group G is the smallest positive integer m for which there exists an embedding of G in GL_m(C). In this paper we find the largest value of representation dimensions, as Granges over all groups of…

Given a linear action of a group $G$ on a $K$-vector space $V$, we consider the invariant ring $K[V \oplus V^*]^G$, where $V^*$ is the dual space. We are particularly interested in the case where $V =\gfq^n$ and $G$ is the group $U_n$ of…

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

The action dimension of a discrete group G, actdim(G), is defined to be the smallest integer m such that G admits a properly discontinuous action on a contractible m-manifold. If no such m exists, we define actdim(G) = infty. Bestvina,…

Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $\sum_{p\in \pi(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of…

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…