On multiplicities of simple subquotients in generalized Verma modules

We reduce the problem on multiplicities of simple subquotients in an -stratified generalized Verma module to the analogous problem for classical Verma modules.     

Resonances in bounded media: Nonlinear and boundary effects

We study the response of nonlinear wave systems in bounded domains at or near resonance. There are typically two qualitatively distinct types of response which may be observed relating to whether or not higher harmonics are themselves resonant. We introduce a variety of nonlinear model problems at or near resonance and study the subsequent response. We explain how the features of this problem such as the form of nonlinearity, boundary conditions, and the nature of spectrum play a fundamental role in the qualitative nature of the response. Numerical simulations are carried out to provide further explanation and comparison with analytic approximations. The results of this study provide a better understanding of the impact and interplay between nonlinear and boundary effects and thus in turn will contribute to providing new insights into various physically motivated problems in acoustics and other settings.     

图簇S_δ~G的补图的色等价图的结构性质

通过研究SGδ型图簇的伴随多项式的因式分解,证明了这类图簇的补图的色等价图的结构性质和非色唯一性。     

Generating Uniformly Distributed Random 2‐Designs with Block Size 3

Jacobson and Matthews introduced the most hopeful method known for efficiently generating uniformly distributed random Latin squares. Cameron conjectures that the same Markov chain will also generate all of the other generalized 2‐designs with block size 3 uniformly at random. For a generalization of Latin squares, we give an affirmative result for any admissible parameter values. We also give the first insight and analysis into a generalization of the 1‐factorization of the complete graph by giving an affirmative result for some admissible parameter values. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 368–380, 2012     

Flexible incomplete Cholesky factorization with multi‐parameters to control the number of nonzero elements in preconditioners

An incomplete Cholesky (IC) factorization with multi‐parameters is presented. The marked virtue of the proposed IC factorization algorithm is to dynamically control the number of nonzero elements in each column of the IC factorization preconditioner L with the help of these involved parameters. Parameter setting strategies are also given. Numerical results show that the total computing time for both computation of the preconditioner L and iterative solution is evidently reduced for almost all test matrices. In general, these parameters can obviously enhance the effectiveness and performance of the IC factorization. Copyright © 2011 John Wiley & Sons, Ltd.     

A class of non‐graded left‐symmetric algebraic structures on the Witt algebra

We classify the compatible left‐symmetric algebraic structures on the Witt algebra satisfying certain non‐graded conditions. It is unexpected that they are Novikov algebras. Furthermore, as applications, we study the induced non‐graded modules of the Witt algebra and the induced Lie algebras by Novikov‐Poisson algebras’ approach and Balinskii‐Novikov's construction.     

Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations

New methods for computing eigenvectors of symmetric block tridiagonal matrices based on twisted block factorizations are explored. The relation of the block where two twisted factorizations meet to an eigenvector of the block tridiagonal matrix is reviewed. Based on this, several new algorithmic strategies for computing the eigenvector efficiently are motivated and designed. The underlying idea is to determine a good starting vector for an inverse iteration process from the twisted block factorizations such that a good eigenvector approximation can be computed with a single step of inverse iteration.     

A fitting algorithm for real coefficient polynomial rooting

A new algorithm for computing all roots of polynomials with real coefficients is introduced. The principle behind the new algorithm is a fitting of the convolution of two subsequences onto a given polynomial coefficient sequence. This concept is used in the initial stage of the algorithm for a recursive slicing of a given polynomial into degree-2 subpolynomials from which initial root estimates are computed in closed form. This concept is further used in a post-fitting stage where the initial root estimates are refined to high numerical accuracy. A reduction of absolute root errors by a factor of 100 compared to the famous Companion matrix eigenvalue method based on the unsymmetric QR algorithm is not uncommon. Detailed computer experiments validate our claims.     

Strongly Irreducible Submodules of Modules

Strongly irreducible submodules of modules are defined as follows： A submodule N of an Rmodule M is said to be strongly irreducible if for submodules L and K of M, the inclusion L ∩ K ∈ N implies that either L ∈ N or K ∈ N. The relationship among the families of irreducible, strongly irreducible, prime and primary submodules of an R-module M is considered, and a characterization of Noetherian modules which contain a non-prime strongly irreducible submodule is given.     

Cotilting modules with finite left perpendicular categories

We characterize a cotilting module T such that the left perpendicular category ⊥ T is of finite type.