Alexander Bors
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Latest Publications
- Open Access
Approximability of word maps by homomorphisms
Generalizing a recent result of Mann, we show that there is an explicit function $f:\left(0,1\right]\rightarrow\left(0,1\right]$ such that for every reduced word $w$, say in $d$ variables, there is an explicit reduced word $v$ in at most $3d$ variables (nontrivial if the length of $w$ is at least $2$) such that for all $\rho\in\left(0,1\right]$, the following holds: If $G$ is any finite group for which the word map $w_G:G^d\rightarrow G$ agrees with some fixed homomorphism $G^d\rightarrow G$ on at least $\rho|G|^d$ many arguments, then the word map $v_G:G^{3d}\rightarrow G$ has a fiber of size at least $f(\rho)|G|^{3d}$. We also discuss some applications of this result.Open AccessApproximability of word maps by homomorphisms
Generalizing a recent result of Mann, we show that there is an explicit function $f:\left(0,1\right]\rightarrow\left(0,1\right]$ such that for every reduced word $w$, say in $d$ variables, there is an explicit reduced word $v$ in at most $3d$ variables (nontrivial if the length of $w$ is at least $2$) such that for all $\rho\in\left(0,1\right]$, the following holds: If $G$ is any finite group for which the word map $w_G:G^d\rightarrow G$ agrees with some fixed homomorphism $G^d\rightarrow G$ on at least $\rho|G|^d$ many arguments, then the word map $v_G:G^{3d}\rightarrow G$ has a fiber of size at least $f(\rho)|G|^{3d}$. We also discuss some applications of this result. - 8 April 2017
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 20 (6) , 1103-1133
Fibers of automorphic word maps and an application to composition factors
In this paper, we study the fibers of “automorphic word maps”, a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite groups G where, for some fixed nonempty reduced word w in d variables and some fixed ρ ∈ ( 0 , 1 ] {\rho\in(0,1]} , the word map w G {w_{G}} on G has a fiber of size at least ρ | G | d {\rho|G|^{d}} : No sufficiently large alternating group and no (classical) simple group of Lie type of sufficiently high rank can occur as a composition factor of such a group G.
- 8 April 2017
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 20 (6) , 1103-1133
Fibers of automorphic word maps and an application to composition factors
In this paper, we study the fibers of “automorphic word maps”, a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite groups G where, for some fixed nonempty reduced word w in d variables and some fixed ρ ∈ ( 0 , 1 ] {\rho\in(0,1]} , the word map w G {w_{G}} on G has a fiber of size at least ρ | G | d {\rho|G|^{d}} : No sufficiently large alternating group and no (classical) simple group of Lie type of sufficiently high rank can occur as a composition factor of such a group G.
- Open Access
Fibers of word maps and the multiplicities of nonabelian composition factors
Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with multiplicity bounded in terms of $\rho$ and $S$. In this paper, based on recent work of Nikolov, we present methods to show that a given reduced word is multiplicity-bounding and apply them to give some nontrivial examples of multiplicity-bounding words, such as words of the form $x^e$, where $x$ is a single variable and $e$ an odd integer.Open AccessFibers of word maps and the multiplicities of nonabelian composition factors
Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with multiplicity bounded in terms of $\rho$ and $S$. In this paper, based on recent work of Nikolov, we present methods to show that a given reduced word is multiplicity-bounding and apply them to give some nontrivial examples of multiplicity-bounding words, such as words of the form $x^e$, where $x$ is a single variable and $e$ an odd integer. - 14 February 2017
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 20 (4) , 681-717
Finite groups with an automorphism of large order
Let G be a finite group, and assume that G has an automorphism of order at least ρ | G | {\rho|G|} , with ρ ∈ ( 0 , 1 ) {\rho\in(0,1)} . We prove that if ρ > 1 / 2 {\rho>1/2} , then G is abelian, and if ρ > 1 / 10 {\rho>1/10} , then G is solvable, whereas in general, the assumption implies [ G : Rad ( G ) ] ≤ ρ - 1.78 {[G:\operatorname{Rad}(G)]\leq\rho^{-1.78}} , where Rad ( G ) {\operatorname{Rad}(G)} denotes the solvable radical of G. We also prove analogous results for a larger class of self-transformations of finite groups, so-called bijective affine maps. Furthermore, we provide two results of independent interest: an upper bound on element orders in the holomorph of a finite group, and that every bijective affine map of a finite semisimple group has a cycle of length equal to the order of the map, extending a theorem of Horoševskiĭ.
- 14 February 2017
- Published by Walter de Gruyter GmbH in Journal of Group Theory
- Vol. 20 (4) , 681-717
Finite groups with an automorphism of large order
Let G be a finite group, and assume that G has an automorphism of order at least ρ | G | {\rho|G|} , with ρ ∈ ( 0 , 1 ) {\rho\in(0,1)} . We prove that if ρ > 1 / 2 {\rho>1/2} , then G is abelian, and if ρ > 1 / 10 {\rho>1/10} , then G is solvable, whereas in general, the assumption implies [ G : Rad ( G ) ] ≤ ρ - 1.78 {[G:\operatorname{Rad}(G)]\leq\rho^{-1.78}} , where Rad ( G ) {\operatorname{Rad}(G)} denotes the solvable radical of G. We also prove analogous results for a larger class of self-transformations of finite groups, so-called bijective affine maps. Furthermore, we provide two results of independent interest: an upper bound on element orders in the holomorph of a finite group, and that every bijective affine map of a finite semisimple group has a cycle of length equal to the order of the map, extending a theorem of Horoševskiĭ.
- Open Access
Fibers of automorphic word maps and an application to composition factors
In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite groups $G$ where, for some fixed nonempty reduced word $w$ in $d$ variables and some fixed $\rho\in\left(0,1\right]$, the word map $w_G$ on $G$ has a fiber of size at least $\rho|G|^d$: No sufficiently large alternating group and no (classical) simple group of Lie type of sufficiently high rank can occur as a composition factor of such a group $G$.Open AccessFibers of automorphic word maps and an application to composition factors
In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite groups $G$ where, for some fixed nonempty reduced word $w$ in $d$ variables and some fixed $\rho\in\left(0,1\right]$, the word map $w_G$ on $G$ has a fiber of size at least $\rho|G|^d$: No sufficiently large alternating group and no (classical) simple group of Lie type of sufficiently high rank can occur as a composition factor of such a group $G$. - 7 October 2016
- Published by Taylor & Francis in Communications in Algebra
- Vol. 45 (5) , 2029-2042
Classification of finite group automorphisms with a large cycle II
In a previous paper, the author classified the pairs (G,α) where G is a finite group and α an automorphism of G having a cycle of length greater than . In this paper, we extend this classification to the case where α has a cycle of length equal to and show some applications of the classification: We discuss an algorithm for listing the pairs (G,α) where the largest cycle length of α equals ρ|G| on input any rational , and we prove that the set of cycle length fractions of finite group automorphisms is not dense in [0,1].- 7 October 2016
- Published by Taylor & Francis in Communications in Algebra
- Vol. 45 (5) , 2029-2042
Classification of finite group automorphisms with a large cycle II
In a previous paper, the author classified the pairs (G,α) where G is a finite group and α an automorphism of G having a cycle of length greater than . In this paper, we extend this classification to the case where α has a cycle of length equal to and show some applications of the classification: We discuss an algorithm for listing the pairs (G,α) where the largest cycle length of α equals ρ|G| on input any rational , and we prove that the set of cycle length fractions of finite group automorphisms is not dense in [0,1].- Open Access
- 17 September 2016
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 28 (3) , 205-214
On the dynamics of endomorphisms of finite groups
- 17 September 2016
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 28 (3) , 205-214
Open AccessOn the dynamics of endomorphisms of finite groups
- 16 June 2016
- Published by Taylor & Francis in Communications in Algebra
- Vol. 44 (11) , 4823-4843
Classification of Finite Group Automorphisms with a Large Cycle
The investigation of finite groups classifying as “extreme” according to certain quantitative conditions has a long history. The aim of this paper is to classify the pairs (G, α) where G is a finite group and α is an automorphism of G with a cycle of length greater than . In particular, it is shown that every finite group G having such an automorphism is abelian.
- 16 June 2016
- Published by Taylor & Francis in Communications in Algebra
- Vol. 44 (11) , 4823-4843
Classification of Finite Group Automorphisms with a Large Cycle
The investigation of finite groups classifying as “extreme” according to certain quantitative conditions has a long history. The aim of this paper is to classify the pairs (G, α) where G is a finite group and α is an automorphism of G with a cycle of length greater than . In particular, it is shown that every finite group G having such an automorphism is abelian.
- Open Access
A note on finite groups with an automorphism inverting or squaring a non-negligible fraction of elements
We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these bounds together with a result of Guralnick and Robinson gives upper bounds on the index of the Fitting subgroup of $G$ under each of the two conditions that $G$ have an automorphism inverting resp. squaring at least $\rho|G|$ many elements in $G$, for $\rho\in\left(0,1\right]$ fixed. This is an improvement on previous results of the author.Open AccessA note on finite groups with an automorphism inverting or squaring a non-negligible fraction of elements
We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these bounds together with a result of Guralnick and Robinson gives upper bounds on the index of the Fitting subgroup of $G$ under each of the two conditions that $G$ have an automorphism inverting resp. squaring at least $\rho|G|$ many elements in $G$, for $\rho\in\left(0,1\right]$ fixed. This is an improvement on previous results of the author. - Open Access
Finite groups with an automorphism inverting, squaring or cubing a non-negligible fraction of elements
There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or cubed by a single automorphism) is large enough must be close to being abelian. In this paper, we show the following: Fix a real number $\rho$ with $0<\rho\leq 1$. Then a finite group $G$ with an automorphism inverting or squaring at least $\rho|G|$ of the elements in $G$ is "almost abelian" in the sense that both the index and the derived length of the solvable radical of $G$ are bounded. Furthermore, if $G$ has an automorphism cubing at least $\rho|G|$ of the elements in $G$, then $G$ is "almost solvable" in the sense that the index of the solvable radical of $G$ is bounded.Open AccessFinite groups with an automorphism inverting, squaring or cubing a non-negligible fraction of elements
There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or cubed by a single automorphism) is large enough must be close to being abelian. In this paper, we show the following: Fix a real number $\rho$ with $0<\rho\leq 1$. Then a finite group $G$ with an automorphism inverting or squaring at least $\rho|G|$ of the elements in $G$ is "almost abelian" in the sense that both the index and the derived length of the solvable radical of $G$ are bounded. Furthermore, if $G$ has an automorphism cubing at least $\rho|G|$ of the elements in $G$, then $G$ is "almost solvable" in the sense that the index of the solvable radical of $G$ is bounded.