Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
From MaRDI portal
Publication:5234537
DOI10.1137/18M1190823zbMath1446.90135arXiv1805.11245OpenAlexW2975794839MaRDI QIDQ5234537
Publication date: 27 September 2019
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.11245
submodular functionskew fieldEuclidean buildingDieudonné determinantdiscrete convex analysiscombinatorial relaxation algorithmL-convex functionnoncommutative rankmixed matrixuniform modular lattice
Combinatorial optimization (90C27) Buildings and the geometry of diagrams (51E24) Skew fields, division rings (12E15)
Related Items (8)
A cost-scaling algorithm for computing the degree of determinants ⋮ A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with \(2 \times 2\) submatrices ⋮ Uniform modular lattices and affine buildings ⋮ On a weighted linear matroid intersection algorithm by deg-det computation ⋮ Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces ⋮ A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with \(2\times 2\) submatrices ⋮ A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices ⋮ Computing valuations of the Dieudonné determinants
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial degree bounds for matrix semi-invariants
- Valuated matroids: A new look at the greedy algorithm
- Valuated matroids
- Buildings of spherical type and finite BN-pairs
- Discrete convex analysis
- Constructive non-commutative rank computation is in deterministic polynomial time
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks
- Commutative/noncommutative rank of linear matrices and subspaces of matrices of low rank
- Exact bounds for steepest descent algorithms of $L$-convex function minimization
- Classical complexity and quantum entanglement
- Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
- On a weighted linear matroid intersection algorithm by deg-det computation
- Operator scaling: theory and applications
- Generalized Wong sequences and their applications to Edmonds' problems
- Non-commutative Edmonds' problem and matrix semi-invariants
- Rational identities and applications to algebra and geometry
- Reductive groups over a local field
- Lattice Theory: Foundation
- DIEUDONNÉ DETERMINANTS FOR SKEW POLYNOMIAL RINGS
- Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation
- Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—
- Improved Bounds for Matroid Partition and Intersection Algorithms
- A weighted matroid intersection algorithm
- Singular spaces of matrices and their application in combinatorics
- Matroid intersection algorithms
- Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
- Discrete Convex Analysis
- L-CONVEXITY ON GRAPH STRUCTURES
- Discrete Convex Functions on Graphs and Their Algorithmic Applications
- A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
- Computing the Degree of Determinants via Combinatorial Relaxation
- A weighted linear matroid parity algorithm
- Fast Deterministic Algorithms for Matrix Completion Problems
- Index Reduction for Differential-algebraic Equations with Mixed Matrices
- Deterministic Polynomial Time Algorithms for Matrix Completion Problems
- Systems of distinct representatives and linear algebra
- Degree of Dieudonné determinant defines the order of nonlinear system
- Les déterminants sur un corps non commutatif
- Combinatorial optimization. Theory and algorithms
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Matrices and matroids for systems analysis
This page was built for publication: Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
