Multicomplex algebras on polynomials and generalized Hamilton dynamics

Generator of the complex algebra within the framework of general formulation obeys the quadratic equation. In this paper we explore multicomplex algebra with the generator obeying n-order polynomial equation with real coefficients. This algebra induces generalized trigonometry ((n+1)-gonometry), underlies of the nth order oscillator model and nth order Hamilton equations. The solution of an evolution equation generated by (n×n) matrix is represented via the set of (n+1)-gonometric functions. The general form of the first constant of motion of the evolution equation is established.     

Determination of a matrix function using the divided difference method of Newton and the interpolation technique of Hermite

Computing a function f(A) of an n-by-n matrix A is a frequently occurring problem in control theory and other applications. In this paper we introduce an effective approach for the determination of matrix function f(A). We propose a new technique which is based on the extension of Newton divided difference and the interpolation technique of Hermite and using the eigenvalues of the given matrix A. The new algorithm is tested on several problems to show the efficiency of the presented method. Finally, the application of this method in control theory is highlighted.     

Linear unbiased approximators of the disturbances in the standard linear model

The least squares residuals from the standard linear model have a variance matrix which is a function of the n × q matrix of observations on the regressors. We examine two classes of residuals which do not suffer from this defect. Our first class of residuals (LUZ residuals) has a variance matrix which is a scalar multiple of an n × n idempotent matrix of rank n ? q specified by the user, and our second class of residuals (LUS residuals) has a variance matrix which is a scalar multiple of the (n ? q)×(n ? q) identity matrix.     

A new class of polynomial primal–dual methods for linear and semidefinite optimization

We propose a new class of primal–dual methods for linear optimization (LO). By using some new analysis tools, we prove that the large-update method for LO based on the new search direction has a polynomial complexity of O(n^4/(4+ρ)log(n/ε)) iterations, where ρ∈[0,2] is a parameter used in the system defining the search direction. If ρ=0, our results reproduce the well-known complexity of the standard primal–dual Newton method for LO. At each iteration, our algorithm needs only to solve a linear equation system. An extension of the algorithms to semidefinite optimization is also presented.     

Lattice-Ordered Matrix Rings Over Totally Ordered Rings

For an n ×n matrix algebra over a totally ordered integral domain, necessary and sufficient conditions are derived such that the entrywise lattice order on it is the only lattice order (up to an isomorphism) to make it into a lattice-ordered algebra in which the identity matrix is positive. The conditions are then applied to particular integral domains. In the second part of the paper we consider n ×n matrix rings containing a positive n-cycle over totally ordered rings. Finally a characterization of lattice-ordered matrix ring with the entrywise lattice order is given.     

Two applications of the subnormality of the Hessenberg matrix related to general orthogonal polynomials

In this paper we prove two consequences of the subnormal character of the Hessenberg matrix D when the hermitian matrix M of an inner product is a moment matrix. If this inner product is defined by a measure supported on an algebraic curve in the complex plane, then D satisfies the equation of the curve in a noncommutative sense. We also prove an extension of the Krein theorem for discrete measures on the complex plane based on properties of subnormal operators.     

Filter matrix based on interpolation wavelets for solving Fredholm integral equations

The interpolation wavelet is used to solve the Fredholm integral equation of the second kind in this study. Hence, by the extension of interpolation wavelets that [−1, 1] is divided to 2^N+1 (N ⩾  − 1) subinterval, we have polynomials with a degree less than M + 1 in each new interval. Therefore, by considering the two-scale relation the filter coefficients and filter matrix are used as the proof of theorems. The important point is interpolation wavelets lead to more sparse matrix when we try to solve integral equation by an approximate kernel decomposed to a lower and upper resolution. Using n-time, where (n ⩾ 2), two-scale relation in this method errors of approximate solution as O((2^−(N+1))ⁿ⁺¹). Also, the filter coefficient simplifies the proof of some theorems and the order of convergence is estimated by numerical errors.     

Spectral analysis of nonselfadjoint Schrödinger operators with a matrix potential

Dissipative Schrödinger operators with a matrix potential are studied in L₂((0,∞);E)(dimE=n<∞) which are extension of a minimal symmetric operator L₀ with defect index (n,n). A selfadjoint dilation of a dissipative operator is constructed, using the Lax-Phillips scattering theory, the spectral analysis of a dilation is carried out, and the scattering matrix of a dilation is founded. A functional model of the dissipative operator is constructed and its characteristic function's analytic properties are determined, theorems on the completeness of eigenvectors and associated vectors of a dissipative Schrödinger operator are proved.     

Large deviations of the extreme eigenvalues of random deformations of matrices

Consider a real diagonal deterministic matrix X _n of size n with spectral measure converging to a compactly supported probability measure. We perturb this matrix by adding a random finite rank matrix, with delocalized eigenvectors. We show that the joint law of the extreme eigenvalues of the perturbed model satisfies a large deviation principle in the scale n, with a good rate function given by a variational formula. We tackle both cases when the extreme eigenvalues of X _n converge to the edges of the support of the limiting measure and when we allow some eigenvalues of X _n , that we call outliers, to converge out of the bulk. We can also generalise our results to the case when X _n is random, with law proportional to e ^{?n Tr V(X)} dX, for V growing fast enough at infinity and any perturbation of finite rank.     

Bi-resolving Graph Homomorphisms and Extensions of Bi-closing codes

Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving homomorphisms and give several sufficient conditions for a bi-resolving homomorphism to have a bi-covering extension with an irreducible domain. Using these results, we prove that a bi-closing code between subshifts can be extended to an n-to-1 code between irreducible shifts of finite type for all large n.     

Holomorphic Solutions of a Functional Equation Related to Nonlinear Difference Systems

Here we consider the following functional equation, $$\Psi(X(x,\Psi(x)))=Y(x, \Psi(x)),$$ where X(x, y) and Y(x, y) are holomorphic functions in |x| < δ ₁, |y| < δ ₁. When we consider a nonlinear simultaneous system of two variables difference equations, we can reduce it to a single difference equation of first order by a solution Ψ of the above functional equation. We obtain a matrix by the linear terms of functions X and Y. When the all eigenvalues of the matrix are equal to 1, it is difficult to have a solution of the above functional equation. In the present paper, we derive a formal solution of the above functional equation under the condition. Further we prove the existence of a solution which is holomorphic and have an asymptotically expansion of the formal solution. Moreover, we will show an example of nonlinear difference system such that our results are applicable.     

Switchings, extensions, and reductions in central digraphs

A directed graph is called central if its adjacency matrix A satisfies the equation A²=J, where J is the matrix with a 1 in each entry. It has been conjectured that every central directed graph can be obtained from a standard example by a sequence of simple operations called switchings, and also that it can be obtained from a smaller one by an extension. We disprove these conjectures and present a general extension result which, in particular, shows that each counterexample extends to an infinite family.     

Basis problems for matrix valued functions

Basis problems for self-adjoint matrix valued functions are studied. We suggest a new and nonstandard method to solve basis problems both in finite and infinite dimensional spaces. Although many results in this paper are given for operator functions in infinite dimensional Hilbert spaces, but to demonstrate practicability of this method and to present a full solution of basis problems, in this paper we often restrict ourselves to matrix valued functions which generate Rayleigh systems on the n-dimensional complex space Cn. The suggested method is an improvement of an approach given recently in our paper [M. Hasanov, A class of nonlinear equations in Hilbert space and its applications to completeness problems, J. Math. Anal. Appl. 328 (2007) 1487-1494], which is based on the extension of the resolvent of a self-adjoint operator function to isolated eigenvalues and the properties of quadratic forms of the extended resolvent. This approach is especially useful for nonanalytic and nonsmooth operator functions when a suitable factorization formula fails to exist.     

Heuristics for exact nonnegative matrix factorization

The exact nonnegative matrix factorization (exact NMF) problem is the following: given an m-by-n nonnegative matrix X and a factorization rank r, find, if possible, an m-by-r nonnegative matrix W and an r-by-n nonnegative matrix H such that \(X = WH\). In this paper, we propose two heuristics for exact NMF, one inspired from simulated annealing and the other from the greedy randomized adaptive search procedure. We show empirically that these two heuristics are able to compute exact nonnegative factorizations for several classes of nonnegative matrices (namely, linear Euclidean distance matrices, slack matrices, unique-disjointness matrices, and randomly generated matrices) and as such demonstrate their superiority over standard multi-start strategies. We also consider a hybridization between these two heuristics that allows us to combine the advantages of both methods. Finally, we discuss the use of these heuristics to gain insight on the behavior of the nonnegative rank, i.e., the minimum factorization rank such that an exact NMF exists. In particular, we disprove a conjecture on the nonnegative rank of a Kronecker product, propose a new upper bound on the extension complexity of generic n-gons and conjecture the exact value of (i) the extension complexity of regular n-gons and (ii) the nonnegative rank of a submatrix of the slack matrix of the correlation polytope.     

A centerless representation of the Virasoro algebra associated with the unitary circular ensemble

We consider the 2-dimensional Toda lattice tau functions τ_n(t,s;η,θ) deforming the probabilities τ_n(η,θ) that a randomly chosen matrix from the unitary group U(n), for the Haar measure, has no eigenvalues within an arc (η,θ) of the unit circle. We show that these tau functions satisfy a centerless Virasoro algebra of constraints, with a boundary part in the sense of Adler, Shiota and van Moerbeke. As an application, we obtain a new derivation of a differential equation due to Tracy and Widom, satisfied by these probabilities, linking it to the Painlevé VI equation.     

Qregularity and an extension of the Evans-Griffiths criterion to vector bundles on quadrics

Here we define the concept of Qregularity for coherent sheaves on a smooth quadric hypersurface Q_n⊂Pⁿ⁺¹. In this setting we prove analogs of some classical properties. We compare the Qregularity of coherent sheaves on Q_n with the Castelnuovo-Mumford regularity of their extension by zero in Pⁿ⁺¹. We also classify the coherent sheaves with Qregularity −∞. We use our notion of Qregularity in order to prove an extension of the Evans-Griffiths criterion to vector bundles on quadrics. In particular, we get a new and simple proof of Knörrer’s characterization of ACM bundles.     

An optimal logarithmic Sobolev inequality with Lipschitz constants

In this paper, we give an optimal logarithmic Sobolev inequality on Rn with Lipschitz constants. This inequality is a limit case of the Lp-logarithmic Sobolev inequality of Gentil (2003) [7] as p→∞. As a result of our inequality, we show that if a Lipschitz continuous function f on Rn fulfills some condition, then its Lipschitz constant can be expressed by using the entropy of f. We also show that a hypercontractivity of exponential type occurs in the heat equation on Rn. This is due to the Lipschitz regularizing effect of the heat equation.     

Source-type solution to nonlinear Fokker-Planck equation in one dimension

In this paper, we consider the following equation ut=(um)xx+(un)x, with the initial condition as Dirac measure. Attention is focused on existence, nonexistence, uniqueness and the asymptotic behavior near (0,0) of solution to the Cauchy’s problem. The special feature of this equation lies in nonlinear convection effect, i.e., the equation possesses nonlinear hyperbolic character as well as degenerate parabolic one. The situation leads to a more sophisticated mathematical analysis. To our knowledge, the solvability of singular solution to the equation has not been concluded yet. Here based on the previous works by the authors, we show that there exists a critical number n0=m+2 such that a unique source-type solution to this equation exists if 0≤n相似文献   

Possible spectra of totally positive matrices

For any given set S of n distinct positive numbers, we construct a symmetric n-by-n (strictly) totally positive matrix whose spectrum is S. Thus, in order to be the spectrum of an n-by-n totally positive matrix, it is necessary and sufficient that n numbers be positive and distinct.