Abstract
In hypergraph theory, determining a good characterization of d, the degree sequence of an h-uniform hypergraph \(\mathcal{H}\), and deciding the complexity status of the reconstruction of \(\mathcal{H}\) from d, are two challenging open problems. They can be formulated in the context of discrete tomography: asks whether there is a matrix A with nonnegative projection vectors H = (h,h,…,h) and V = (d 1,d 2,…,d n ) with distinct rows.
In this paper we consider the subcase where the vectors H and V are both homogeneous vectors, and we solve the related consistency and reconstruction problems in polynomial time. To reach our goal, we use the concepts of Lyndon words and necklaces of fixed density, and we apply some already known algorithms for their efficient generation.
Chapter PDF
Similar content being viewed by others
References
Balogh, E., Sorantin, E., Nyúl, L.G., Palágyi, K., Kuba, A., Werkgartner, G., Spuller, E.: Virtual dissection of the colon: technique and first experiments with artificial and cadaveric phantoms. In: Medical Imaging 2002: Image Processing, San Diego, USA. Proceedings of SPIE, vol. 4681, pp. 713–721 (2002)
Batenburg, K.J., Bals, S., Sijbers, J., Kuebel, C., Midgley, P.A., Hernandez, J.C., Kaiser, U., Encina, E.R., Coronado, E.A., Van Tendeloo, G.: 3D imaging of nanomaterials by discrete tomography. Ultramicroscopy 109(6), 730–740 (2009)
Bentz, C., Costa, M.C., Picouleau, C., Ries, B., de Werra, D.: Degree-constrained edge partitioning in graphs arising from discrete tomography. Journal of Graph Algorithms and Applications 13(2), 99–118 (2009)
Berge, C.: Graphes. Gauthier-Villars, Paris (1983)
Berge, C.: Hypergraphs. North Holland (1989)
Brocchi, S., Frosini, A., Picouleau, C.: Reconstruction of binary matrices under fixed size neighborhood constraints. Theoretical Computer Science 406(1-2), 43–54 (2008)
Brocchi, S., Frosini, A., Rinaldi, S.: A reconstruction algorithm for a subclass of instances of the 2-color problem. Theoretical Computer Science 412, 4795–4804 (2011)
Brocchi, S., Frosini, A., Rinaldi, S.: The 1-Color Problem and the Brylawski Model. In: Brlek, S., Reutenauer, C., Provençal, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 530–538. Springer, Heidelberg (2009)
Dürr, C., Guiñez, F., Matamala, M.: Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A Solution to the 2-Atom Problem in Discrete Tomography. SIAM J. Discrete Math. 26(1), 330–352 (2012)
Gale, D.: A theorem on flows in networks. Pacific J. Math. 7, 1073–1082 (1957)
Gardner, R.J., Gritzmann, P.: Discrete tomography: determination of finite sets by X-rays. Trans. Amer. Math. Soc. 349, 2271–2295 (1997)
Gilbert, E.N., Riordan, J.: Symmetry types of periodic sequences. Illinois J. Math. 5, 657–665 (1961)
Guiũez, F., Matamala, M., Thomassé, S.: Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Discrete Applied Mathematics 159(1), 23–30 (2011)
Herman, G.T., Kuba, A.: Discrete tomography: Foundations algorithms and applications. Birkhauser, Boston (1999)
Herman, G.T., Kuba, A.: Advances in Discrete Tomography and Its Applications. Birkhauser, Boston (2007)
Irving, R.W., Jerrum, M.R.: Three-dimensional statistical data security problems. SIAM Journal of Computing 23, 170–184 (1994)
Matej, S., Vardi, A., Hermann, G.T., Vardi, E.: Binary tomography using Gibbs priors. In: Herman, G.T., Kuba, A. (eds.) Discrete Tomography: Foundations, Algorithms and Applications, pp. 191–212. Birkhauser, Boston (1999)
Prause, G.P.M., Onnasch, D.G.W.: Binary reconstruction of the heart chambers from biplane angiographic image sequence. IEEE Transactions on Medical Imaging 15, 532–559 (1996)
Ryser, H.: Combinatorial Mathematics. Mathematical Association of America and Quinn & Boden, Rahway (1963)
Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canadian Journal of Mathematics 9, 371–377 (1957)
Ruskey, F., Sawada, J.: An efficient algorithm for generating necklaces with fixed density. Siam J. Comput. 29, 671–684 (1999)
Sawada, J.: A fast algorithm to generate necklaces with fixed content. Theoret. Comput. Sci. 301, 477–489 (2003)
Shliferstein, A.R., Chien, Y.T.: Switching components and the ambiguity problem in the reconstruction of pictures from their projections. Pattern Recognition 10, 327–340 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frosini, A., Picouleau, C., Rinaldi, S. (2013). On the Degree Sequences of Uniform Hypergraphs. In: Gonzalez-Diaz, R., Jimenez, MJ., Medrano, B. (eds) Discrete Geometry for Computer Imagery. DGCI 2013. Lecture Notes in Computer Science, vol 7749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37067-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-37067-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37066-3
Online ISBN: 978-3-642-37067-0
eBook Packages: Computer ScienceComputer Science (R0)