A formulation of the wide partition conjecture using the atom problem in discrete tomography

DOI10.1016/J.DAM.2013.11.022MaRDI QIDQ2440106zbMATH OpenOpenAlexWikidataFDO

Authors Flavio Guiñez

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

zbMATH Keywords

discrete tomographymulti-commodity flow\(k\)-atom problem3-way consistency tablewide partition conjecture

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Orthogonal arrays, Latin squares, Room squares (05B15) Statistical mechanics of crystals (82D25)

Recommendations

• Wide partitions, Latin tableaux, and Rota's basis conjecture
• scientific article; zbMATH DE number 67323
• A linear programming approach to the Manickam-Miklós-Singhi conjecture
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
• Some efficiently solvable problems over integer partition polytopes

Cites work

• A reconstruction algorithm for a subclass of instances of the 2-color problem
• A solvable case of image reconstruction in discrete tomography
• A theorem on flows in networks
• 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.
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
• Combinatorial Properties of Matrices of Zeros and Ones
• Conditions for the existence of solutions of the three-dimensional planar transportation problem
• Discrete tomography. Foundations, algorithms, and applications
• On joint realization of (0,1) matrices
• On the computational complexity of determining polyatomic structures by X-rays
• On the relations of various conjectures on Latin squares and straightening coefficients
• Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
• Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Studies on directed graphs. I, II
• The Complexity of Three-Way Statistical Tables
• Wide partitions, Latin tableaux, and Rota's basis conjecture

Cited in

(1)

• Wide partitions, Latin tableaux, and Rota's basis conjecture

This page was built for publication: A formulation of the wide partition conjecture using the atom problem in discrete tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440106)