Convex \((0, 1)\)-matrices and their epitopes
From MaRDI portal
Publication:2022503
DOI10.1016/j.dam.2021.02.038zbMath1464.05026arXiv2101.04148OpenAlexW3138901615MaRDI QIDQ2022503
Publication date: 29 April 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.04148
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrices of integers (15B36) Polyominoes (05B50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumeration of bigrassmannian permutations below a permutation in Bruhat order
- A new characterization of matrices with the consecutive ones property
- Bijection between bigrassmannian permutations maximal below a permutation and its essential set
- Flags, Schubert polynomials, degeneracy loci, and determinantal formulas
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The reconstruction of polyominoes from their orthogonal projections
- Reconstruction of convex 2D discrete sets in polynomial time
- Combinatorics of Fulton's essential set
- Reconstruction of \(hv\)-convex binary matrices from their absorbed projections
- Incidence matrices and interval graphs
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- More combinatorics of Fulton's essential set
- Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
- On comparability of bigrassmannian permutations
- Matrices of zeros and ones with given line sums and a zero block
- The size of Fulton's essential set
This page was built for publication: Convex \((0, 1)\)-matrices and their epitopes