A formulation of the wide partition conjecture using the atom problem in discrete tomography
From MaRDI portal
Publication:2440106
DOI10.1016/j.dam.2013.11.022zbMath1284.05030WikidataQ123243712 ScholiaQ123243712MaRDI QIDQ2440106
Publication date: 27 March 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.11.022
discrete tomography; multi-commodity flow; \(k\)-atom problem; 3-way consistency table; wide partition conjecture
05A17: Combinatorial aspects of partitions of integers
82D25: Statistical mechanics of crystals
05B15: Orthogonal arrays, Latin squares, Room squares
Cites Work
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- A reconstruction algorithm for a subclass of instances of the 2-color problem
- Studies on directed graphs. I, II
- A theorem on flows in networks
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
- On joint realization of (0,1) matrices
- On the relations of various conjectures on Latin squares and straightening coefficients
- Wide partitions, Latin tableaux, and Rota's basis conjecture
- On the computational complexity of determining polyatomic structures by X-rays
- Discrete tomography. Foundations, algorithms, and applications
- A solvable case of image reconstruction in discrete tomography
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
- Combinatorial Properties of Matrices of Zeros and Ones
- The Complexity of Three-Way Statistical Tables
- All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
