On two extremal matrix problems

DOI10.1016/0024-3795(89)90465-5MaRDI QIDQ1115936zbMATH OpenOpenAlexFDO

Authors Roy Meshulam

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0024-3795(89)90465-5

zbMATH Keywords

affine spacedeterminantspermanentsspaces of matrices dimension

Mathematics Subject Classification ID

Vector spaces, linear dependence, rank, lineability (15A03) Linear transformations, semilinear transformations (15A04) Determinants, permanents, traces, other special matrix functions (15A15) Algebraic systems of matrices (15A30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Hermitian, skew-Hermitian, and related matrices (15B57)

Recommendations

• Affine spaces of symmetric or alternating matrices with bounded rank
• A note on the determinant and permanent problem
• Spaces of symmetric matrices of bounded rank
• ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
• Large spaces of symmetric matrices of bounded rank are decomposable^∗

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• On Nilalgebras and Linear Varieties of Nilpotent Matrices, I
• On Spaces of Linear Transformations with Bounded Rank
• ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
• Permanent and determinant
• The complexity of computing the permanent

Cited in

(33)

• Galois extensions and subspaces of alternating bilinear forms with special rank properties
• Spaces of symmetric matrices of bounded rank
• External flats to varieties in symmetric product spaces over finite fields.
• Spaces of Hankel matrices over finite fields
• Linear spaces of symmetric nilpotent matrices
• A lower bound on determinantal complexity
• Depth-4 lower bounds, determinantal complexity: a unified approach
• Sinkhorn-Knopp theorem for PPT states
• Maximal rank in matrix spaces via graph matchings
• A lower bound for the determinantal complexity of a hypersurface
• On the matrices of given rank in a large subspace
• Maximal bilinear complexity and codes
• Large spaces of symmetric matrices of bounded rank are decomposable^∗
• Algebraic complexity classes
• Linear spaces and preservers of symmetric matrices of bounded rank-two
• Affine spaces of symmetric or alternating matrices with bounded rank
• Extremal problems involving isotropic sets and functions on spaces of rectangular matrices
• Large spaces of symmetric or alternating matrices with bounded rank
• ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES
• An extremal problem concerning matrices of 0's and 1 's
• An Extremal Problem on Sparse 0-1 Matrices
• Singular spaces of matrices and their application in combinatorics
• Large affine spaces of matrices with rank bounded below
• Rank preservers on spaces of symmetric matrices
• Polynomials with and without determinantal representations
• Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank
• Eckardt loci on hypersurfaces
• Partial matrices whose completions have ranks bounded below
• Spaces of \(p\)-vectors of bounded rank
• No short polynomials vanish on bounded rank matrices
• Spaces of singular matrices and matroid parity
• On affine spaces of alternating matrices with constant rank
• The extremal case of some matrix inequalities

This page was built for publication: On two extremal matrix problems

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