Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
On the Degree Sequences of Uniform Hypergraphs
verfasst von : Andrea Frosini, Christophe Picouleau, Simone Rinaldi
Erschienen in: Discrete Geometry for Computer Imagery
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.