Existence criterion for Hall subgroups of finite groups

In the paper we obtain an existence criterion for Hall subgroups of finite groups in terms of a composition series.Comment: We made some editor corrections in the tex

On generations by conjugate elements in almost simple groups with socle \mbox{}^2F_4(q^2)'

We prove that if L=\mbox{}^2F_4(2^{2n+1})' and $x$ is a nonidentity automorphism of $L$ then $G=\langle L,x\rangle$ has four elements conjugate to $x$ that generate $G$. This result is used to study the following conjecture about the $\pi$-radical of a finite group: Let $\pi$ be a proper subset of the set of all primes and let $r$ be the least prime not belonging to $\pi$. Set $m=r$ if $r=2$ or $3$ and set $m=r-1$ if $r\geqslant 5$. Supposedly, an element $x$ of a finite group $G$ is contained in the $\pi$-radical $\operatorname{O}_\pi(G)$ if and only if every $m$ conjugates of $x$ generate a $\pi$-subgroup. Based on the results of this paper and a few previous ones, the conjecture is confirmed for all finite groups whose every nonabelian composition factor is isomorphic to a sporadic, alternating, linear, or unitary simple group, or to one of the groups of type ${}^2B_2(2^{2n+1})$, ${}^2G_2(3^{2n+1})$, ${}^2F_4(2^{2n+1})'$, $G_2(q)$, or ${}^3D_4(q)$

Optimal routing on complex networks

We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By using the resulting routing table, a network can sustain significantly higher traffic without jamming than in the case of traditional shortest path routing.Comment: 4 pages, 5 figure

On embedding theorems for X\mathfrak{X}-subgroups

Let $\mathfrak{X}$ be a class of finite groups closed under subgroups, homomorphic images, and extensions. We study the question which goes back to the lectures of H. Wielandt in 1963-64: For a given $\mathfrak{X}$-subgroup $K$ and maximal $\mathfrak{X}$-subgroup $H$, is it possible to see embeddability of $K$ in $H$ (up to conjugacy) by their projections onto the factors of a fixed subnormal series. On the one hand, we construct examples where $K$ has the same projections as some subgroup of $H$ but is not conjugate to any subgroup of $H$. On the other hand, we prove that if $K$ normalizes the projections of a subgroup $H$, then $K$ is conjugate to a subgroup of $H$ even in the more general case when $H$ is a submaximal $\mathfrak{X}$-subgroup

Transport optimization on complex networks

We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the maximum node betweenness with as little path lengthening as possible. We show that by using this optimal routing, a network can sustain significantly higher traffic without jamming than in the case of shortest path routing. A formula is proved that allows quick computation of the average number of hops along the path and of the average travel times once the betweennesses of the nodes are computed. Using this formula, we show that routing optimization preserves the small-world character exhibited by networks under shortest path routing, and that it significantly reduces the average travel time on congested networks with only a negligible increase in the average travel time at low loads. Finally, we study the correlation between the weights of the links in the case of optimal routing and the betweennesses of the nodes connected by them.Comment: 19 pages, 7 figure