Related papers: Finite groups admitting a regular tournament $m$-s…

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

We investigate finite torsors over big opens of spectra of strongly $F$-regular germs that do not extend to torsors over the whole spectrum. Let $(R,\mathfrak{m},k)$ be a strongly $F$-regular $k$-germ where $k$ is an algebraically closed…

A generalized tournament matrix $M$ is a nonnegative matrix that satisfies $M+M^{t}=J-I$, where $J$ is the all ones matrix and $I$ is the identity matrix. In this paper, a characterization of generalized tournament matrices with the same…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

'A semigroup is completely regular if and only if it is a union of groups'- an analogue of this structure theorem of completely regular semigroup has been obtained in the setting of seminearrings in [[16], Mukherjee (Pal) et al., Semigroup…

Let G be a finite group. A subgroup M of G is said to be an NR-subgroup if, whenever K is normal in M, then K^G\cap M=K, where K^G is the normal closure of K in G. Using the Classification of Finite Simple Groups, we prove that if every…

For any finite group $G$ and a positive integer $m$, we define andstudy a Schur ring over the direct power $G^m$, which gives an algebraic interpretation of the partition of $G^m$ obtained by the $m$-dimensional Weisfeiler-Leman algorithm.…

Real world tournaments are almost always intransitive. Recent works have noted that parametric models which assume $d$ dimensional node representations can effectively model intransitive tournaments. However, nothing is known about the…

Let $F$ be a field of characteristic $\neq 2$. Let $G$ be an algebraic group defined over $F$. An element $t\in G(F)$ is called {\bf real} if there exists $s\in G(F)$ such that $sts^{-1}=t^{-1}$. A semisimple element $t$ in $GL_n(F),…

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

Suppose that $X$ be a nonempty set. Denote by $\mathcal{T}(X)$ the full transformation semigroup on $X$. For $\varnothing \neq Z\subseteq Y\subseteq X$, let $\mathcal{T}(X,Y,Z)=\{\alpha \in \mathcal{T}(X): Y\alpha \subseteq Z \}$. Then…

A group $\Gamma$ is said to be periodic if for any $g$ in $\Gamma$ there is a positive integer $n$ with $g^n=id$. We first prove that a finitely generated periodic group acting on the 2-sphere $\SS^2$ by $C^1$-diffeomorphisms with a finite…

We consider the following Tur\'an-type problem: given a fixed tournament $H$, what is the least integer $t=t(n,H)$ so that adding $t$ edges to any $n$-vertex tournament, results in a digraph containing a copy of $H$. Similarly, what is the…

We say that a subgraph $F$ of a graph $G$ is singular if the degrees $d_G(v)$ are all equal or all distinct for the vertices $v\in V(F)$. The singular Ramsey number Rs$(F)$ is the smallest positive integer $n$ such that, for every $m\geq…

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…

A subgroup $H$ of a group $G$ is said to be pronormal in $G$ if $H$ and $H^g$ are conjugate in $\langle H, H^g\rangle$ for every element $g \in G$. In [Sib. Math. J. 2015. Vol. 56, no. 6] we proved that subgroups of odd indeces are…

We prove that there exist finitely presented, residually finite groups that are profinitely rigid in the class of all finitely presented groups but not in the class of all finitely generated groups. These groups are of the form $\Gamma…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…