As set systems, hypergraphs are omnipresent and have various representations. In a geometric representation of a hypergraph $H=(V,E)$, each vertex $v\in V$ is a associated with a point $p_v\in \mathbb{R}^d$ and each hyperedge $e\in E$ is associated with a connected set $s_e\subset \mathbb{R}^d$ such that $\{p_v\mid v\in V\}\cap s_e=\{p_v\mid v\in e\}$ for all $e\in E$. We say that a given hypergraph $H$ is representable by some (infinite) family $\mathcal{F}$ of sets in $\mathbb{R}^d$, if there exist $P\subset \mathbb{R}^d$ and $S \subseteq \mathcal{F}$ such that $(P,S)$ is a geometric representation of $H$. For a family $\mathcal{F}$, we define RECOGNITION($\mathcal{F}$) as the problem to determine if a given hypergraph is representable by $\mathcal{F}$. It is known that the RECOGNITION problem is ER-hard for halfspaces in $\mathbb{R}^d$. We study the families of balls and ellipsoids in $\mathbb{R}^d$, as well as other convex sets, and show that their RECOGNITION problems are also ER-complete. This means that these recognition problems are equivalent to deciding whether a multivariate system of polynomial equations with integer coefficients has a real solution.
翻译:作为设置的系统,超强是存在的,并且具有不同的表示面。在高光度$H=(V,E)$(V,E)的几何代表值中,每个顶端$v@in V$与一个点$p_v@in\mathb{R<unk> d$相联系,而每高端美元以E$与一个连接的立点$s_e\subset\\mathbb{R<unk> d$相联系,如果存在 $P_v\subset\mabb{R<unk> d$和$S\subreal=lexal cal{F},那么$(P,S)是美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元。对于一个(infite)家族来说, 美元=美元=F=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元=美元,如果一个家庭确定一个直流化的确认的确认, 是一个问题代表,</s>