Combinatorial matrix classes
graphrankdiscrepancyadjacency matrixdeterminantmajorizationYoung tableaudigraphdoubly stochasticfacettracepermanenttournamentBruhat ordertransportation polytopewidthterm rankinterchangefully indecomposableassignment polytope
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex degrees (05C07) Combinatorial aspects of representation theory (05E10) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Stochastic matrices (15B51) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)
- An extension of Brualdi's algorithm for the construction of (0,1)-matrices with prescribed row and column sum vectors
- Majorization for partially ordered sets
- Normalizing flows as approximations of optimal transport maps via linear-control neural ODEs
- The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- The polyhedral-surface cutting plane method of optimization over a vertex-located set
- Orthogonalisability of joins of graphs
- On complementary coverage of \({\Omega}_n(T)\)
- Information-geometric equivalence of transportation polytopes
- A doubly stochastic matrices-based approach to optimal qubit routing
- scientific article; zbMATH DE number 4043856 (Why is no real title available?)
- Transformation of hyperoutput systems to a form with relative degree
- Monotonicity in quadratically regularized linear programs
- Majorization classes of integral matrices
- Diagonal Scalings for the Eigenstructure of Arbitrary Pencils
- Antichains of \((0, 1)\)-matrices through inversions
- Polytopes related to interval vectors and incidence matrices
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- Quantitative convergence of quadratically regularized linear programs
- Alternating sign and sign-restricted matrices: representations and partial orders
- 123-avoiding doubly stochastic matrices
- Majorization permutahedra and (0,1)-matrices
- On maximum chains in the Bruhat order of A(n,2)
- scientific article; zbMATH DE number 7535774 (Why is no real title available?)
- scientific article; zbMATH DE number 4046911 (Why is no real title available?)
- Asymptotic enumeration of integer matrices with large equal row and column sums
- The Laplacian energy of threshold graphs and majorization
- On stochasticity preserving methods for the computation of the matrix pth root
- Sign-restricted matrices of 0's, 1's, and \(-1\)'s
- The Erdős-Gallai theorem modulo \(k\)
- Optimal (0, 1)-matrix completion with majorization ordered objectives
- Chains and antichains in the Bruhat order for classes of (0,1)-matrices
- Extremal matrices for the Bruhat-graph order
- On the permutation polytopes of some cyclic groups
- Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
- Alternating sign matrices and hypermatrices, and a generalization of Latin squares
- A note on majorization transforms and Ryser's algorithm
- Zero sum sign-central matrices and applications
- \(L\)-rays of permutation matrices and doubly stochastic matrices
- Measuring exposure to dependence risk with random Bernstein copula scenarios
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- Supervised optimal transport
- On double-resolution imaging and discrete tomography
- Automatic generation of fast algorithms for matrix–vector multiplication
- Transitive partitions in realizations of tournament score sequences
- A geometric study of cores of idempotent stochastic matrices
- Lorentzian polynomials
- Hankel and Toeplitz X-rays of permutations
- Entropical optimal transport, Schrödinger's system and algorithms
- Combinatorial matrix theory
- Near-derangements and their polytopes
- Martingale matrix classes and polytopes
- Matrices uniquely determined by their lonesums
- A linear-time algorithm for the orbit problem over cyclic groups
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- Minimal partitions with a given \(s\)-core and \(t\)-core
- The interval structure of \(( 0 , 1 )\)-matrices
- Partial permutation and alternating sign matrix polytopes
- Uniform and monotone line sum optimization
- The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
- 12 t-permutation avoiding (0, 1)-matrices
- Primitive sets of nonnegative matrices and synchronizing automata
- A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- On line sum optimization
- Doubly stochastic matrices and modified Laplacian matrices of graphs
- Bruhat order of tournaments
- Majorization for matrix classes
- Combinatorial ranks of matrices
- On a conjecture concerning the Bruhat order
- A note on permutations and rank aggregation
- A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers
- A certain Bruhat order on doubly substochastic matrices
- Multinomial matrices
- Two conjectures on graceful digraphs
- On certain trees with the same degree sequence
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- The isomorphic version of Brualdi's and Sanderson's nestedness
- Finite space Kantorovich problem with an MCMC of table moves
- On the entropy of couplings
- A Gale-Berlekamp permutation-switching problem
- Tournaments associated with multigraphs and a theorem of Hakimi
- A characterization of even doubly-stochastic matrices
- Acyclic digraphs and local hierarchy theory
- Limit laws for empirical optimal solutions in random linear programs
- Classes of linear programs solvable by coordinate-wise minimization
- Majorization for (0,1)-matrices
- Combinatorial properties of some classes of matrices over GF(2)
- Further results on the minimum rank of regular classes of (0,1)-matrices
- Critical sets of 2-balanced Latin rectangles
- On the existence of extreme coherent distributions with no atoms
- Fractional perfect \(b\)-matching polytopes. I: General theory
- Affine construction methodology of aggregation functions
- Spectra of digraphs
- Majorization and the number of bipartite graphs for given vertex degrees
- Matrices with prescribed row and column sums
- On the little secondary Bruhat order
- Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices
- Graph isomorphism, color refinement, and compactness
- The skeleton of acyclic Birkhoff polytopes
This page was built for publication: Combinatorial matrix classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5484517)