Combinatorial matrix classes
From MaRDI portal
Publication:5484517
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)
Recommendations
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 7057496 (Why is no real title available?)
- Doubly stochastic matrices and Schur-Weyl duality for partition algebras
- Comparison and Bayesian Estimation of Feature Allocations
- Symmetric and Hankel-symmetric transportation polytopes
- A canonical construction for nonnegative integral matrices with given line sums
- Loopy, Hankel, and combinatorially skew-Hankel tournaments
- Classes of \((0,1)\)-matrices where the Bruhat order and the secondary Bruhat order coincide
- The maximal length of a chain in the Bruhat order for a class of binary matrices
- A sharpened condition for strict log-convexity of the spectral radius via the bipartite graph
- The extreme points of centrosymmetric transportation polytopes
- Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards
- Extreme points of the local differential privacy polytope
- A matrix-based ranking method with application to tennis
- Some Combinatorially Defined Matrix Classes
- Majorization for \((0, \pm 1)\)-matrices
- Definite determinantal representations via orthostochastic matrices
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
- Faces of the polytope of doubly substochastic matrices
- More on the Bruhat order for (0, 1)-matrices
- Constructing integral matrices with given line sums
- scientific article; zbMATH DE number 3557805 (Why is no real title available?)
- Chromatic number of classes of matrices of zeros and ones
- Matrix representation for combinatorics
- Orthogonal symmetric matrices and joins of graphs
- Linear operators preserving combinatorial matrix sets
- The extreme points of certain polytopes of doubly substochastic matrices
- Bidimensional allocation of seats via zero-one matrices with given line sums
- Convex hulls of Grassmannians and combinatorics of symmetric hypermatrices
- Classical multidimensional scaling on metric measure spaces
- Antichains in the Bruhat order for the classes \(\mathcal{A}(n,k)\)
- Quantum discord of states arising from graphs
- Construction of all tournament matrices with prescribed row sum vector
- A Chinese remainder theorem for partitions
- Defining sets and critical sets in \((0,1)\)-matrices
- Phases of small worlds: a mean field formulation
- Alternating sign matrices, extensions and related cones
- Constructing (0,1)-matrices with large minimal defining sets
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- scientific article; zbMATH DE number 7692354 (Why is no real title available?)
- Transportation matrices with staircase patterns and majorization
- Decompositions of complete multigraphs into stars of varying sizes
- On the Bruhat order of labeled graphs
- Permutation matrices related to Sudoku
- Symmetric, Hankel-symmetric, and centrosymmetric doubly stochastic matrices
- On multidimensional inequality with variable distribution mean
- 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
- 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
- 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
- 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
- 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
- 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
- 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)\)
- Primitive sets of nonnegative matrices and synchronizing automata
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)
