Classification of simple weight Virasoro modules with a finite-dimensional weight space

We show that the support of a simple weight module over the Virasoro algebra, which has an infinite-dimensional weight space, coincides with the weight lattice and that all non-trivial weight spaces of such module are infinite-dimensional. As a corollary we obtain that every simple weight module over the Virasoro algebra, having a non-trivial finite-dimensional weight space, is a Harish-Chandra module (and hence is either a simple highest or lowest weight module or a simple module from the intermediate series). This implies positive answers to two conjectures about simple pointed and simple mixed modules over the Virasoro algebra.     

Computing simple circuits from a set of line segments

We address the problem of connecting line segments to form the boundary of a simple polygon—a simple circuit. However, not every set of segments can be so connected. We present anO(n logn)-time algorithm to determine whether a set of segments, constrained so that each segment has at least one endpoint on the boundary of the convex hull of the segments, admits a simple circuit. Furthermore, this technique can also be used to compute a simple circuit of minimum perimeter, or a simple circuit that bounds the minimum area, with no increase in computational complexity.     

二部图的单特征值

一个图的特征值通常指的是它的邻接矩阵的特征值,在图的所有特征值中,重数为1的特征值即所谓的单特征值具有特殊的重要性.确定一个图的单特征值是一个比较困难的问题,主要是没有一个通用的方法.1969年,Petersdorf和Sachs给出了点传递图单特征值的取值范围,但是对于具体的点传递图还需要根据图本身的特性来确定它的单特征值.给出一类正则二部图,它们是二面体群的凯莱图,这类图的单特征值中除了它的正、负度数之外还有0或者±1,而它们恰好是Petersdorf和Sachs所给出的单特征值范围内的中间取值.     

Two-parameter quantum deformation of Lie superalgebras

It is known that the quantum deformation of the enveloping superalgebra corresponding to the structure of the corresponding quantum group is given by a simple root system of the corresponding algebra. In this work we attempt to make a two-parameter quantum deformation in the non-standard simple root system with two odd simple roots.     

On Spectra of Almost Simple Extensions of Even-Dimensional Orthogonal Groups

The spectrum of a finite group is the set of the orders of its elements. We consider the problem that arises within the framework of recognition of finite simple groups by spectrum: Determine all finite almost simple groups having the same spectrum as its socle. This problem was solved for all almost simple groups with exception of the case that the socle is a simple even-dimensional orthogonal group over a field of odd characteristic. Here we address this remaining case and determine the almost simple groups in question.Also we prove that there are infinitely many pairwise nonisomorphic finite groups having the same spectrum as the simple 8-dimensional symplectic group over a field of characteristic other than 7.     

On Weyl groups in minimal simple groups of finite Morley rank

We prove that generous non-nilpotent Borel subgroups of connected minimal simple groups of finite Morley rank are self-normalizing. We use this to introduce a uniform approach to the analysis of connected minimal simple groups of finite Morley rank through a case division incorporating four mutually exclusive classes of groups. We use these to analyze Carter subgroups and Weyl groups in connected minimal simple groups of finite Morley rank. Finally, the self-normalization theorem is applied to give a new proof of an important step in the classification of simple groups of finite Morley rank of odd type.     

Strong reality of finite simple groups

The classification of finite simple strongly real groups is complete. It is easy to see that strong reality for every nonabelian finite simple group is equivalent to the fact that each element can be written as a product of two involutions. We thus obtain a solution to Problem 14.82 of the Kourovka Notebook from the classification of finite simple strongly real groups.     

The diameter and radius of simple graphs

This paper develops some properties of simple blocks—block graphs which are determined up to isomorphism by the degrees of their vertices. It is first shown that if G is a simple block graph on six or more points, then G cannot be minimal or critical and must contain a triangle—have girth three.Then the most useful necessary conditions for a graph to be simple are established; if a graph is simple, it has diameter less than or equal to three and dradius less than or equal to two.     

Approximation and the spectral multiplicity of special automorphisms

Summary Conditions have been given [7] under which a special automorphism over an automorphism admitting a simple approximation again admits a simple approximation, and so has simple spectrum.In this paper using different techniques to those employed in [7], we obtain improved results in the same direction. Specifically, conditions are given for a special automorphism over an automorphism, which admits either a simple approximation, or an approximation with suitable speed, to have bounded spectral multiplicity. Furthermore, we obtain as a corollary a result on primitive automorphisms, which partially generalises a result appearing in [4].     

A Note on Collars of Simple Closed Geodesics

For compact hyperbolic Riemann surfaces, the collar theorem gives a lower bound on the distance between a simple closed geodesic and all other simple closed geodesics that do not intersect the initial geodesic. Here it is shown that there are two possible configurations, and in each configuration there is a natural collar width associated to a simple closed geodesic. If one extends the natural collar of a simple closed geodesic α by ε >0, then the extended collar contains an infinity of simple closed geodesics that do not intersect α.Mathematics Subject Classiffications (2000). primary: 30F45; secondary: 32G07     

带等式约束的光滑优化问题的一类新的精确罚函数

罚函数方法是将约束优化问题转化为无约束优化问题的主要方法之一. 不包含目标函数和约束函数梯度信息的罚函数, 称为简单罚函数. 对传统精确罚函数而言, 如果它是简单的就一定是非光滑的; 如果它是光滑的, 就一定不是简单的. 针对等式约束优化问题, 提出一类新的简单罚函数, 该罚函数通过增加一个新的变量来控制罚项. 证明了此罚函数的光滑性和精确性, 并给出了一种解决等式约束优化问题的罚函数算法. 数值结果表明, 该算法对于求解等式约束优化问题是可行的.     

On the Buchstaber Invariant of Simple Convex 3-Polytopes

In this paper the author gives a method of constructing characteristic matrices,and uses it to determine the Buchstaber invariants of all simple convex 3-polytopes,which imply that each simple convex 3-polytope admits a characteristic function.As a further application of the method,the author also gives a simple new proof of five-color theorem.     

Reconstructing a simple game from a uniparametric family of allocations

Several relationships between simple games and a particular type of solutions for cooperative games are studied in this paper. These solutions belong to the set of semivalues and they are related to a unique parameter that explicitly provides their weighting coefficients. Through the allocations offered by this family of solutions, so-called binomial semivalues, and also from their respective potentials, some characteristics of the simple games can be recovered. The paper analyzes the capacity of binomial semivalues to summarize the structure of simple games, and, moreover, a property of separation among simple games is given.     

Rotational symmetry and properties of the ancient solutions of Ricci flow on surfaces

We give a simple proof for the rotational symmetry of ancient solutions of Ricci flow on surfaces. As a consequence we obtain a simple proof of some results of Daskalopoulos, Hamilton and Sesum on the a priori estimates for the ancient solutions of Ricci flow on surfaces. We also give a simple proof for the solution to be a Rosenau solution under some mild conditions on the solutions of Ricci flow on surfaces.     

On Homotopy of connected graphs having the same degree function

Let denote the set of simple graphs having the degree function . It is known that any two graphs from are homotopic in the sense that one can be obtained from the other by a series of simple two-edge switches so that every intermediate graph is in . Let denote the set of simple graphs having at most k components. A natural question arises whether it is possible to extend the above homotopy result on the class , and in particular, whether it is possible to obtain a connected simple graph from another connected simple graph of the same degree function by a series of two edge switches preserving connectivity. In this paper we give an answer to this question. We also consider two-edge switches of a special type and single out some classes of graphs for which these special operations provide the corresponding homotopy between its members.     

The desirability relation of simple games

We prove some properties of simple games with a complete desirability relation, and investigate the relationships between the desirability of a simple game G and that of some simple games that are derived from G. We also provide an example of a proper simple game that has a complete and acyclic desirability relation but is not a weighted majority game.     

Local and Subquotient Inheritance of Simplicity in Jordan Systems

In this paper we prove that the local algebras of a simple Jordan pair are simple. Jordan pairs all of which local algebras are simple are also studied, showing that they have a nonzero simple heart, which is described in terms of powers of the original pair. Similar results are given for Jordan triple systems and algebras. Finally, we characterize the inner ideals of a simple pair which determine simple subquotients, answering the question posed by O. Loos and E. Neher (1994, J. Algebra166, 255–295).     

Simple artinian rings as sums of nilpotent subrings

Decompositions of simple artinian rings as additive sums of nilpotent subrings are considered. In particular, necessary and sufficent conditions for minimal decompositions are found in terms of the underlying division ring. This is used to prove that any algebra with 1 can be unitarily embedded into a simple algebra with 1 which is a sum of four subalgebras with zero multiplication and also into a simple algebra which is a sum of three nilpotent subalgebras of degree 3. Since our proof is constructive and is based on simple artinian rings, the latter result can be viewed as an extension and a strengthened version of Bokut's theorem, [2].     

A Generic Identification Theorem for L1-groups of finite Morley rank

This paper provides a method for identifying “sufficiently rich” simple groups of finite Morley rank with simple algebraic groups over algebraically closed fields. Special attention is given to the even type case, and the paper contains a number of structural results about simple groups of finite Morley rank and even type.