Eigenvalue analysis of constrained minimization problem for homogeneous polynomial

In this paper, the concepts of Pareto H-eigenvalue and Pareto Z-eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a symmetric tensor has at least one Pareto H-eigenvalue (Pareto Z-eigenvalue). Furthermore, the minimum Pareto H-eigenvalue (or Pareto Z-eigenvalue) of a symmetric tensor is exactly equal to the minimum value of constrained minimization problem of homogeneous polynomial deduced by such a tensor, which gives an alternative methods for solving the minimum value of constrained minimization problem. In particular, a symmetric tensor \({\mathcal {A}}\) is strictly copositive if and only if every Pareto H-eigenvalue (Z-eigenvalue) of \({\mathcal {A}}\) is positive, and \({\mathcal {A}}\) is copositive if and only if every Pareto H-eigenvalue (Z-eigenvalue) of \({\mathcal {A}}\) is non-negative.     

Liouville Type Theorems of f-Harmonic Maps with Potential

In this paper, we introduce the notion of f-harmonic map with potential H with respect to the functional E _f,H . We use the stress-energy tensor to obtain some monotonicity formulas and Liouville type theorems for f-harmonic maps with potential H under some conditions on f and H.     

A spectral sequence for string cohomology

Let X be a 1-connected space with free-loop space ΛX. We introduce two spectral sequences converging towards H^*(ΛX;Z/p) and H^*((ΛX)_hT;Z/p). The E₂-terms are certain non-Abelian-derived functors applied to H^*(X;Z/p). When H^*(X;Z/p) is a polynomial algebra, the spectral sequences collapse for more or less trivial reasons. If X is a sphere it is a surprising fact that the spectral sequences collapse for p=2.     

Ordering uniform supertrees by their spectral radii

A supertree is a connected and acyclic hypergraph. For a hypergraph H, the maximal modulus of the eigenvalues of its adjacency tensor is called the spectral radius of H. By applying the operation of moving edges on hypergraphs and the weighted incidence matrix method, we determine the ninth and the tenth k-uniform supertrees with the largest spectral radii among all k-uniform supertrees on n vertices, which extends the known result.     

Frames and bases in tensor products of Hilbert spaces and Hilbert <Emphasis Type="Italic">C</Emphasis>*-modules

In this article, we study tensor product of Hilbert C*-modules and Hilbert spaces. We show that if E is a Hilbert A-module and F is a Hilbert B-module, then tensor product of frames (orthonormal bases) for E and F produce frames (orthonormal bases) for Hilbert A ⊗ B-module E ⊗ F, and we get more results. For Hilbert spaces H and K, we study tensor product of frames of subspaces for H and K, tensor product of resolutions of the identities of H and K, and tensor product of frame representations for H and K.     

Additive edge labelings

Let G=(V,E) be a graph and d a positive integer. We study the following problem: for which labelings f_E:E→Z_d is there a labeling f_V:V→Z_d such that , for every edge (i,j)∈E? We also explore the connections of the equivalent multiplicative version to toric ideals. We derive a polynomial algorithm to answer these questions and to obtain all possible solutions.     

Some inverse problems involving conditional expectations

Let (Ω, F, P) be a probability space, let H be a sub-σ-algebra of F, and let Y be positive and H-measurable with E[Y] = 1. We discuss the structure of the convex set CE(Y; H) = {X ∈ pF: Y = E[X|H]} of random variables whose conditional expectation given H is the prescribed Y. Several characterizations of extreme points of CE(Y; H) are obtained. A necessary and sufficient condition is given in order that CE(Y; H) be the closed, convex hull of its extreme points. For the case of finite F we explicitly calculate the extreme points of CE(Y; H), identify pairs of adjacent extreme points, and characterize extreme points of CE(Y; H) ? CE(Z; G), where G is a second sub-σ-algebra of F and Z ∈ pG. When H = σ(Y) and appropriate topological hypotheses hold, extreme points of CE(Y; H) are shown to be in explicit one-to-one correspondence with certain left inverses of Y. Finally, it is shown how the same approach can be applied to the problem of extremal random measures on $\text{R}$₊ with a prescribed compensator, to deduce that the number of extreme points is zero or one.     

On the determinant of the adjacency matrix for a planar sublattice

It is proved that the determinant of the adjacency matrix for a finite subgraph G of Z × Z is 1, 0, or ?1, provided that G has no “holes.”     

On r-potent linear mappings

Let L(E) be the set of all linear mappings of a vector space E. Let Z₊ be the set of all positive integers. A nonzero element ? in L(E) is called an r-potent if $\text{?}{}^{\mathrm{r}}\text{=?}\text{and}\text{?}{}^{\mathrm{i}}\text{≠?}\text{for}\text{1<i<r (i,r∈Z}{}_{\mathrm{+}}\text{)}$. We prove that $\text{S(E)= {?∈L(E): ?}\text{is singular}\text{}}$ is a semigroup generated by the set of all r-potents in S(E), where r is a fixed positive integer with 2?r?n=dim(E).     

Strongly self-dual graphs

We present a class of graphs whose adjacency matrices are nonsingular with integral inverses, denoted h-graphs. If the h-graphs G and H with adjacency matrices M(G) and M(H) satisfy M(G)^-1=SM(H)S, where S is a signature matrix, we refer to H as the dual of G. The dual is a type of graph inverse. If the h-graph G is isomorphic to its dual via a particular isomorphism, we refer to G as strongly self-dual. We investigate the structural and spectral properties of strongly self-dual graphs, with a particular emphasis on identifying when such a graph has 1 as an eigenvalue.     

Maximal number of distinct H-eigenpairs for a two-dimensional real tensor

Based on the generalized characteristic polynomial introduced by J. Canny in Generalized characteristic polynomials [J. Symbolic Comput., 1990, 9(3): 241–250], it is immediate that for any m-order n-dimensional real tensor, the number of distinct H-eigenvalues is less than or equal to n(m?1) ^n?1. However, there is no known bounds on the maximal number of distinct Heigenvectors in general. We prove that for any m ? 2, an m-order 2-dimensional tensor A exists such that A has 2(m ? 1) distinct H-eigenpairs. We give examples of 4-order 2-dimensional tensors with six distinct H-eigenvalues as well as six distinct H-eigenvectors. We demonstrate the structure of eigenpairs for a higher order tensor is far more complicated than that of a matrix. Furthermore, we introduce a new class of weakly symmetric tensors, called p-symmetric tensors, and show under certain conditions, p-symmetry will effectively reduce the maximal number of distinct H-eigenvectors for a given two-dimensional tensor. Lastly, we provide a complete classification of the H-eigenvectors of a given 4-order 2-dimensional nonnegative p-symmetric tensor. Additionally, we give sufficient conditions which prevent a given 4-order 2-dimensional nonnegative irreducible weakly symmetric tensor from possessing six pairwise distinct H-eigenvectors.     

The 2-concavification of a Banach lattice equals the diagonal of the Fremlin tensor square

We investigate the relationship between the diagonal of the Fremlin projective tensor product of a Banach lattice E with itself and the 2-concavification of E.     

Bol three-webs with covariantly constant curvature tensor

We find complete systemof tensor relations characterizing the class ofmultidimensional middle Bol three-webs with covariantly constant curvature tensor, and ascertain the algebraic sense of these relations. We prove the existence of such webs and lay the foundation of their classification in terms of torsion tensor rank. We also show that 6-dimensional non-group webs of such type are the known flexible webs E₁ and E₂.     

Largest <Emphasis Type="Italic">H</Emphasis>-eigenvalue of uniform <Emphasis Type="Italic">s</Emphasis>-hypertrees

The k-uniform s-hypertree G = (V,E) is an s-hypergraph, where 1 ≤ s ≤ k - 1; and there exists a host tree T with vertex set V such that each edge of G induces a connected subtree of T. In this paper, some properties of uniform s-hypertrees are establised, as well as the upper and lower bounds on the largest H-eigenvalue of the adjacency tensor of k-uniform s-hypertrees in terms of the maximal degree Δ. Moreover, we also show that the gap between the maximum and the minimum values of the largest H-eigenvalue of k-uniform s-hypertrees is just Θ(Δ ^s/k ).     

Unicyclic graphs with bicyclic inverses

A graph is nonsingular if its adjacency matrix A(G) is nonsingular. The inverse of a nonsingular graph G is a graph whose adjacency matrix is similar to A(G)^?1 via a particular type of similarity. Let H denote the class of connected bipartite graphs with unique perfect matchings. Tifenbach and Kirkland (2009) characterized the unicyclic graphs in H which possess unicyclic inverses. We present a characterization of unicyclic graphs in H which possess bicyclic inverses.     

Leavitt path algebras with coefficients in a commutative ring

Given a directed graph E we describe a method for constructing a Leavitt path algebra L_R(E) whose coefficients are in a commutative unital ring R. We prove versions of the Graded Uniqueness Theorem and Cuntz-Krieger Uniqueness Theorem for these Leavitt path algebras, giving proofs that both generalize and simplify the classical results for Leavitt path algebras over fields. We also analyze the ideal structure of L_R(E), and we prove that if K is a field, then L_K(E)≅K⊗_ZL_Z(E).     

Spectral properties of odd-bipartite <Emphasis Type="Italic">Z</Emphasis>-tensors and their absolute tensors

Stimulated by odd-bipartite and even-bipartite hypergraphs, we define odd-bipartite (weakly odd-bipartie) and even-bipartite (weakly evenbipartite) tensors. It is verified that all even order odd-bipartite tensors are irreducible tensors, while all even-bipartite tensors are reducible no matter the parity of the order. Based on properties of odd-bipartite tensors, we study the relationship between the largest H-eigenvalue of a Z-tensor with nonnegative diagonal elements, and the largest H-eigenvalue of absolute tensor of that Ztensor. When the order is even and the Z-tensor is weakly irreducible, we prove that the largest H-eigenvalue of the Z-tensor and the largest H-eigenvalue of the absolute tensor of that Z-tensor are equal, if and only if the Z-tensor is weakly odd-bipartite. Examples show the authenticity of the conclusions. Then, we prove that a symmetric Z-tensor with nonnegative diagonal entries and the absolute tensor of the Z-tensor are diagonal similar, if and only if the Z-tensor has even order and it is weakly odd-bipartite. After that, it is proved that, when an even order symmetric Z-tensor with nonnegative diagonal entries is weakly irreducible, the equality of the spectrum of the Z-tensor and the spectrum of absolute tensor of that Z-tensor, can be characterized by the equality of their spectral radii.     

Sparse connectivity certificates via MA orderings in graphs

For an undirected multigraph G=(V,E), let α be a positive integer weight function on V. For a positive integer k, G is called (k,α)-connected if any two vertices u,v∈V remain connected after removal of any pair (Z,E^′) of a vertex subset Z⊆V-{u,v} and an edge subset E^′⊆E such that ∑_v∈Zα(v)+|E^′|<k. The (k,α)-connectivity is an extension of several common generalizations of edge-connectivity and vertex-connectivity. Given a (k,α)-connected graph G, we show that a (k,α)-connected spanning subgraph of G with O(k|V|) edges can be found in linear time by using MA orderings. We also show that properties on removal cycles and preservation of minimum cuts can be extended in the (k,α)-connectivity.     

On non-vanishing of cohomologies of generalized Raynaud polarized surfaces

We consider a family of slightly extended version of Raynaud’s surfaces X over the field of positive characteristic with Mumford-Szpiro type polarizations Z, which have Kodaira non-vanishing H¹(X,Z⁻ⁿ)≠0 for all 1≤n≤N with some N≥1. The surfaces are at least normal but smooth under a special condition. We also give a fairly large family of non-Mumford-Szpiro type polarizations Z_a,b with Kodaira non-vanishing.     

Cohen-Macaulayness and computation of Newton graded toric rings

Let H⊆Z^d be a positive semigroup generated by A⊆H, and let K[H] be the associated semigroup ring over a field K. We investigate heredity of the Cohen-Macaulay property from K[H] to both its A-Newton graded ring and to its face rings. We show by example that neither one inherits in general the Cohen-Macaulay property. On the positive side, we show that for every H there exist generating sets A for which the Newton graduation preserves Cohen-Macaulayness. This gives an elementary proof for an important vanishing result on A-hypergeometric Euler-Koszul homology. As a tool for our investigations we develop an algorithm to compute algorithmically the Newton filtration on a toric ring.