相关论文: Abelian coverings of finite general linear groups …

In this paper we prove that the subalgebras of cocommutative elements in the quantized coordinate rings of $M_{n}$, $GL_{n}$ and $SL_{n}$ are the centralizers of the trace $x_{1,1}+\dots+x_{n,n}$ in each algebra, for…

In this communication, the co-maximal subgroup graph $\Gamma(G)$ of a finite group $G$ is examined when $G$ is a finite nilpotent group, finite abelian group, dihedral group $D_n$, dicyclic group $Q_{2^n}$, and $p$-group. We derive the…

Let $G$ be a finite group. Recall that an $A$-group is a group whose Sylow subgroups are all abelian. In this paper, we investigate the upper bound on the diameter of the commuting graph of a solvable $A$-group. Assuming that the commuting…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

The generating graph $\Gamma(G)$ of a finite group $G$ has vertex set the non-identity elements of $G$, with two elements connected exactly when they generate $G$. A coclique in a graph is an empty induced subgraph, so a coclique in…

Given a non-trivial finite Abelian group $(A,+)$, let $n(A) \ge 2$ be the smallest integer such that for every labelling of the arcs of the bidirected complete graph of order $n(A)$ with elements from $A$ there exists a directed cycle for…

Let $G(X,Y)$ be a connected, non-complete bipartite graph with $|X|\leq |Y|$. An independent set $A$ of $G(X,Y)$ is said to be trivial if $A\subseteq X$ or $A\subseteq Y$. Otherwise, $A$ is nontrivial. By $\alpha(X,Y)$ we denote the size of…

Let $G$ be a group, $m\geq2$ and $n\geq1$. We say that $G$ is an $\mathcal{T}(m,n)$-group if for every $m$ subsets $X_1, X_2, \dots, X_m$ of $G$ of cardinality $n$, there exists $i\neq j$ and $x_i \in X_i, x_j \in X_j$ such that…

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Blokhuis showed that all maximum cliques in Paley graphs of square order have a subfield structure. Recently, it has been shown that in Peisert-type graphs, all maximum cliques are affine subspaces, and yet some maximum cliques do not arise…

We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. The non-commuting graph $\Gamma_G$ associated to $G$ is the graph whose vertex set is $G\setminus Z(G)$ and two distinct elements $x,y$ are adjacent if and only if $xy\neq yx$.…

In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local…

A corollary of Kneser's theorem, one sees that any finite non-empty subset $A$ of an abelian group $G = (G,+)$ with $|A + A| \leq (2-\eps) |A|$ can be covered by at most $\frac{2}{\eps}-1$ translates of a finite group $H$ of cardinality at…

The non--commuting graph $\Gamma(G)$ of a non--abelian group $G$ is defined as follows. The vertex set $V(\Gamma(G))$ of $\Gamma(G)$ is $G\setminus Z(G)$ where $Z(G)$ denotes the center of $G$ and two vertices $x$ and $y$ are adjacent if…

Fix an arbitrary finite group $A$ of order $a$, and let $X(n,q)$ denote the set of homomorphisms from $A$ to the finite general linear group ${\rm GL}_n(q)$. The size of $X(n,q)$ is a polynomial in $q$. In this note it is shown that…

A non-commuting graph of a finite group $G$ is a graph whose vertices are non-central elements of $G$ and two vertices are adjacent if they don't commute in $G$. In this paper, we study the non-commuting graph of the group $U_{6n}$ and…

Let $G$ be a nonabelian group and $n$ a natural number. We say that $G$ has a strict $n$-split decomposition if it can be partitioned as the disjoint union of an abelian subgroup $A$ and $n$ nonempty subsets $B_1, B_2, \ldots, B_n$, such…

This paper contributes to the study of the fibers of the commutator map on special linear groups in characteristic zero. Specifically, we show that the fibers over non-central elements all have the same dimension. Also we explain that the…

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…