Related papers: Minimal zero-sum sequences of length five over fin…

We show that the minimum number of vertices of a simplicial complex with fundamental group $\mathbb{Z}^{n}$ is at most $O(n)$ and at least $\Omega(n^{3/4})$. For the upper bound, we use a result on orthogonal 1-factorizations of $K_{2n}$.…

For a finite group $G$, let $a_n(G)$ be the number of subgroups of order $n$ and define $\zeta_G(s)=\sum_{n\ge 1} a_n(G)n^{-s}$. Examples are known of non-isomorphic finite groups with the same group zeta function. However, no general…

The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. Minimum rank is a…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Let p be a prime. Every finite group G has a normal series each of whose quotients either is p-soluble or is a direct product of nonabelian simple groups of orders divisible by p. The non-p-soluble length of G is defined as the minimal…

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. In [M. Herzog, et. al., Two new criteria for solvability of finite groups, J. Algebra, 2018], the authors put forward the following…

Let $\Z_m$ be the group of residue classes modulo $m$. Let $s(m,n)$ and $c(m,n)$ denote the total number of subgroups of the group $\Z_m \times \Z_n$ and the number of its cyclic subgroups, respectively, where $m$ and $n$ are arbitrary…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

We prove that for any finite group G, the sum across non-identity elements of the squared absolute value of any generalized character of G which does not vanish on all non-identity elements of G is at least |G|/d -1, where d is the maximal…

Let $G$ be a finite group multiplicatively written. The small Davenport constant of $G$ is the maximum positive integer ${\sf d}(G)$ such that there exists a sequence $S$ of length ${\sf d}(G)$ for which every subsequence of $S$ is…

Let $G$ be a finite group, and let $\text{Irr}(G)$ denote the set of the irreducible complex characters of $G$. An element $g\in G$ is called a vanishing element of $G$ if there exists $\chi\in\text{Irr}(G)$ such that $\chi(g)=0$ (i.e., $g$…

There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several new and tight results in this area. Let $G$ be a graph with minimum degree at least $k+1$. We prove that if $G$ is…

We determine the minimal non-trivial integer group determinant for the dicyclic group of order $4n$ when $n$ is odd. We also discuss the set of all integer group determinants for the dicyclic groups of order $4p$.

Let c(d) denote the minimal composition length of all finite solvable groups with solvable (or derived) length d. We prove that c(d) equals 0,1,2,4,5,7,8,13,15 when d=0,1,2,3,4,5,6,7,8.

The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

For a non-cyclic finite group $G$, let $\gamma(G)$ denote the smallest number of conjugacy classes of proper subgroups of $G$ needed to cover $G$. Bubboloni, Praeger and Spiga, motivated by questions in number theory, have recently…

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…