半代数图的表示复杂性
Representation Complexity of Semi-algebraic Graphs
摘要:
二部图$G=(P,Q)$的表示复杂度是在所有可能的方式中将$G$写为完全二部子图$G=\cup_{i=1}^s A_i\times B_i$的并集(不一定不相交)的最小尺寸$\sum_{i=1}^s (|A_i|+|B_i|)$,其中$A_i\subset P, B_i\subset Q$用于$i=1,\dots, s$。本文证明了:若$G$是\emph{semi-algebraic},即当$P$是$\mathbb{R}^{d_1}$中的$m$点集,$Q$是$\mathbb{R}^{d_2}$中的$n$点集,且边由某种半代数关系定义时,对于任意小的正$\varepsilon$,$G$的表示复杂性为$O( m^{\frac{d_1d_2-d_2}{d_1d_2-1}+\varepsilon} n^{\frac{d_1d_2-d_1}{d_1d_2-1}+\varepsilon}+m^{1+\varepsilon}+n^{1+\varepsilon})$.这推广了Apfelbaum-Sharir和Solomon-Sharir的结果。因此,当$G$对于某个正整数$u$是无$K_{u,u}$的时,它的边数是$O(u m^{\frac{d_1d_2-d_2}{d_1d_2-1}+\varepsilon} n^{\frac{d_1d_2-d_1}{d_1d_2-1}+\varepsilon}+ u m^{1+\varepsilon}+u n^{1+\varepsilon})$ .当第一项占优且$u$随$m,n$增长时,此界比Fox,Pach,Sheffer,Suk和Zahl的界更强.另一个结果是,当边数很大时,我们可以在半代数图中找到一个大的完全二部子图。半代数超图也有类似的结果。
英文摘要:
The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s A_i\times B_i$ where $A_i\subset P, B_i\subset Q$ for $i=1,\dots, s$. In this paper we prove that if $G$ is \emph{semi-algebraic}, i.e. when $P$ is a set of $m$ points in $\mathbb{R}^{d_1}$, $Q$ is a set of $n$ points in $\mathbb{R}^{d_2}$ and the edges are defined by some semi-algebraic relations, the representation complexity of $G$ is $O( m^{\frac{d_1d_2-d_2}{d_1d_2-1}+\varepsilon} n^{\frac{d_1d_2-d_1}{d_1d_2-1}+\varepsilon}+m^{1+\varepsilon}+n^{1+\varepsilon})$ for arbitrarily small positive $\varepsilon$. This generalizes results by Apfelbaum-Sharir and Solomon-Sharir. As a consequence, when $G$ is $K_{u,u}$-free for some positive integer $u$, its number of edges is $O(u m^{\frac{d_1d_2-d_2}{d_1d_2-1}+\varepsilon} n^{\frac{d_1d_2-d_1}{d_1d_2-1}+\varepsilon}+ u m^{1+\varepsilon}+u n^{1+\varepsilon})$. This bound is stronger than that of Fox, Pach, Sheffer, Suk and Zahl when the first term dominates and $u$ grows with $m,n$. Another consequence is that we can find a large complete bipartite subgraph in a semi-algebraic graph when the number of edges is large. Similar results hold for semi-algebraic hypergraphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。