Some subgroups of the full linear group

Further observations are made on the author's earlier paper (Ref. Zh. Mat., 1977, 5A284) dealing with the lattice H of all subgroups of the full linear group GL(n, K) over a field K that contain the group K of diagonal matrices. It is noted, for example, that for an infinite field K all subgroups inD(n, K) are algebraic; a subgroup in H is connected if and only if it is a net subgroup; the lattice of all connected subgroups in H is isomorphic to the lattice of all marked topologies onn points; any subgroup H in H is a semidirect product H=A·H_o of a maximal connected normal subgroup H_o of H and a finite group A of, permutation matrices.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 71, pp. 42–46, 1977.     

Treed Regression

Abstract

Given a data set consisting of n observations on p independent variables and a single dependent variable, treed regression creates a binary tree with a simple linear regression function at each of the leaves. Each node of the tree consists of an inequality condition on one of the independent variables. The tree is generated from the training data by a recursive partitioning algorithm. Treed regression models are more parsimonious than CART models because there are fewer splits. Additionally, monotonicity in some or all of the variables can be imposed.     

Resolutions of Facet Ideals

Abstract

In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determine the projective dimension and the regularity of I if the tree is 1-dimensional, show that the graded Betti numbers of I satisfy an alternating sum property if the tree is connected in codimension 1, and classify all trees whose facet ideal has a linear resolution.     

Unique Node Extremal Subgroups in Chevalley Groups

Abstract

Taking G to be a Chevalley group of rank at least 3 and U to be the unipotent radical of a Borel subgroup B,an extremal subgroup A is an abelian normal subgroup of U which is not contained in the intersection of all the unipotent radicals of the rank 1 parabolic subgroups of G containing B. If there is an unique rank 1 parabolic subgroup P of G containing B with the property that A is not contained in the unipotent radical of P,then A is called a unique node extremal subgroup. In this paper we investigate the embedding of unique node extremal subgroups in U and prove that,apart from some specified cases,such a subgroup is contained in the unipotent radical of a certain maximal parabolic subgroup.     

General p-valuations on abelian groups

A subgroup of a p-group is valuated in a natural way, and every valuated p-group can be embedded as a valuated subgroup of a p-group. We generalize this theorem to subgroups of p-valuated groups with values in an arbitrary value domain D. The induced valuation on the subgroup assigns to each element an equivalence class of D-valuated rooted trees. In the classical caseD is trivial and the equivalence class of trees can be identified with an extended ordinal. The embedding is functorial if some set-theoretic problems can be overcome, which they can be if D is trivial or equal to the ordinals.     

A framework for sensitivity analysis of decision trees

In the paper, we consider sequential decision problems with uncertainty, represented as decision trees. Sensitivity analysis is always a crucial element of decision making and in decision trees it often focuses on probabilities. In the stochastic model considered, the user often has only limited information about the true values of probabilities. We develop a framework for performing sensitivity analysis of optimal strategies accounting for this distributional uncertainty. We design this robust optimization approach in an intuitive and not overly technical way, to make it simple to apply in daily managerial practice. The proposed framework allows for (1) analysis of the stability of the expected-value-maximizing strategy and (2) identification of strategies which are robust with respect to pessimistic/optimistic/mode-favoring perturbations of probabilities. We verify the properties of our approach in two cases: (a) probabilities in a tree are the primitives of the model and can be modified independently; (b) probabilities in a tree reflect some underlying, structural probabilities, and are interrelated. We provide a free software tool implementing the methods described.

     

有限群的最大子群的性质对群结构的影响

有限群G的一个子群称为在G中是π-拟正规的若它与G的每一个Sylow-子群是交换的.G的一个子群H称为在G中是c-可补的若存在G的子群N使得G=HN且H∩N≤HG=CoreG(H).本文证明了:设F是一个包含超可解群系u的饱和群系,G有一个正规子群H使得G/H∈F.则G∈F若下列之一成立:(1)H的每个Sylow子群的所有极大子群在G中或者是π-拟正规的或者是c-可补的;(2)F*(H)的每个Sylow子群的所有极大子群在G中或者是π-拟正规的或者是c-可补的,其中F*(H)是H的广义Fitting子群.此结论统一了一些最近的结果.     

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

We introduce a proximal alternating linearized minimization (PALM) algorithm for solving a broad class of nonconvex and nonsmooth minimization problems. Building on the powerful Kurdyka–?ojasiewicz property, we derive a self-contained convergence analysis framework and establish that each bounded sequence generated by PALM globally converges to a critical point. Our approach allows to analyze various classes of nonconvex-nonsmooth problems and related nonconvex proximal forward–backward algorithms with semi-algebraic problem’s data, the later property being shared by many functions arising in a wide variety of fundamental applications. A by-product of our framework also shows that our results are new even in the convex setting. As an illustration of the results, we derive a new and simple globally convergent algorithm for solving the sparse nonnegative matrix factorization problem.     

On the complexity of searching game trees and other recursion trees

Game tree searching is one of the fundamental topics in artificial intelligence and decision analysis. The main results of this paper are: (1) A simple nondirectional algorithm for searching binary bi-valued game trees is presented and analysed. For a wide range of parameters s in Schrüfers s-tree model it has a smaller branching factor than directional search. (2) A cascade technique for game tree models with at least four different node values is presented. This technique yields algorithms with smaller branching factors than alpha-beta. (The amount of storage required by the algorithms in (1) and (2) is only linear in the depth of the searched trees.) (3) Recursion trees are defined as a natural generalisation of game trees. A combinatorial lower bound for the complexity of searching symmetric recursion trees is proved. (4) Those recursion trees are characterized which can be searched by pruning techniques.     

A New Formulation for Spanning Trees

Spanning trees are fundamental structures in graph theory. Furthermore, computing them is a central part in many relevant algorithms, used in either practical or theoretical applications. The classical Minimum Spanning Tree problem is solvable in polynomial time but almost all of its variants are NP-Hard. In this paper, a novel polynomial size mixed integer linear programming formulation is introduced for spanning trees. This formulation is based on a new characterization we propose for acyclic graphs. Preliminary computational results show that this formulation is capable of solving small instances of the diameter constrained minimum spanning tree problem. It should be possible to strengthen the formulation to tackle larger instances of that problem. Additionally, our spanning tree formulation may prove to be a more effective model for some related applications.     

Finite two-are transitive graphs admitting a ree simple group

ABSTRACT

The article is dedicated to some generalizations of minimax soluble groups satisfying common criterion of nilpotency, such that normality of maximal subgroups, nilpotency of the factor-group by the Frattini subgroup, normality of pronormal subgroups, non-existence of proper abnormal subgroups and so on.     

On Weakly Factorizable Groups

Groups with complemented subgroups, which are also called completely factorizable groups, were studied by P. Hall, S. N. Chernikov, and N. V. Chernikova (Baeva). For complete factorizability, it is sufficient (Theorem 1) that each proper subgroup have a normal complement in some larger subgroup. A group is said to be weakly factorizable if each of its proper subgroups is complemented in some larger subgroup; the problem of describing finite groups with this property is posed (Question 8.31) in the Kourovka Notebook. Some properties of these groups are considered. The question is studied for Sylow p-subgroups of Chevalley-type groups of characteristic p. The main theorem, Theorem 2, establishes the weak factorizability of the Sylow p-subgroups in the symmetric and alternative groups and in the classical linear groups over fields of characteristic p> 0, excluding the unitary groups of odd dimension > p.     

Expectation transfer between branching processes and random trees

An approach for translating results on expected parameter values from subcritical Galton–Watson branching processes to simply generated random trees under the uniform model is outlined. As an auxiliary technique for asymptotic evaluations, we use Flajolet's and Odlyzko's transfer theorems. Some classical results on random trees are re-derived by the mentioned approach, and some new results are presented. For example, the asymptotic behavior of linearly recursive tree parameters is described and the asymptotic probability of level k to contain exactly one node is determined. © 1993 John Wiley & Sons, Inc.     

Countable Primitive Groups

We give a complete characterization of countable primitive groups in several settings including linear groups, subgroups of mapping class groups, groups acting minimally on trees and convergence groups. The latter category includes as a special case Kleinian groups as well as subgroups of word hyperbolic groups. As an application we calculate the Frattini subgroup in many of these settings, often generalizing results that were only known for finitely generated groups. In particular, we answer a question of G. Higman and B.H. Neumann on the Frattini group of an amalgamated product. Received: January 2006, Revision: May 2006, Accepted: May 2006     

Abelian subgroup separability of certain generalized free products of free or finitely generated nilpotent groups

In this paper we prove that certain generalized free products of abelian subgroup separable groups, amalgamating an infinite cyclic subgroup, are abelian subgroup separable. Applying this, we derive that tree products of free groups or finitely generated nilpotent groups, amalgamating infinite cyclic subgroups, are abelian subgroup separable.     

Intermediately fully invariant subgroups of abelian groups

Describing intermediately fully invariant subgroups of divisible and torsion groups, we show that the intermediately fully invariant subgroups are direct summands in a completely decomposable group whose every homogeneous component is decomposable. For torsion groups, we find out when all their fully invariant subgroups are intermediately fully invariant; and for torsion-free groups, this question comes down to the reduced case. Also, in a torsion group that is the sum of cyclic subgroups, its subgroup is shown to be intermediately inert if and only if it is commensurable with some intermediately fully invariant subgroup.     

Description of periodic p-harmonic functions on Cayley tree

We show that any periodic (with respect to normal subgroups of finite index of the group representation of the Cayley tree) p-harmonic function on a Cayley tree is a constant. For some normal subgroups of infinite index we describe a class of (non-constant) periodic p-harmonic functions. We also prove that linear combinations of the p-harmonic functions described for normal subgroups of infinite index are also p-harmonic.