On two extremal matrix problems

DOI10.1016/0024-3795(89)90465-5zbMath0665.15011OpenAlexW2040175652MaRDI QIDQ1115936

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

determinantspermanentsaffine spacespaces of matrices dimension

Mathematics Subject Classification ID

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

Related Items

Maximal rank in matrix spaces via graph matchings ⋮ A lower bound for the determinantal complexity of a hypersurface ⋮ Affine spaces of symmetric or alternating matrices with bounded rank ⋮ Large spaces of symmetric or alternating matrices with bounded rank ⋮ Maximal bilinear complexity and codes ⋮ External flats to varieties in symmetric product spaces over finite fields. ⋮ Large affine spaces of matrices with rank bounded below ⋮ On the matrices of given rank in a large subspace ⋮ Polynomials with and without determinantal representations ⋮ Linear subspaces of matrices associated to a Ferrers diagram and with a prescribed lower bound for their rank ⋮ Rank preservers on spaces of symmetric matrices ⋮ Large spaces of symmetric matrices of bounded rank are decomposable^∗ ⋮ Spaces of singular matrices and matroid parity ⋮ Partial matrices whose completions have ranks bounded below ⋮ Linear spaces of symmetric nilpotent matrices ⋮ Spaces of \(p\)-vectors of bounded rank ⋮ Depth-4 lower bounds, determinantal complexity: a unified approach ⋮ Spaces of Hankel matrices over finite fields ⋮ Galois extensions and subspaces of alternating bilinear forms with special rank properties ⋮ Algebraic Complexity Classes ⋮ Sinkhorn-Knopp theorem for PPT states ⋮ Eckardt Loci on Hypersurfaces ⋮ A lower bound on determinantal complexity ⋮ Linear spaces and preservers of symmetric matrices of bounded rank-two ⋮ Spaces of symmetric matrices of bounded rank

Cites Work

• Unnamed Item
• The complexity of computing the permanent
• Permanent and determinant
• 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