Related papers: Bounding the maximal size of independent generatin…

We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…

For a finite group $G$, the representation dimension is the smallest integer realizable as the degree of a complex faithful representation of $G$. In this article, we compute representation dimension for some $p$-groups, their direct…

A finite $p$-group $G$ is said to be $d$-maximal if $d(H)<d(G)$ for every subgroup $H<G$, where $d(G)$ denotes the minimal number of generators of $G$. A similar definition can be formulated when $G$ is acted on by some group $A$. We…

We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szab\'o (2013) by exhibiting a sequence of finite groups $G_n$ with $|G_n| \to \infty$ admitting…

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

Let $G$ be a finite group. Then we denote $\psi(G) = \sum_{x\in G}o(x)$ where $o(x)$ is the order of the element $x$ in $G$. In this paper we characterize some finite $p$-groups ($p$ a prime) by $\psi$ and their orders.

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, given a finite almost simple group $G$ and any maximal subgroup $H$ of $G$, we determine a precise upper bound for $d(H)$. In…

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…

Let $G$ be a finite group and $N(G)$ be the set of conjugacy class sizes of $G$. For a prime $p$, let $|G||_p$ be the highest $p$-power dividing some element of $N(G)$. and define $|G|| = {\Pi}_{p\in {\pi}(G)}|G||_p$. $G$ is said to be an…

Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…

We characterize finite $p$-groups $G$ of order up to $p^7$ for which the group of central automorphisms fixing the center element-wise is of minimum possibe order.

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

We study the component structure of the random graph $G=G_{n,m,d}$. Here $d=O(1)$ and $G$ is sampled uniformly from ${\mathcal G}_{n,m,d}$, the set of graphs with vertex set $[n]$, $m$ edges and maximum degree at most $d$. If $m=\mu n/2$…

Let $G$ be a finite $p$-group of order $p^n$. It is known that $|\mathcal{M}(G)|=p^{\f{1}{2}n(n-1)-t(G)}$ and $t(G)\geq 0$. The structure of $G$ characterized when $t(G)\leq 4$ in \cite{be,el,ni,sa,zh}. The structure description of $G$ is…

Let $G$ be a finite group. The group pseudo-algebra of $G$ is defined as the multi-set $C(G)=\{(d,m_G(d))\mid d\in{\rm Cod}(G)\},$ where $m_G(d)$ is the number of irreducible characters of with codegree $d\in {\rm Cod}(G)$. We show that…

A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…

Let $G$ be a finite group and $n_p(G)$ the number of Sylow $p$-subgroups of $G$. In this paper, we prove if $n_p(G)<p^2$ then almost all numbers $n_p(G)$ are a power of a prime.