某些级数的无理性

本文证明了某些与二阶线性递推数列有关的无穷级数的和的无理性．特别，推广了某些与Ｆｉｂｏｎａｃｃｉ和Ｌｕｃａｓ数列有关的无理性结果     

关于Mahler超越小数的无理性度量

本文在一般条件下研究了Mahler超越小数的无理性度量,给出无理性指数的上、下界估计及某些特殊小数的无理性指数的精确值．     

Structure of principal eigenvectors and genetic diversity

The main concern of this paper is long-term genotypic diversity. Genotypes are represented as finite sequences (s₁,s₂,…,s_n), where the entries {s_i} are drawn from a finite alphabet. The mutation matrix is given in terms of Hamming distances. It is proved that the long time behavior of solutions for a class of genotype evolution models is governed by the principal eigenvectors of the sum of the mutation and fitness matrices. It is proved that the components of principal eigenvectors are symmetric and monotonely decreasing in terms of Hamming distances whenever the fitness matrix has those properties.     

On eigenvectors of mixed graphs with exactly one nonsingular cycle

Let G be a mixed graph. The eigenvalues and eigenvectors of G are respectively defined to be those of its Laplacian matrix. If G is a simple graph, [M. Fiedler: A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory, Czechoslovak Math. J. 25 (1975), 619–633] gave a remarkable result on the structure of the eigenvectors of G corresponding to its second smallest eigenvalue (also called the algebraic connectivity of G). For G being a general mixed graph with exactly one nonsingular cycle, using Fiedler’s result, we obtain a similar result on the structure of the eigenvectors of G corresponding to its smallest eigenvalue. Supported by National Natural Science Foundation of China (10601001), Anhui Provincial Natural Science Foundation (050460102), NSF of Department of Education of Anhui province (2004kj027), the project of innovation team on basic mathematics of Anhui University, and the project of talents group construction of Anhui University.     

On Edge Singularity and Eigenvectors of Mixed Graphs

Let G be a mixed glaph which is obtained from an undirected graph by orienting some of its edges. The eigenvalues and eigenvectors of G are, respectively, defined to be those of the Laplacian matrix L（G） of G. As L（G） is positive semidefinite, the singularity of L（G） is determined by its least eigenvalue λ1 （G）. This paper introduces a new parameter edge singularity εs（G） that reflects the singularity of L（G）, which is the minimum number of edges of G whose deletion yields that all the components of the resulting graph are singular. We give some inequalities between εs（G） and λ1 （G） （and other parameters） of G. In the case of εs（G） = 1, we obtain a property on the structure of the eigenvectors of G corresponding to λ1 （G）, which is similar to the property of Fiedler vectors of a simple graph given by Fiedler.     

Variational equations for the eigenvalues and eigenvectors of nonsymmetric matrices

The tracking of eigenvalues and eigenvectors for parameterized matrices is of major importance in optimization and stability problems. In the present paper, we consider a one-parameter family of matrices with distinct eigenvalues. A complete system of differential equations is developed for both the eigenvalues and the right and left eigenvectors. The computational feasibility of the differential system is demonstrated by means of a numerical example.The work of R. Kalaba and L. Tesfatsion was partially supported by the National Science Foundation under Grant No. ENG-77-28432 and by the National Institutes of Health under Grant No. GM-23732-03.     

Convergence theory of exact interpolation scheme for computing several eigenvectors

An asymptotic convergence analysis of a new multilevel method for numerical solution of eigenvalues and eigenvectors of symmetric and positive definite matrices is performed. The analyzed method is a generalization of the original method that has recently been proposed by R. Ku?el and P. Vaněk (DOI: 10.1002/nla.1975) and uses a standard multigrid prolongator matrix enriched by one full column vector, which approximates the first eigenvector. The new generalized eigensolver is designed to compute eigenvectors. Their asymptotic convergence in terms of the generalized residuals is proved, and its convergence factor is estimated. The theoretical analysis is illustrated by numerical examples. Copyright © 2015 John Wiley & Sons, Ltd.     

A birational embedding with two Galois points for quotient curves

A criterion for the existence of a birational embedding with two Galois points for quotient curves is presented. We apply our criterion to several curves, for example, some cyclic subcovers of the Giulietti–Korchmáros curve or of the curves constructed by Skabelund. New examples of plane curves with two Galois points are described, as plane models of such quotient curves.     

On the eigenvectors of the q‐Bernstein operators

In this article, both the eigenvectors and the eigenvalues of the q‐Bernstein operators have been studied. Explicit formulae are presented for the eigenvectors, whose limit behavior is determined both in the case 0 < q < 1 and in the case q > 1. Because the classical case, where q = 1, was investigated exhaustively by S. Cooper and S. Waldron back in 2000, the present article also discusses the related similarities and distinctions with the results in the classical case. Copyright © 2013 John Wiley & Sons, Ltd.     

Nonsingularity and group invertibility of linear combinations of two k-potent matrices

An n × n complex matrix A is said to be k-potent if A ^k = A. Let T ₁ and T ₂ be k-potent and c ₁ and c ₂ be two nonzero complex numbers. We study the range space, null space, nonsingularity and group invertibility of linear combinations T = c ₁ T ₁ + c ₂ T ₂ of two k-potent matrices T ₁ and T ₂.     

On a special basis of approximate eigenvectors with local supports for an isolated narrow cluster of eigenvalues of a symmetric tridiagonal matrix

Let $ \tilde \lambda Let be an approximate eigenvalue of multiplicity m _c = n − r of an n × n real symmetric tridiagonal matrix T having nonzero off-diagonal entries. A fast algorithm is proposed (and numerically tested) for deleting m _c rows of T− I so that the condition number of the r × n matrix B formed of the remaining r rows is as small as possible. A special basis of m _c vectors with local supports is constructed for the subspace kerB. These vectors are approximate eigenvectors of T corresponding to . Another method for deleting m _c rows of T− I is also proposed. This method uses a rank-revealing QR decomposition; however, it requires a considerably larger number of arithmetic operations. For the latter algorithm, the condition number of B is estimated, and orthogonality estimates for vectors of the special basis of kerB are derived. Original Russian Text ? S.K. Godunov, A.N. Malyshev, 2008, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2008, Vol. 48, No. 7, pp. 1156–1166.     

Random weighted projections,random quadratic forms and random eigenvectors

We present a concentration result concerning random weighted projections in high dimensional spaces. As applications, we prove (1) New concentration inequalities for random quadratic forms. (2) The infinity norm of most unit eigenvectors of a random ±1 matrix is of order . (3) An estimate on the threshold for the local semi‐circle law which is tight up to a factor. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 792–821, 2015     

Divisor class group and canonical class of rings defined by ideals of pfaffians

In this paper we study the rings defined by ideals of pfaffians of a skew symmetric matrix of indeterminates. We analyze the case in which the pfaffians are not necessarily of fixed size. We prove that such rings are Cohen-Macaulay normal domains and we compute the divisor class group and the canonical class. It allows us to determine which of our rings are Gorenstein.     

Galois Stability, Integrality and Realization Fields for Representations of Finite Abelian Groups

For a given field F of characteristic 0 we consider a normal extension E/F of finite degree d and finite Abelian subgroups GGL _n (E) of a given exponent t. We assume that G is stable under the natural action of the Galois group of E/F and consider the fields E=F(G) that are obtained via adjoining all matrix coefficients of all matrices gG to F. It is proved that under some reasonable restrictions for n, any E can be realized as F(G), while if all coefficients of matrices in G are algebraic integers, there are only finitely many fields E=F(G) for prescribed integers n and t or prescribed n and d.