Computing the minimal covering set

We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set–the minimal upward covering set and the minimal downward covering set–unless P equals NP. Finally, we observe a strong relationship between von Neumann–Morgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.     

Quasinormal subgroups of order p 2

The location of quasinormal subgroups in a group is not particularly well known. Maximal ones always have to be normal, but little has been proved about the minimal ones. In finite groups, the difficulties arise in the p-groups. Here we prove that, for every odd prime p, a quasinormal subgroup of order p ² in a finite p-group G contains a quasinormal subgroup of G of order p. S. Stonehewer is grateful to the Australian National University for financial support during the preparation of this paper.     

An intrinsic approach to Lichnerowicz conjecture

In this paper we give a proof of Lichnerowicz conjecture for compact simply connected manifolds which is intrinsic in the sense that it avoids thenice embeddings into eigenspaces of the Laplacian. Even if one wants to use these embeddings, this paper gives a more streamlined proof. As a byproduct, we get a simple criterion for a polynomial to be a Jacobi polynomial.     

Solvable infinite-dimensional linear groups with restrictions on the nonabelian subgroups of infinite rank

Under study are the solvable nonabelian linear groups of infinite central dimension and sectional p-rank, p ≥ 0, in which all proper nonabelian subgroups of infinite sectional p-rank have finite central dimension. We describe the structure of the groups of this class.     

Normalizers of subsystem subgroups in finite groups of Lie type

Finite groups of Lie type form the greater part of known finite simple groups. An important class of subgroups of finite groups of Lie type are so-called reductive subgroups of maximal rank. These arise naturally as Levi factors of parabolic groups and as centralizers of semisimple elements, and also as subgroups with maximal tori. Moreover, reductive groups of maximal rank play an important part in inductive studies of subgroup structure of finite groups of Lie type. Yet a number of vital questions dealing in the internal structure of such subgroups are still not settled. In particular, we know which quasisimple groups may appear as central multipliers in the semisimple part of any reductive group of maximal rank, but we do not know how normalizers of those quasisimple groups are structured. The present paper is devoted to tackling this problem. Supported by RFBR (grant No. 05-01-00797) and by SB RAS (Young Researchers Support grant No. 29 and Integration project No. 2006.1.2). __________ Translated from Algebra i Logika, Vol. 47, No. 1, pp. 3–30, January–February, 2008.     

Orthogonal similarity transformation into block‐semiseparable matrices of semiseparability rank k

Very recently, an algorithm, which reduces any symmetric matrix into a semiseparable one of semi‐ separability rank 1 by similar orthogonality transformations, has been proposed by Vandebril, Van Barel and Mastronardi. Partial execution of this algorithm computes a semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the Lanczos' process applied to the original matrix. Also a kind of nested subspace iteration is performed at each step. In this paper, we generalize the above results and propose an algorithm to reduce any symmetric matrix into a similar block‐semiseparable one of semiseparability rank k, with k ∈ ?, by orthogonal similarity transformations. Also in this case partial execution of the algorithm computes a block‐semiseparable matrix whose eigenvalues are the Ritz‐values obtained by the block‐Lanczos' process with k starting vectors, applied to the original matrix. Subspace iteration is performed at each step as well. Copyright © 2005 John Wiley & Sons, Ltd.     

Computing the test rank of a free solvable Lie algebra

We computed the test rank of a free solvable Lie algebra of finite rank.     

Minimal webs in Riemannian manifolds

For a given combinatorial graph G a geometrization (G, g) of the graph is obtained by considering each edge of the graph as a 1-dimensional manifold with an associated metric g. In this paper we are concerned with minimal isometric immersions of geometrized graphs (G, g) into Riemannian manifolds (N ⁿ , h). Such immersions we call minimal webs. They admit a natural ‘geometric’ extension of the intrinsic combinatorial discrete Laplacian. The geometric Laplacian on minimal webs enjoys standard properties such as the maximum principle and the divergence theorems, which are of instrumental importance for the applications. We apply these properties to show that minimal webs in ambient Riemannian spaces share several analytic and geometric properties with their smooth (minimal submanifold) counterparts in such spaces. In particular we use appropriate versions of the divergence theorems together with the comparison techniques for distance functions in Riemannian geometry and obtain bounds for the first Dirichlet eigenvalues, the exit times and the capacities as well as isoperimetric type inequalities for so-called extrinsic R-webs of minimal webs in ambient Riemannian manifolds with bounded curvature.      

Representations of distributive semilattices in ideal lattices of various algebraic structures

We study the relationships among existing results about representations of distributive semilattices by ideals in dimension groups, von Neumann regular rings, C*-algebras, and complemented modular lattices. We prove additional representation results which exhibit further connections with the scattered literature on these different topics. Received March 2, 1998; accepted in final form November 9, 2000.     

Improved Sobolev inequalities on groups of Iwasawa type in presence of symmetry

Let G be a simple Lie group of real rank one and N be in the Iwasawa decomposition of G. We prove a refined version of the Sobolev inequality on N in presence of symmetry.