Combinatorial matrix classes
From MaRDI portal
Publication:5484517
zbMATH Open1106.05001MaRDI QIDQ5484517FDOQ5484517
Authors: Richard A. Brualdi 
Publication date: 21 August 2006
Recommendations
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)
Cited In (only showing first 100 items - show all)
- 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
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- Title not available (Why is that?)
- Information-geometric equivalence of transportation polytopes
- Antichains of \((0, 1)\)-matrices through inversions
- Majorization classes of integral matrices
- Polytopes related to interval vectors and incidence matrices
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- Majorization permutahedra and (0,1)-matrices
- Asymptotic enumeration of integer matrices with large equal row and column sums
- Extremal matrices for the Bruhat-graph order
- The Laplacian energy of threshold graphs and majorization
- Alternating sign matrices and hypermatrices, and a generalization of Latin squares
- On double-resolution imaging and discrete tomography
- Zero sum sign-central matrices and applications
- Measuring exposure to dependence risk with random Bernstein copula scenarios
- Lorentzian polynomials
- Matrices uniquely determined by their lonesums
- Martingale matrix classes and polytopes
- A linear-time algorithm for the orbit problem over cyclic groups
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- The coincidence of the Bruhat order and the secondary Bruhat order on \(\mathcal{A}(n, k)\)
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- Bruhat order of tournaments
- 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
- Multinomial matrices
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Two conjectures on graceful digraphs
- On the entropy of couplings
- A Gale-Berlekamp permutation-switching problem
- Tournaments associated with multigraphs and a theorem of Hakimi
- Fractional perfect \(b\)-matching polytopes. I: General theory
- Further results on the minimum rank of regular classes of \((0,1)\)-matrices
- Critical sets of 2-balanced Latin rectangles
- Spectra of digraphs
- On the little secondary Bruhat order
- Minimal nonnegative integral matrices and uniquely determined (0,1)-matrices
- Matrices with prescribed row and column sums
- Strict sign-central matrices
- Extreme points of certain transportation polytopes with fixed total sums
- Dihedral transportation and (0, 1)-matrix classes
- Comparison and Bayesian Estimation of Feature Allocations
- A canonical construction for nonnegative integral matrices with given line sums
- Loopy, Hankel, and combinatorially skew-Hankel tournaments
- The extreme points of centrosymmetric transportation polytopes
- Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide
- A sharpened condition for strict log-convexity of the spectral radius via the bipartite graph
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- A matrix-based ranking method with application to tennis
- Partial Permutation and Alternating Sign Matrix Polytopes
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
- Title not available (Why is that?)
- More on the Bruhat order for (0, 1)-matrices
- Constructing integral matrices with given line sums
- Chromatic number of classes of matrices of zeros and ones
- Matrix representation for combinatorics
- Bidimensional allocation of seats via zero-one matrices with given line sums
- Defining sets and critical sets in \((0,1)\)-matrices
- Title not available (Why is that?)
- Alternating sign matrices, extensions and related cones
- Constructing (0,1)-matrices with large minimal defining sets
- Transportation matrices with staircase patterns and majorization
- On the Bruhat order of labeled graphs
- Permutation matrices related to Sudoku
- The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices
- A doubly stochastic matrices-based approach to optimal qubit routing
- On complementary coverage of \({\Omega}_n(T)\)
- Transformation of hyperoutput systems to a form with relative degree
- Diagonal Scalings for the Eigenstructure of Arbitrary Pencils
- 123-avoiding doubly stochastic matrices
- Alternating sign and sign-restricted matrices: representations and partial orders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal \((0, 1)\)-matrix completion with majorization ordered objectives
- The Erdős-Gallai theorem modulo \(k\)
- On stochasticity preserving methods for the computation of the matrix \(p\)th root
- Sign-restricted matrices of 0's, 1's, and \(-1\)'s
- Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
- Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
- A note on majorization transforms and Ryser's algorithm
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- Automatic generation of fast algorithms for matrix–vector multiplication
- \(L\)-rays of permutation matrices and doubly stochastic matrices
- Transitive partitions in realizations of tournament score sequences
- A geometric study of cores of idempotent stochastic matrices
- Hankel and Toeplitz X-rays of permutations
- Entropical optimal transport, Schrödinger's system and algorithms
- Minimal partitions with a given \(s\)-core and \(t\)-core
- The interval structure of \(( 0 , 1 )\)-matrices
- Uniform and monotone line sum optimization
- A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid
- Primitive sets of nonnegative matrices and synchronizing automata
- Title not available (Why is that?)
- On line sum optimization
- A certain Bruhat order on doubly substochastic matrices
- Majorization for matrix classes
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)
