Combinatorial methods for the spectral p-norm of hypermatrices

DOI10.1016/J.LAA.2017.04.023MaRDI QIDQ2361565zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 June 2017

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.08665

zbMATH Keywords

\(p\)-spectral radiushypergraphhypermatrixnonnegative hypermatrixSchur's boundspectral norm

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Multilinear algebra, tensor calculus (15A69)

Abstract: The spectral $p$-norm of $r$-matrices generalizes the spectral $2$-norm of $2$-matrices. In 1911 Schur gave an upper bound on the spectral $2$-norm of $2$-matrices, which was extended in 1934 by Hardy, Littlewood, and Polya to $r$-matrices. Recently, Kolotilina, and independently the author, strengthened Schur's bound for $2$-matrices. The main result of this paper extends the latter result to $r$-matrices, thereby improving the result of Hardy, Littlewood, and Polya. The proof is based on combinatorial concepts like $r$-partite $r$-matrix and symmetrant of a matrix, which appear to be instrumental in the study of the spectral $p$-norm in general. Thus, another application shows that the spectral $p$-norm and the $p$-spectral radius of a symmetric nonnegative $r$-matrix are equal whenever $pgeqr$. This result contributes to a classical area of analysis, initiated by Mazur and Orlicz around 1930. Additionally, a number of bounds are given on the $p$-spectral radius and the spectral $p$-norm of $r$-matrices and $r$-graphs.

Recommendations

• Extremal norms of graphs and matrices
• scientific article; zbMATH DE number 2164306
• On the tensor spectral p-norm and its dual norm via partitions
• scientific article; zbMATH DE number 5590095
• On the spectra of hypermatrix direct sum and Kronecker products constructions

Cites work

• A Theory of Cross-Spaces. (AM-26)
• Analytic methods for uniform hypergraphs
• Best rank one approximation of real symmetric tensors can be chosen symmetric
• Blind Multilinear Identification
• Block tensors and symmetric embeddings
• Bounds on the spectral norm and the nuclear norm of a tensor based on tensor partitions
• Eigenvalues of a real supersymmetric tensor
• scientific article; zbMATH DE number 3762003 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1321183 (Why is no real title available?)
• scientific article; zbMATH DE number 3014822 (Why is no real title available?)
• Matrix Analysis
• Norm attaining polynomials
• Nuclear norm of higher-order tensors
• On determinants and eigenvalue theory of tensors
• On the first eigenvalue of bipartite graphs
• On the nuclear norm and the singular value decomposition of tensors
• On the spectral radius of graphs with cut vertices
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Perron-Frobenius theorem for nonnegative tensors
• Produits tensoriels topologiques et espaces nucléaires
• Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Spectra of uniform hypergraphs
• Symmetric nonnegative tensors and copositive tensors
• The computational complexity of duality
• Über homogene Polynome in ($L^{2}$)

Cited in

(10)

• On the irregularity of uniform hypergraphs
• Schur complement spectral bounds for large hybrid FETI-DP clusters and huge three-dimensional scalar problems
• On norm compression inequalities for partitioned block tensors
• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs
• A concise proof to the spectral and nuclear norm bounds through tensor partitions
• On the tensor spectral p-norm and its dual norm via partitions
• On the first and second eigenvalue of finite and infinite uniform hypergraphs
• On the spectra of hypermatrix direct sum and Kronecker products constructions
• On the tensor spectral \(\mathbf{p}\)-norm and its higher order power method
• On ABC spectral radius of uniform hypergraphs

This page was built for publication: Combinatorial methods for the spectral \(p\)-norm of hypermatrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361565)