Combinatorial reduction of set functions and matroid permutations through minor invertible product assignment

DOI10.1016/j.laa.2024.11.004MaRDI QIDQ6650593

Mario Angelelli

Publication date: 9 December 2024

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

zbMATH Keywords

Plücker relationsmatroidpermutation testcomplexity reductionsparse polynomial

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial aspects of matroids and geometric lattices (05B35) Matrices over function rings in one or more variables (15A54)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sign variation, the Grassmannian, and total positivity
• The complexity of computing the permanent
• On principal angles between subspaces in \(\mathbb{R}^n\)
• Chu spaces from the representational viewpoint
• Homomorphic sensing of subspace arrangements
• KP Solitons and the Grassmannians
• Fast Property Testing and Metrics for Permutations
• Tau Functions and their Applications
• Matrix Completion Theorems
• An Algebraic-Geometric Approach for Linear Regression Without Correspondences
• Complexity reduction for sign configurations through the KP II equation and its information-theoretic aspects
• Multi-view clustering with adaptive procrustes on Grassmann manifold

This page was built for publication: Combinatorial reduction of set functions and matroid permutations through minor invertible product assignment