Matrices and matroids for systems analysis
From MaRDI portal
Publication:5917962
zbMath0948.05001MaRDI QIDQ5917962
Publication date: 19 January 2000
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35) Canonical forms, reductions, classification (15A21)
Related Items
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils, Regularization of DAEs based on the signature method, Deterministic Truncation of Linear Matroids, A compact representation for minimizers of \(k\)-submodular functions, On the theory of matchgate computations, Index Reduction via Unimodular Transformations, On blockwise symmetric signatures for matchgates, Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation, Structural identifiability in low-rank matrix factorization, A cost-scaling algorithm for computing the degree of determinants, Discrete convexity in joint winner property, Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function, Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem, Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection., Non-commutative Edmonds' problem and matrix semi-invariants, Gross substitutability: an algorithmic survey, Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems, Holographic algorithms: from art to science, Generic properties and control of linear structured systems: A survey, Representability of orthogonal matroids over partial fields, 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, The linear delta-matroid parity problem, Uniform semimodular lattices and valuated matroids, Uniform modular lattices and affine buildings, Presentations of transversal valuated matroids, Structural control of single-input rank one bilinear systems, On the NP-completeness of the perfect matching free subgraph problem, Structural Identifiability in Low-Rank Matrix Factorization, Some conditional probabilities in the TASEP with second class particles, Unnamed Item, Making Bipartite Graphs DM-Irreducible, New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities., Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, Generic pole assignability, structurally constrained controllers and unimodular completion, Theory of Principal Partitions Revisited, Recent Developments in Discrete Convex Analysis, Structural analysis for the sensor location problem in fault detection and isolation, Linear functional equations with a catalytic variable and area limit laws for lattice paths and polygons, Application of M-convex submodular flow problem to mathematical economics, A `non-additive' characterization of \(\wp\)-adic norms., On a weighted linear matroid intersection algorithm by deg-det computation, Valuated matroid-based algorithm for submodular welfare problem, A framework of discrete DC programming by discrete convex analysis, A Weighted Linear Matroid Parity Algorithm, Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation, Index reduction for differential-algebraic equations by substitution method, Computing DM-decomposition of a partitioned matrix with rank-1 blocks, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors, Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms, Designing matching mechanisms under constraints: an approach from discrete convex analysis, Legendre duality in combinatorial study of matrix pencils, The generic canonical form of a regular structured matrix pencil, On circuit valuation of matroids, On symmetric signatures in holographic algorithms, A compact representation for modular semilattices and its applications, Conjugacy relationship between M-convex and L-convex functions in continuous variables, The affine representation theorem for abstract convex geometries, Coordinatewise domain scaling algorithm for M-convex function minimization, Approximating clique-width and branch-width, Combinatorial auctions with decreasing marginal utilities, Induction of M-convex functions by linking systems, Singular, nonsingular, and bounded rank completions of ACI-matrices, Algebraic Algorithms for Linear Matroid Parity Problems, Computing Walrasian equilibria: fast algorithms and structural properties, Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces, Scattered Classes of Graphs, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, Sensor placement for fault isolation in linear differential-algebraic systems, Multiple Exchange Property for M♮-Concave Functions and Valuated Matroids, Existence and uniqueness of the Kronecker covariance MLE, A Tractable Class of Binary VCSPs via M-Convex Intersection, Exact and approximation algorithms for weighted matroid intersection, Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings, Integral with Respect to a Non Additive Measure: An Overview, Rank-width and vertex-minors, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Extension of M-convexity and L-convexity to polyhedral convex functions, Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors in mixed polynomial matrices, Expressiveness of matchgates., Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation, A combinatorial formula for principal minors of a matrix with tree-metric exponents and its applications, Rank connectivity and pivot-minors of graphs, Generalized Wong sequences and their applications to Edmonds' problems
