Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices

DOI10.1016/j.dam.2021.07.039zbMath1473.05039OpenAlexW3191678423MaRDI QIDQ2231760

Yanyan Li

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.07.039

zbMATH Keywords

\( ( 0, 1 )\)-matricespermutation bases

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (7)

An exact characterization of saturation for permutation matrices ⋮ Saturation of Multidimensional 0-1 Matrices ⋮ Saturation of Ordered Graphs ⋮ Flag-shaped blockers of 123-avoiding permutation matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Doubly stochastic matrices and Schur-Weyl duality for partition algebras

Cites Work

• Degrees of nonlinearity in forbidden 0-1 matrix problems
• Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
• Excluded permutation matrices and the Stanley-Wilf conjecture
• \(k\)-noncrossing and \(k\)-nonnesting graphs and fillings of Ferrers diagrams
• On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture
• Davenport-Schinzel theory of matrices
• A new class of Wilf-equivalent permutations
• On the structure of matrices avoiding interval-minor patterns
• On 0-1 matrices and small excluded submatrices
• Wilf-equivalence for singleton classes
• Combinatorics of Permutations
• Combinatorial properties of integer matrices and integer matrices modk
• Unnamed Item

This page was built for publication: Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices