interchangeYoung tableauwidthtransportation polytopetracetournamentterm rankrankpermanentmajorizationadjacency matrixgraphfully indecomposablefacetdoubly stochasticdiscrepancydigraphdeterminantBruhat orderassignment polytope
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial aspects of representation theory (05E10) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02) Determinants, permanents, traces, other special matrix functions (15A15) Matrices of integers (15B36) Stochastic matrices (15B51)
Recommendations
Cited in
(only showing first 100 items - show all)- Permutation matrices related to Sudoku
- A characterization of even doubly-stochastic matrices
- Acyclic digraphs and local hierarchy theory
- Multinomial matrices
- Majorization for matrix classes
- The isomorphic version of Brualdi's and Sanderson's nestedness
- Constructing (0,1)-matrices with large minimal defining sets
- Alternating sign matrices and hypermatrices, and a generalization of Latin squares
- Quantum discord of states arising from graphs
- On the Bruhat order of labeled graphs
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Matrices uniquely determined by their lonesums
- Asymptotic enumeration of integer matrices with large equal row and column sums
- A sharpened condition for strict log-convexity of the spectral radius via the bipartite graph
- Symmetric, Hankel-symmetric, and centrosymmetric doubly stochastic matrices
- Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
- A note on majorization transforms and Ryser's algorithm
- The interval structure of \(( 0 , 1 )\)-matrices
- Uniform and monotone line sum optimization
- Finite space Kantorovich problem with an MCMC of table moves
- Affine construction methodology of aggregation functions
- Faces of the polytope of doubly substochastic matrices
- Phases of small worlds: a mean field formulation
- Doubly stochastic matrices and Schur-Weyl duality for partition algebras
- Linear operators preserving combinatorial matrix sets
- Entropical optimal transport, Schrödinger's system and algorithms
- Limit laws for empirical optimal solutions in random linear programs
- Classes of linear programs solvable by coordinate-wise minimization
- Orthogonal symmetric matrices and joins of graphs
- On certain trees with the same degree sequence
- On a conjecture concerning the Bruhat order
- Decompositions of complete multigraphs into stars of varying sizes
- The Bruhat order on classes of isotopic Latin squares
- The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices
- Transformation of hyperoutput systems to a form with relative degree
- Lorentzian polynomials
- The extreme points of centrosymmetric transportation polytopes
- On line sum optimization
- On stochasticity preserving methods for the computation of the matrix pth root
- Sign-restricted matrices of 0's, 1's, and \(-1\)'s
- Definite determinantal representations via orthostochastic matrices
- The skeleton of acyclic Birkhoff polytopes
- Bruhat order of tournaments
- Antichains of \((0, 1)\)-matrices through inversions
- Matrices in \(\mathcal{A}(R, S)\) with minimum \(t\)-term ranks
- Majorization for (0,1)-matrices
- On the entropy of couplings
- Computing the degree of a vertex in the skeleton of acyclic Birkhoff polytopes
- \(L\)-rays of permutation matrices and doubly stochastic matrices
- A geometric study of cores of idempotent stochastic matrices
- Maximal doubly stochastic matrix centralizers
- Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards
- Extreme points of the local differential privacy polytope
- Graph isomorphism, color refinement, and compactness
- On multidimensional inequality with variable distribution mean
- Fractional perfect \(b\)-matching polytopes. I: General theory
- On complementary coverage of \({\Omega}_n(T)\)
- On maximum chains in the Bruhat order of A(n,2)
- Hankel and Toeplitz X-rays of permutations
- Construction of all tournament matrices with prescribed row sum vector
- Information-geometric equivalence of transportation polytopes
- Majorization for \((0, \pm 1)\)-matrices
- Combinatorial ranks of matrices
- Zero sum sign-central matrices and applications
- On Tinhofer's linear programming approach to isomorphism testing
- A linear-time algorithm for the orbit problem over cyclic groups
- Transitive partitions in realizations of tournament score sequences
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes
- Primitive sets of nonnegative matrices and synchronizing automata
- Further results on the minimum rank of regular classes of (0,1)-matrices
- Critical sets of 2-balanced Latin rectangles
- Combinatorial properties of some classes of matrices over GF(2)
- Two conjectures on graceful digraphs
- scientific article; zbMATH DE number 4043856 (Why is no real title available?)
- scientific article; zbMATH DE number 4046911 (Why is no real title available?)
- 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
- Combinatorial matrix theory
- scientific article; zbMATH DE number 3557805 (Why is no real title available?)
- A matrix-based ranking method with application to tennis
- Martingale matrix classes and polytopes
- Chains and antichains in the Bruhat order for classes of (0,1)-matrices
- Some Combinatorially Defined Matrix Classes
- On double-resolution imaging and discrete tomography
- Automatic generation of fast algorithms for matrix–vector multiplication
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- Dihedral transportation and (0, 1)-matrix classes
- A Gale-Berlekamp permutation-switching problem
- Tournaments associated with multigraphs and a theorem of Hakimi
- The Laplacian energy of threshold graphs and majorization
- A canonical construction for nonnegative integral matrices with given line sums
- Defining sets and critical sets in \((0,1)\)-matrices
- Loopy, Hankel, and combinatorially skew-Hankel tournaments
- On the little secondary Bruhat order
- Extreme points of certain transportation polytopes with fixed total sums
- Minimal ∞-norm of generalized inverses of the incidence matrix of a tree
- Extremal matrices for the Bruhat-graph order
- Constrained \((0,1)\)-matrix completion with a staircase of fixed zeros
- Supervised optimal transport
- Partial permutation and alternating sign matrix 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)
