惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

月光博客
月光博客
D
Docker
腾讯CDC
J
Java Code Geeks
大猫的无限游戏
大猫的无限游戏
The Cloudflare Blog
Martin Fowler
Martin Fowler
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
博客园 - 三生石上(FineUI控件)
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
IT之家
IT之家
WordPress大学
WordPress大学
M
MIT News - Artificial intelligence
爱范儿
爱范儿
Microsoft Azure Blog
Microsoft Azure Blog
Vercel News
Vercel News
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
小众软件
小众软件
N
Netflix TechBlog - Medium
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
博客园 - 【当耐特】

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Nondegenerate spheres in four dimensions
Thao T. Do · 2018-10-02 · via math.CO updates on arXiv.org

Non-degeneracy was first defined for hyperplanes by Elekes-Tóth, and later extended to spheres by Apfelbaum-Sharir: given a set $P$ of $m$ points in $\mathbb{R}^d$ and some $β\in(0,1)$, a $(d-1)$-dimensional sphere (or a $(d-1)$-sphere) $S$ in $\mathbb{R}^d$ is called $β$-nondegenerate with respect to $P$ if $S$ does not contain a proper subsphere $S'$ such that $|S'\cap P|\geq β|S\cap P|$. Apfelbaum-Sharir found an upper bound for the number of incidences between points and nondegenerate spheres in three dimensions, which was recently used by Zahl to obtain the best known bound for the unit distance problem in three dimensions. In this paper, we show that the number of incidences between $m$ points and $n$ $β$-nondegenerate 3-spheres in $\mathbb{R}^4$ is $O_{β,\varepsilon}\left(m^{\frac{15}{19}+\varepsilon} n^{\frac{16}{19}}+mn^{\frac{2}{3}}\right)$. As a consequence, we obtain a bound of $O_{\varepsilon}(n^{2+4/11+\varepsilon})$ on the number of similar triangles formed by $n$ points in $\mathbb{R}^4$, an improvement over the previously best known bound $O(n^{2+2/5})$. While proving this, we find it convenient to work with a more general definition of nondegeneracy: a bipartite graph $G=(P,Q)$ is called $β$-nondegenerate if $|N(q_1)\cap N(q_2)|<β|N(q_1)|$ for any two distinct vertices $q_1,q_2\in Q$; here $N(q)$ denotes the set of neighbors of $q$ and $β$ is some positive constant less than 1. A $β$-nondegenerate graph can have up to $Θ(|P||Q|)$ edges without any restriction, but must have much fewer edges if the graph is semi-algebraic or has bounded VC-dimension. We show that previous results for planes and spheres in three dimensions still hold under this new definition, and so does our new bound for spheres in four dimensions.