arXiv subjects

Dmitry Churikov

Publications and source records attributed to Dmitry Churikov.

7 recordsLinked to original sources

arXiv2023

On totally k-closed nilpotent groups

A group $G$ is said to be totally $k$-closed for a positive integer $k$ if, in each of its faithful permutation representations on a set $Ω^k$, $G$ is the largest subgroup of the symmetric group $\operatorname{Sym}(Ω)$ that preserves every $k$-orbit in the induced action on the set $Ω\times\dots\times Ω=Ω^k$. We prove that for $k\geq1$, every finite nilpotent group with Sylow subgroups of orders at most $p^k$ for all primes $p$ dividing $|G|$ is totally $k$-closed if and only if it does not contain an elementary abelian subgroup $\mathbb{Z}_p^k$ for every prime $p$.

math.GR↗

arXiv2022

The minimal size of a generating set for primitive $\frac{3}{2}$-transitive groups

We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer $G_α$ is nontrivial and its orbits distinct from $\{α\}$ are of the same size. We prove that $d(G)\leq4$ for every primitive $\frac{3}{2}$-transitive permutation group $G$, moreover, $G$ is $2$-generated except for the very particular solvable affine groups that we completely describe. In particular, all finite $2$-transitive and $2$-homogeneous groups are $2$-generated. We also show that every finite group whose abelian subgroups are cyclic is $2$-generated, and so is every Frobenius complement.

math.GR↗

arXiv2021

Structure of $k$-closures of finite nilpotent permutation groups

Let $G$ be a permutation group on a set $Ω$, and $k$ a positive integer. The $k$-closure $G^{(k)}$ of $G$ is the largest subgroup of $\operatorname{Sym}(Ω)$, with the same as $G$ orbits of componentwise action on $Ω^k$. We prove that the $k$-closure of a finite nilpotent permutation group is the direct product of $k$-closures of its Sylow subgroups.

math.GR↗

arXiv2021

On WL-rank of Deza Cayley graphs

The WL-rank of a digraph $Γ$ is defined to be the rank of the coherent configuration of $Γ$. We construct a new infinite family of strictly Deza Cayley graphs for which the WL-rank is equal to the number of vertices. The graphs from this family are divisible design and integral.

math.CO↗

arXiv2021

Finite totally $k$-closed groups

For a positive integer $k$, a group $G$ is said to be totally $k$-closed if in each of its faithful permutation representations, say on a set $Ω$, $G$ is the largest subgroup of $\operatorname{Sym}(Ω)$ which leaves invariant each of the $G$-orbits in the induced action on $Ω\times\dots\times Ω=Ω^k$. We prove that every abelian group $G$ is totally $(n(G)+1)$-closed, but is not totally $n(G)$-closed, where $n(G)$ is the number of invariant factors in the invariant factor decomposition of $G$. In particular, we prove that for each $k\geq2$ and each prime $p$, there are infinitely many finite abelian $p$-groups which are totally $k$-closed but not totally $(k-1)$-closed. This result in the special case $k=2$ is due to Abdollahi and Arezoomand. We pose several open questions about total $k$-closure.

math.GR↗

arXiv2020

On $2$-closed abelian permutation groups

A permutation group $G\le\operatorname{Sym}(Ω)$ is said to be $2$-closed if no group $H$ such that $G<H\le\operatorname{Sym}(Ω)$ has the same orbits on $Ω\timesΩ$ as $G$. A simple and efficient inductive criterion for the $2$-closedness is established for abelian permutation groups with cyclic transitive constituents.

math.GR↗

arXiv2018

$\mathbf{2}$-Closure of $\mathbf{\frac{3}{2}}$-transitive group in polynomial time

Let $G$ be a permutation group on a finite set $Ω$. The $k$-closure $G^{(k)}$ of the group $G$ is the largest subgroup of $\operatorname{Sym}(Ω)$ having the same orbits as $G$ on the $k$-th Cartesian power $Ω^k$ of $Ω$. A group $G$ is called $\frac{3}{2}$-transitive if its transitive and the orbits of a point stabilizer $G_α$ on the set $Ω\setminus\{α\}$ are of the same size greater than one. We prove that the $2$-closure $G^{(2)}$ of a $\frac{3}{2}$-transitive permutation group $G$ can be found in polynomial time in size of $Ω$. In addition, if the group $G$ is not $2$-transitive, then for every positive integer $k$ its $k$-closure can be found within the same time. Applying the result, we prove the existence of a polynomial-time algorithm for solving the isomorphism problem for schurian $\frac{3}{2}$-homogeneous coherent configurations, that is the configurations naturally associated with $\frac{3}{2}$-transitive groups.

math.GR↗