Some properties of sharp Hessenberg pairs

Let F denote a field and let V denote a vector space over F with finite positive dimension. We consider an ordered pair of F-linear transformations A:V→V and A^∗:V→V that satisfy the following conditions: (i) each of A,A^∗ is diagonalizable on V; (ii) there exists an ordering of the eigenspaces of A such that A^∗V_i⊆V₀+V₁+?+V_i+1 for 0?i?d, where V_-1:=0 and V_d+1:=0; (iii) there exists an ordering of the eigenspaces of A^∗ such that for 0?i?δ, where and . We call such a pair a Hessenberg pair on V. It is known that if the Hessenberg pair A,A^∗ on V is irreducible then d=δ and for 0?i?d the dimensions of V_i and coincide. We say a Hessenberg pair A,A^∗ on V is sharp whenever it is irreducible and .In this paper, we give the definitions of a Hessenberg system and a sharp Hessenberg system. We discuss the connection between a Hessenberg pair and a Hessenberg system. We also define a finite sequence of scalars called the parameter array for a sharp Hessenberg system, which consists of the eigenvalue sequence, the dual eigenvalue sequence and the split sequence. We calculate the split sequence of a sharp Hessenberg system. We show that a sharp Hessenberg pair is a tridiagonal pair if and only if there exists a nonzero nondegenerate bilinear form on V that satisfies 〈Au,v〉=〈u,Av〉 and 〈A^∗u,v〉=〈u,A^∗v〉 for all u,v∈V.     

Mixed Artin-Tate motives over number rings

This paper studies Artin-Tate motives over bases , for a number field F. As a subcategory of motives over S, the triangulated category of Artin-Tate motives is generated by motives , where ? is any finite map. After establishing the stability of these subcategories under pullback and pushforward along open and closed immersions, a motivic t-structure is constructed. Exactness properties of these functors familiar from perverse sheaves are shown to hold in this context. The cohomological dimension of mixed Artin-Tate motives () is two, and there is an equivalence .     

Note on the energy of regular graphs

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all the eigenvalues of its adjacency matrix A(G). Let n,m, respectively, be the number of vertices and edges of G. One well-known inequality is that , where λ₁ is the spectral radius. If G is k-regular, we have . Denote . Balakrishnan [R. Balakrishnan, The energy of a graph, Linear Algebra Appl. 387 (2004) 287-295] proved that for each ?>0, there exist infinitely many n for each of which there exists a k-regular graph G of order n with k<n-1 and , and proposed an open problem that, given a positive integer n?3, and ?>0, does there exist a k-regular graph G of order n such that . In this paper, we show that for each ?>0, there exist infinitely many such n that . Moreover, we construct another class of simpler graphs which also supports the first assertion that .     

Critical points between varieties generated by subspace lattices of vector spaces

We denote by the semilattice of all compact congruences of an algebra A. Given a variety V of algebras, we denote by the class of all semilattices isomorphic to for some A∈V. Given varieties V and W of algebras, the critical point of V under W is defined as . Given a finitely generated variety V of modular lattices, we obtain an integer ?, depending on V, such that for any n≥? and any field F.In a second part, using tools introduced in Gillibert (2009) [5], we prove that:

     

A classification of sharp tridiagonal pairs

Let F denote a field and let V denote a vector space over F with finite positive dimension. We consider a pair of linear transformations A:V→V and A^∗:V→V that satisfy the following conditions: (i) each of A,A^∗ is diagonalizable; (ii) there exists an ordering of the eigenspaces of A such that A^∗V_i⊆V_i-1+V_i+V_i+1 for 0?i?d, where V_-1=0 and V_d+1=0; (iii) there exists an ordering of the eigenspaces of A^∗ such that for 0?i?δ, where and ; (iv) there is no subspace W of V such that AW⊆W, A^∗W⊆W, W≠0, W≠V. We call such a pair a tridiagonal pair on V. It is known that d=δ and for 0?i?d the dimensions of coincide. The pair A,A^∗ is called sharp whenever . It is known that if F is algebraically closed then A,A^∗ is sharp. In this paper we classify up to isomorphism the sharp tridiagonal pairs. As a corollary, we classify up to isomorphism the tridiagonal pairs over an algebraically closed field. We obtain these classifications by proving the μ-conjecture.     

Well-posedness for the Navier-Stokes-Nernst-Planck-Poisson system in Triebel-Lizorkin space and Besov space with negative indices

This paper is concerned with the well-posedness of the Navier-Stokes-Nerst-Planck-Poisson system (NSNPP). Let sp=−2+n/p. We prove that the NSNPP has a unique local solution for in a subspace, i.e., Vu1×Vv1×Vv1, of with . We also prove that there exists a unique small global solution for any small initial data with .     

Complete solution to a problem on the maximal energy of unicyclic bipartite graphs

The energy of a simple graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Denote by C_n the cycle, and the unicyclic graph obtained by connecting a vertex of C₆ with a leaf of P_n-6. Caporossi et al. conjectured that the unicyclic graph with maximal energy is for n=8,12,14 and n≥16. In Hou et al. (2002) [Y. Hou, I. Gutman, C. Woo, Unicyclic graphs with maximal energy, Linear Algebra Appl. 356 (2002) 27-36], the authors proved that is maximal within the class of the unicyclic bipartite n-vertex graphs differing from C_n. And they also claimed that the energies of C_n and is quasi-order incomparable and left this as an open problem. In this paper, by utilizing the Coulson integral formula and some knowledge of real analysis, especially by employing certain combinatorial techniques, we show that the energy of is greater than that of C_n for n=8,12,14 and n≥16, which completely solves this open problem and partially solves the above conjecture.     

Asymptotic expansions of test statistics for dimensionality and additional information in canonical correlation analysis when the dimension is large

This paper examines asymptotic expansions of test statistics for dimensionality and additional information in canonical correlation analysis based on a sample of size N=n+1 on two sets of variables, i.e.,  and . These problems are related to dimension reduction. The asymptotic approximations of the statistics have been studied extensively when dimensions p₁ and p₂ are fixed and the sample size N tends to infinity. However, the approximations worsen as p₁ and p₂ increase. This paper derives asymptotic expansions of the test statistics when both the sample size and dimension are large, assuming that and have a joint (p₁+p₂)-variate normal distribution. Numerical simulations revealed that this approximation is more accurate than the classical approximation as the dimension increases.     

Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph

An edge of a 5-connected graph is said to be contractible if the contraction of the edge results in a 5-connected graph. A 5-connected graph with no contractible edge is said to be contraction critically 5-connected. Let G be a contraction critically 5-connected graph and let H be a component of the subgraph induced by the set of degree 5 vertices of G. Then it is known that |V(H)|≥4. We prove that if |V(H)|=4, then , where stands for the graph obtained from K₄ by deleting one edge. Moreover, we show that either |N_G(V(H))|=5 or |N_G(V(H))|=6 and around H there is one of two specified structures called a -configuration and a split -configuration.     

Uniformly minimum variance nonnegative quadratic unbiased estimation in a generalized growth curve model

Consider the generalized growth curve model subject to R(X_m)⊆?⊆R(X₁), where B_i are the matrices of unknown regression coefficients, and E=(ε₁,…,ε_s)^′ and are independent and identically distributed with the same first four moments as a random vector normally distributed with mean zero and covariance matrix Σ. We derive the necessary and sufficient conditions under which the uniformly minimum variance nonnegative quadratic unbiased estimator (UMVNNQUE) of the parametric function with C≥0 exists. The necessary and sufficient conditions for a nonnegative quadratic unbiased estimator with of to be the UMVNNQUE are obtained as well.     

The maximum dimension of a subspace of nilpotent matrices of index 2

A matrix M is nilpotent of index 2 if M²=0. Let V be a space of nilpotent n×n matrices of index 2 over a field k where and suppose that r is the maximum rank of any matrix in V. The object of this paper is to give an elementary proof of the fact that . We show that the inequality is sharp and construct all such subspaces of maximum dimension. We use the result to find the maximum dimension of spaces of anti-commuting matrices and zero subalgebras of special Jordan Algebras.     

Holomorphic cohomology groups on compact Kähler complex spaces

Let (X,OX) be a compact (reduced) complex space, bimeromorphic to a Kähler manifold. The singular cohomology groups Hq(X,C) carry a mixed Hodge structure. In particular they carry a weight filtration W−lHq(X,C) (l=0,…,q), and the graded quotients have a direct sum decomposition into holomorphic invariants as . Here we investigate the relationships between the above invariants for r=0 and the cohomology groups , where is the sheaf of weakly holomorphic functions on X. Moreover, according to the smooth case, we characterize the topological line bundles L on X such that the class of c₁(L) in has pure type (1,1).     

Directed 3-cycle decompositions of complete directed graphs with quadratic leaves

Let G be a vertex-disjoint union of directed cycles in the complete directed graph D_t, let |E(G)| be the number of directed edges of G and suppose or if t=5, and if t=6. It is proved in this paper that for each positive integer t, there exist -decompositions for D_t−G if and only if .     

Characteristic polynomial of a generalized complete product of matrices

For a simple graph G, let denote the complement of G relative to the complete graph and let P_G(x)=det(xI-A(G)) where A(G) denotes the adjacency matrix of G. The complete product G∇H of two simple graphs G and H is the graph obtained from G and H by joining every vertex of G to every vertex of H. In [2]P_G∇H(x) is represented in terms of P_G, , P_H and . In this paper we extend the notion of complete product of simple graphs to that of generalized complete product of matrices and obtain their characteristic polynomials.     

Stable solutions of linear systems involving long chain of matrix multiplications

This paper is concerned with solving linear system (I_n+B_L?B₂B₁)x=b arising from the Green’s function calculation in the quantum Monte Carlo simulation of interacting electrons. The order of the system and integer L are adjustable. Also adjustable is the conditioning of the coefficient matrix to give rise an extreme ill-conditioned system. Two numerical methods based on the QR decomposition with column pivoting and the singular value decomposition, respectively, are studied in this paper. It is proved that the computed solution by each of the methods is weakly backward stable in the sense that the computed is close to the exact solution of a nearby linear system

     

The case of equality in the Dobrushin-Deutsch-Zenger bound

Suppose that A=(a_i,j) is an n×n real matrix with constant row sums μ. Then the Dobrushin-Deutsch-Zenger (DDZ) bound on the eigenvalues of A other than μ is given by . When A a transition matrix of a finite homogeneous Markov chain so that μ=1,Z(A) is called the coefficient of ergodicity of the chain as it bounds the asymptotic rate of convergence, namely, , of the iteration , to the stationary distribution vector of the chain.In this paper we study the structure of real matrices for which the DDZ bound is sharp. We apply our results to the study of the class of graphs for which the transition matrix arising from a random walk on the graph attains the bound. We also characterize the eigenvalues λ of A for which |λ|=Z(A) for some stochastic matrix A.     

On the computation of the jdeg of blowup algebras

For a graded algebra , its is a global degree that can be used to study issues of complexity of the normalization . Here some techniques grounded on Rees algebra theory are used to estimate . A closely related notion, of divisorial generation, is introduced to count numbers of generators of .     

Lawvere theories enriched over a general base

We generalise the correspondence between Lawvere theories and finitary monads on in two ways. First, we allow our theories to be enriched in a category V that is locally finitely presentable as a symmetric monoidal closed category: symmetry is convenient but not necessary. And second, we allow the arities of our theories to be finitely presentable objects of a locally finitely presentable V-category A. We call the resulting notion that of a Lawvere A-theory. We extend the correspondence for ordinary Lawvere theories to one between Lawvere A-theories and finitary V-monads on A. We illustrate this with examples leading up to that of the Lawvere -theory for cartesian closed categories, i.e., the -enriched theory on the category for which the models are all small cartesian closed categories. We also briefly investigate change-of-base.