📖
Euclidean Embeddings of Acyclic Hypergraph Line Metrics
Nicholas Popescu

Euclidean Embeddings of Acyclic Hypergraph Line Metrics

Author / Organization:
Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

We study Euclidean embeddings of higher-order line metrics arising from hypergraphs. For a fixed threshold \(s\geq 1\), the \(s\)-line graph \(L_s(H)\) has one vertex for each hyperedge of \(H\), with two hyperedges adjacent when they intersect in at least \(s\) vertices; its shortest-path metric is the native \(s\)-line metric. In the unrestricted setting, every finite graph occurs as the \(s\)-line graph of some hypergraph, so the worst-case Euclidean distortion is \(Θ(\log n)\). We show that \(α\)-acyclicity yields a sharp improvement to \(Θ(\sqrt{\log\log n})\). Although the canonical join tree of an \(α\)-acyclic hypergraph may have arbitrarily large stretch relative to the native metric, we prove that for every \(s\), the \(s\)-line graphs of \(α\)-acyclic hypergraphs are exactly the dually chordal graphs. Using their constant-factor spanning-tree approximations together with classical tree-embedding bounds, we obtain an \(O(\sqrt{\log\log n})\) Euclidean embedding bound. We then show this is asymptotically tight by realizing every finite tree as the \(s\)-line graph of an \(α\)-acyclic hypergraph. Thus, the worst-case distortion is \(Θ(\sqrt{\log\log n})\), including for hypergraphs of rank at most \(3s+1\).

Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Euclidean Embeddings of Acyclic Hypergraph Line Metrics
Author / Organization Nicholas Popescu
Subject & Discipline cs.DM
Categories Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-274756
Original Source Link Visit Source Page on arxiv.org »