Reconstructing permutation matrices from diagonal sums

DOI10.1016/S0304-3975(02)00015-4zbMath0996.68223MaRDI QIDQ1603693

Alberto del Lungo

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

combinatorial problempermutationpermutation matrixdiscrete tomographyfinite abelian groupdiagonal sum

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Related Items (4)

Zero-sum problems in finite Abelian groups: a survey ⋮ A polynomial-time algorithm for finding zero-sums. ⋮ In memoriam: Alberto Del Lungo (1965--2003) ⋮ On the X-rays of permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
• Invariant sets of arcs in network flow problems
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• On weighted sums in abelian groups
• Discrete tomography. Foundations, algorithms, and applications
• A combinatorial problem on finite abelian groups
• Zero-sum problems -- a survey
• Remarks on a zero-sum theorem
• Three-dimensional Statistical Data Security Problems
• A Combinatorial Problem on Abelian Groups

This page was built for publication: Reconstructing permutation matrices from diagonal sums