相关论文: Minimal generating sets of transfer systems for mo…

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

Let $G$ be a finite group. In order to determine the smallest cardinality $d(G)$ of a generating set of $G$ and a generating set with this cardinality, one should repeat many times the test whether a subset of $G$ of small cardinality…

Let $\mathcal A$ be an $\mathbb F$-algebra and let $\mathcal S$ be its generating set. The length of $\mathcal S$ is the smallest number $k$ such that $\mathcal A$ equals the $\mathbb F$-linear span of all products of length at most $k$ of…

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…

Let $\mathfrak{g}$ be a simple, finite-dimensional Lie (super)algebra equipped with an embedding of $\mathfrak{s} \mathfrak{l}_2$ inducing the minimal gradation on $\mathfrak{g}$. The corresponding minimal $\mathcal{W}$-algebra…

Let p be an odd prime. The lattice of all normal subgroups and the terms of the lower and upper central series are determined for all metabelian p-groups with generator rank d=2 having abelianization of type (p,p) and minimal defect of…

We provide a new upper bound for the length for the shortest non-trivial element in the lower central series $\gamma_n(\mathbb{F}_2)$ of the free group on two generators. We prove that it has an asymptotic behaviour of the form…

We study the right and left commutation semigroups of finite metacyclic groups with trivial centre. These are presented \[G(m,n,k) = \left\langle {a,b;{a^m} = 1,{b^n} = 1,{a^b} = {a^k}} \right\rangle \quad (m,n,k\in\mathbb{Z}^+)\] with…

Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

A set $W\subseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum…

Let $G$ be a transitive permutation group acting on $\Omega$. In this paper, we introduce and study the parameter ${\bf m}(G)$, which denotes the size of the smallest set of points $A$ such that, for every permutation $g\in G$, $A \cap A^g$…

For each odd prime p>=5, there exist finite p-groups G with derived quotient G/D(G)=C(p)xC(p) and nearly constant transfer kernel type k(G)=(1,2,...,2) having two fixed points. It is proved that, for p=7, this type k(G) with the simplest…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical…

Let $G$ be a finite group and $f:G \to {\mathbb C}$ be a function. For a non-empty finite subset $Y\subset G$, let $I_Y(f)$ denote the average of $f$ over $Y$. Then, $I_G(f)$ is the average of $f$ over $G$. Using the decomposition of $f$…

For a group $G$ and a finite set $A$, denote by $\text{CA}(G;A)$ the monoid of all cellular automata over $A^G$ and by $\text{ICA}(G;A)$ its group of units. We study the minimal cardinality of a generating set, known as the rank, of…

For a quasi-split connected reductive group $G$ over a local field $F$ we define a compact abelian group $\tilde\pi_1(G)$ and an extension $1 \to \tilde\pi_1(G) \to G(F)_\infty \to G(F) \to 1$ of topological groups equipped with a splitting…

The commuting graph $\Delta(G)$ of a finite non-abelian group $G$ is a simple graph with vertex set $G$ and two distinct vertices $x, y$ are adjacent if $xy = yx$. In this paper, among some properties of $\Delta(G)$, we investigate…

Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their…

Bridging the work of Cameron, Harary, and others, we examine the base size set B(G) and determining set D(G) of several families of groups. The base size set is the set of base sizes of all faithful actions of the group G on finite sets.…