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

推荐订阅源

OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 聂微东
博客园 - 叶小钗
爱范儿
爱范儿
罗磊的独立博客
Hugging Face - Blog
Hugging Face - Blog
阮一峰的网络日志
阮一峰的网络日志
S
SegmentFault 最新的问题
Apple Machine Learning Research
Apple Machine Learning Research
美团技术团队
T
Tailwind CSS Blog
博客园 - 司徒正美
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
宝玉的分享
宝玉的分享
量子位
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The Cloudflare Blog
人人都是产品经理
人人都是产品经理
小众软件
小众软件
博客园 - 【当耐特】
博客园 - 三生石上(FineUI控件)
V
Visual Studio Blog
雷峰网
雷峰网
酷 壳 – CoolShell
酷 壳 – CoolShell

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}}$
Incidences between points and curves with almost two degr...
Micha Sharir, Noam Solomon, Oleg Zlydenko · 2020-03-05 · via math.CO updates on arXiv.org

We study incidences between points and algebraic curves in three dimensions, taken from a family $C$ of curves that have almost two degrees of freedom, meaning that every pair of curves intersect in $O(1)$ points, for any pair of points $p$, $q$, there are only $O(1)$ curves of $C$ that pass through both points, and a pair $p$, $q$ of points admit a curve of $C$ that passes through both of them iff $F(p,q)=0$ for some polynomial $F$. We study two specific instances, one involving unit circles in $R^3$ that pass through some fixed point (so called anchored unit circles), and the other involving tangencies between directed points (points and directions) and circles in the plane; a directed point is tangent to a circle if the point lies on the circle and the direction is the tangent direction. A lifting transformation of Ellenberg et al. maps these tangencies to incidences between points and curves in three dimensions. In both instances the curves in $R^3$ have almost two degrees of freedom. We show that the number of incidences between $m$ points and $n$ anchored unit circles in $R^3$, as well as the number of tangencies between $m$ directed points and $n$ arbitrary circles in the plane, is $O(m^{3/5}n^{3/5}+m+n)$. We derive a similar incidence bound, with a few additional terms, for more general families of curves in $R^3$ with almost two degrees of freedom. The proofs follow standard techniques, based on polynomial partitioning, but face a novel issue involving surfaces that are infinitely ruled by the respective family of curves, as well as surfaces in a dual 3D space that are infinitely ruled by the respective family of suitably defined dual curves. The general bound that we obtain is $O(m^{3/5}n^{3/5}+m+n)$ plus additional terms that depend on how many curves or dual curves can lie on an infinitely-ruled surface.