Approximating the Orthogonality Dimension of Graphs and Hypergraphs

06/12/2019
by   Ishay Haviv, et al.
0

A t-dimensional orthogonal representation of a hypergraph is an assignment of nonzero vectors in R^t to its vertices, such that every hyperedge contains two vertices whose vectors are orthogonal. The orthogonality dimension of a hypergraph H, denoted by ξ(H), is the smallest integer t for which there exists a t-dimensional orthogonal representation of H. In this paper we study computational aspects of the orthogonality dimension of graphs and hypergraphs. We prove that for every k ≥ 4, it is NP-hard (resp. quasi-NP-hard) to distinguish n-vertex k-uniform hypergraphs H with ξ(H) ≤ 2 from those satisfying ξ(H) ≥Ω(log^δ n) for some constant δ>0 (resp. ξ(H) ≥Ω(log^1-o(1) n)). For graphs, we relate the NP-hardness of approximating the orthogonality dimension to a variant of a long-standing conjecture of Stahl. We also consider the algorithmic problem in which given a graph G with ξ(G) ≤ 3 the goal is to find an orthogonal representation of G of as low dimension as possible, and provide a polynomial time approximation algorithm based on semidefinite programming.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/13/2022

Avoider-Enforcer Game is NP-hard

In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enfo...
research
01/02/2023

Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank

The orthogonality dimension of a graph G over ℝ is the smallest integer ...
research
12/03/2021

Strong Hardness of Approximation for Tree Transversals

Let H be a fixed graph. The H-Transversal problem, given a graph G, asks...
research
02/20/2020

The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications

The orthogonality dimension of a graph G=(V,E) over a field 𝔽 is the sma...
research
08/30/2022

On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension

We consider the Sparse Hitting Set (Sparse-HS) problem, where we are giv...
research
05/03/2022

Hardness Results for Weaver's Discrepancy Problem

Marcus, Spielman and Srivastava (Annals of Mathematics 2014) solved the ...
research
11/26/2022

Hardness Results for Minimizing the Covariance of Randomly Signed Sum of Vectors

Given vectors 𝕧_1, …, 𝕧_n ∈ℝ^d with Euclidean norm at most 1 and 𝕩_0 ∈ [...

Please sign up or login with your details

Forgot password? Click here to reset