次正规矩阵、次酉矩阵、次厄米特矩阵及反次厄米特矩阵

主要研究了下列几方面问题:(i)次酉矩阵、次厄米特矩阵及反次厄米特矩阵的特征值与次特征值;(ii)次正规矩阵、次酉矩阵、次厄米特矩阵及反次厄米特矩阵分别与正规矩阵、酉矩阵、厄米特矩阵及反厄米特矩阵之间的关系;(iii)次正规矩阵、次酉矩阵、次厄米特矩阵及反次厄米特矩阵之间的联系.     

次正定复矩阵次Schur补的一些性质

利用复矩阵的Schur补和次正定性,研究了次正定复矩阵的次Schur补的一些性质,得到了次正定复矩阵次Schur补的几个行列式不等式,将相关文献的相应结果由次正定次Hermite矩阵推广到次正定复矩阵.     

次正定Hermite矩阵次Schur补的性质

本文研究了次正定Hermite矩阵次Schur补的偏序,并利用这些偏序,得到了次正定Hermite矩阵的一些行列式不等式.     

次Hermite矩阵的对角化及次Hermite矩阵的应用

循环矩阵在理论及实际问题上都得到了广泛的应用,而循环矩阵是一类典型的次对称矩阵,此外Hadamare 矩阵中也涉及到了次对称矩阵,本文将对次对称矩阵进一步的推广,定义了次Hermite 矩阵及次正定的次Hermite 矩阵.并且讨论它们的对角化方法,得出了类以于Hermite 矩阵的一些结论,最后作为应用,讨论了次Hermite 矩阵的算子范数及F—范数的理论值。关键词次Hermite 矩阵次特征值及次特征向量次正定的次Hermite 矩阵.     

完美匹配树的次大和次小的最大特征值

本文讨论完美匹配树的次大和次小的最大特征值问题,得到了次大的最大特征值的上界的明确表达式并确定了达到此上界的极树,同时也得到了次小的最大特征值的下界并确定了相应的极树。     

次线性Duffing系统的多重次调和解

本文证明了，次线性Ｄｕｆｆｉｎｇ系统存在无穷多个高阶次调和解及次调和解列是无界的。     

无穷次可重整二次多项式的共形测度

利用无穷次可重整化二次多项式三维拼图的技巧, 证明了有复界无分支的无穷次可重整化二次多项式共形测度的遍历性.     

次亚正定矩阵的次Lōwner偏序

本文研究了次亚正定矩阵子阵的次Lōwner偏序，利用次Lōwner偏序，获得了几个用低阶矩阵的次亚正定性判别高阶矩阵次亚正定性的充要条件．     

次亚正定矩阵的次L(o)wner偏序

本文研究了次亚正定矩阵子阵的次L(o)wner偏序,利用次Lwner偏序,获得了几个用低阶矩阵的次亚正定性判别高阶矩阵次亚正定性的充要条件.     

函数的次微分性质

本文给出了函数的Fenchel次微分、Frechet次微分,Hadamard次微分,Gateaux次微分的一些重要性质,并对函数的性质尤其是凸性给出其次微分刻画。     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

Best approximation by downward sets with applications

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X     

The use of phase portraits to visualize and investigate isolated singular points of complex functions

ABSTRACT

Undergraduate students usually study Laurent series in a standard course of Complex Analysis. One of the major applications of Laurent series is the classification of isolated singular points of complex functions. Although students are able to find series representations of functions, they may struggle to understand the meaning of the behaviour of the function near isolated singularities. In this paper, I briefly describe the method of domain colouring to create enhanced phase portraits to visualize and study isolated singularities of complex functions. Ultimately this method for plotting complex functions might help to enhance students' insight, in the spirit of learning by experimentation. By analysing the representations of singularities and the behaviour of the functions near their singularities, students can make conjectures and test them mathematically, which can help to create significant connections between visual representations, algebraic calculations and abstract mathematical concepts.     

Comparison principle and analogues of the phragmen—lindelöf theorem for solutions of parabolic inequalities

It is well known that a Monotonicity Condition and a Coerciveness Condition principally lie in the basis of most results of the Theory of PDE's. The necessity of these important assumptions for the validity of a comparison principle and analogues of the Phragmen-Lindelöf theorem for solutions of quasilinear parabolic inequalities is discussed in the paper. In the first part of the work we introduce a new concept of monotonicity for nonlinear differential operators-nonlinear monotonicity concept-and on its basis we obtain new phenomena for solutions, subsolutions and supersolutions of the well-known quasilinear differential equations. In the second part we omit the current coerciveness condition and change it by a weaker one. In spite of this we obtain a series of new qualitative properties of solutions for wide classes of quasilinear parabolic inequalities. Most of these properties are also new for solutions of the well-known equations, which we consider in the paper.     

Schreier rewriting beyond the classical setting Dedicated to our teacher Alfred Lvovich Shmelkin on his 70th birthday

Using actions of free monoids and free associative algebras, we establish some Schreier-type formulas involving ranks of actions and ranks of subactions in free actions or Grassmann-type relations for the ranks of intersections of subactions of free actions. The coset action of the free group is used to establish a generalization of the Schreier formula in the case of subgroups of infinite index. We also study and apply large modules over free associative and free group algebras.     

A quantum spin system with random interactions I

We study a quantum spin glass as a quantum spin system with random interactions and establish the existence of a family of evolution groups {τ_t(ω)}_ω∈/Ω of the spin system. The notion of ergodicity of a measure preserving group of automorphisms of the probability space Ω, is used to prove the almost sure independence of the Arveson spectrum Sp(τ(ω)) of τ_t(ε). As a consequence, for any family of (τ(ω),β) — KMS states {ρ(ω)}, the spectrum of the generator of the group of unitaries which implement τ(ω) in the GNS representation is also almost surely independent of ω.     

Nonexistence in power and gamma density regression, sum of nonnegative terms

When we use the power function α(c x)^b and gamma density αx^be^-cx to fit the data by the least squares method, we have to address the question of existence. The closure of the set of each type of these functions defined on a finite domain is determined. We derive a way to determine the closure of a sum of nonnegative functions if the closures of the summands are available.     

Sur l'existence, l'unicité, la stabilité et les propriétés de grandes déviations des solutions d'équations différentielles stochastiques rétrogrades à horizon aléatoire. Application à des problèmes de perturbations singulières

We study the existence, uniqueness and stability of solutions of backward stochastic differential equations with random terminal time under new assumptions; then we establish a large deviation principle for the solutions of such equations, related to a family of Markov processes, the diffusion coefficient of which tends to zero. Finally we apply these results to the analysis of some singular perturbation problems for a class of nonlinear partial differential equations.     

Boundary-Value Problems of the Theory of Thin and Nonthin Orthotropic Shells with Account of Nonlinearly Elastic Properties and Low Shear Rigidity of Composite Materials

The basic geometric and physical relations and resolving equations of the theory of thin and nonthin orthotropic composite shells with account of nonlinear properties and low shear rigidity of their materials are presented. They are derived based on two theories, namely the theory of anisotropic shells employing the Timoshenko or Kirchhoff-Love hypothesis and the nonlinear theory of elasticity and plasticity of anisotropic media in combination with the Lagrange variational principle. The procedure and algorithm for the numerical solution of nonlinear (linear) problems are based on the method of successive approximations, the difference-variational method, and the Lagrange multiplier method. Calculations of the stress-strain state for a spherical shell with a circular opening loaded with internal pressure are presented. The effect of transverse shear strains and physical nonlinearity of the material on the distribution of maximum deflections and circumferential stresses in the shell, obtained according to two variants of the shell theories, is studied. A comparison of the results of the problem solution in linear and nonlinear statements with and without account of the shell shear strains is given. The numerical data obtained for thin and nonthin (medium thick) composite shells are analyzed.     

Clustering Methods in Microarrays

Summary DCT Given a finite set of points in an Euclidean space the \emph{spanning tree} is a tree of minimal length having the given points as vertices. The length of the tree is the sum of the distances of all connected point pairs of the tree. The clustering tree with a given length of a given finite set of points is the spanning tree of an appropriately chosen other set of points approximating the given set of points with minimal sum of square distances among all spanning trees with the given length. DCM A matrix of real numbers is said to be column monotone orderable if there exists an ordering of columns of the matrix such that all rows of the matrix become monotone after ordering. The {\emph{monotone sum of squares of a matrix}} is the minimum of sum of squares of differences of the elements of the matrix and a column monotone orderable matrix where the minimum is taken on the set of all column monotone orderable matrices. Decomposition clusters of monotone orderings of a matrix is a clustering ofthe rows of the matrix into given number of clusters such that thesum of monotone sum of squares of the matrices formed by the rowsof the same cluster is minimal.DCP A matrix of real numbers is said to be column partitionable if there exists a partition of the columns such that the elements belonging to the same subset of the partition are equal in each row. Given a partition of the columns of a matrix the partition sum of squares of the matrix is the minimum of the sum of square of differences of the elements of the matrix and a column partitionable matrix where the minimum is taken on the set of all column partitionable matrices. Decomposition of the rows of a matrix into clusters of partitions is the minimization of the corresponding partition sum of squares given the number of clusters and the sizes of the subsets of the partitions.