On Polyatomic Tomography over Abelian Groups: Some Remarks on Consistency, Tree Packings and Complexity

The paper deals with an inverse problem of reconstructing matrices from their marginal sums. More precisely, we are interested in the existence of $$r\times s$$ r × s matrices for which only the following information is available: The entries belong to known subsets of c distinguishable abelian groups, and the row and column sums of all entries from each group are given. This generalizes Ryser’s classical problem of characterizing the set of all 0–1-matrices with given row and column sums and is a basic problem in (polyatomic) discrete tomography. We show that the problem is closely related to packings of trees in bipartite graphs, prove consistency results, give algorithms and determine its complexity. In particular, we find a somewhat unusual complexity behavior: the problem is hard for “small” but easy for “large” matrices.

[1]  Peter Gritzmann,et al.  On the computational complexity of determining polyatomic structures by X-rays , 2000, Theor. Comput. Sci..

[2]  L. Carlitz,et al.  Enumeration of matrices with prescribed row and column sums , 1973 .

[3]  Ben Seamone,et al.  The 1-2-3 Conjecture and related problems: a survey , 2012, ArXiv.

[4]  R. Brualdi.  Matrices of zeros and ones with fixed row and column sum vectors , 1980 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Martín Matamala,et al.  Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography , 2012, SIAM J. Discret. Math..

[7]  J. Lagarias.  Point lattices , 1996 .

[8]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[9]  T. Neumann.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[10]  Peter Gritzmann,et al.  On the Reconstruction of Static and Dynamic Discrete Structures , 2018, ArXiv.

[11]  Sven de Vries,et al.  On the reconstruction of binary and permutation matrices under (binary) tomographic constraints , 2008, Theor. Comput. Sci..

[12]  G. Herman,et al.  Discrete tomography : foundations, algorithms, and applications , 1999 .

[13]  H. J. Ryser,et al.  Matrices of zeros and ones , 1960 .

[14]  Edgar M. Palmer,et al.  On the spanning tree packing number of a graph: a survey , 2001, Discret. Math..

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[17]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[18]  G. Cornuéjols,et al.  Combinatorial optimization : packing and covering , 2001 .

[19]  Peter Gritzmann,et al.  On the computational complexity of reconstructing lattice sets from their X-rays , 1999, Discret. Math..

[20]  P. Gritzmann,et al.  Discrete Tomography of Model Sets: Reconstruction and Uniqueness , 2017 .