A sequence π = (d1, . . . , dn) is graphic if there is a simple graph G with vertex set {v1, . . . , vn} such that the degree of vi is di. We say that graphic sequences π1 = (d (1) 1 , . . . , d (1) n ) and π2 = (d (2) 1 , . . . , d (2) n ) pack if there exist edge-disjoint n-vertex graphs G1 and G2 such that for j ∈ {1, 2}, dGj (vi) = d (j) i for all i ∈ {1, . . . , n}. Here, we prove several ...

In this paper, we design neural networks to estimate the perimeter of simple and more complex discrete sets from their horizontal and vertical projections. The information extracted this way can be useful to simplify the problem of reconstructing the discrete set from its projections, which task is in focus of discrete tomography. Beside presenting experimental results with neural networks, we ...

A novel reconstruction method is presented to improve the image quality of three dimensional (3D) datasets for samples consisting of only one material and surrounding air, obtained with high resolution X-ray Computed Tomography (μCT). It combines discrete tomography with iterative reconstruction algorithms, it is applicable for routine μCT applications and is referred to as the Experimental Dis...

The intimate connection between the Banach space wavelet reconstruction method on homogeneous spaces with both singular and nonsingular vacuum vectors, and some of well known quantum tomographies, such as: Moyal-representation for a spin, discrete phase space tomography, tomography of a free particle, Homodyne tomography, phase space tomography and SU(1,1) tomography is explained. Also both the...