Related papers: The $3$-closure of a solvable permutation group is…

Let G be a primitive permutation group on a finite set Omega. Let p^2 divide |G|, for a prime p. We show that when G is solvable, there exists a subset of Omega whose stabilizer S has the property that 1<|S|_p<|G|_p. We offer a counting…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this note, we prove that if $\sigma_1(G)<\frac{117}{20}$, then $G$ is solvable. Moreover, we have $\sigma_1(G)=\frac{117}{20}$ if and only if $G\cong A_5$.…

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

Let R be a finite unitary ring whose group of units is not solvable but all groups of units of all its proper subrings are solvable. In this paper we classify these rings and show that all finite rings of order $p^n$ for $n < 5$ and some of…

We consider orientation-preserving actions of finite groups $G$ on pairs $(S^3, \Sigma)$, where $\Sigma$ denotes a compact connected surface embedded in $S^3$. In a previous paper, we considered the case of closed, necessarily orientable…

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

In this paper, we will show that if for every nonlinear complex irreducible character of a finite group G, some multiple of it is induced from an irreducible character of some proper subgroup of G, then G is solvable. This is a…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. In this paper, we prove that if $\sigma_1(G)<2+\frac{11}{|G|}$\,, then $G$ is supersolvable. In particular, some new characterizations of the well-known groups…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Let $M$ be a maximal subgroup of a finite group $G$ and $K/L$ be a chief factor such that $L\leq M$ while $K\nsubseteq M$. We call the group $M\cap K/L$ a $c$\ns section of $M$. And we define $Sec(M)$ to be the abstract group that is…

The covering number of a group $G$, denoted by $\sigma(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$…

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…

Let G be a finite solvable permutation group. Then modulo a possibly trivial normal elementary abelian 3-subgroup, some set-stabilizer in G is a 2-group.

We address the problem of determining the class of self-similar groups, and in particular its closure under restricted direct products. We show that the group $\mathbb Z^{(\omega)}$ is self-similar, that $G^{(\omega)}\rtimes C_2$ is…

We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.

We improve some results of Pavlov and of Filatova, respectively, concerning a problem of Malychin by showing that every regular space X that satisfies Delta(X)>ext(X) is omega-resolvable. Here Delta(X), the dispersion character of X, is the…

This paper is a contribution to the investigation of closed partition relations for pairs of countable ordinals. As our main result, we prove that \[\omega^4 \cdot (n-2)+1 < R^{cl}(\omega \cdot n+1,3)<\omega^5\] for every integer $n \geq…