Related papers: Incidences with curves in three dimensions
We show short time existence for the evolution of triple junction clusters driven by the surface diffusion flow. On the triple line we use the boundary conditions derived by Garcke and Novick-Cohen as the singular limit of a Cahn-Hilliard…
Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…
We propose a new formulation for integrating over smooth curves and surfaces that are described by their closest point mappings. Our method is designed for curves and surfaces that are not defined by any explicit parameterization and is…
Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…
We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…
We introduce a family of boundary conditions and point constraints for conformal immersions that increase the controllability of surfaces defined as minimizers of conformal variational problems. Our free boundary conditions fix the metric…
Incidence varieties are spaces of $n$-tuples of points in the projective plane that satisfy a given set of collinearity conditions. We classify the components of incidence varieties and realization moduli spaces associated to configurations…
We prove that the 3-D free-surface incompressible Euler equations with regular initial geometries and velocity fields have solutions which can form a finite-time "splash" (or "splat") singularity first introduced in [9], wherein the…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
We prove the first known nontrivial bounds on the sizes of the 2-torsion subgroups of the class groups of cubic and higher degree number fields $K$ (the trivial bound being $O_{\epsilon}(|{\rm Disc}(K)|^{1/2+\epsilon})$ by Brauer--Siegel).…
This work provides a curve-based approach to Ulrich bundles on surfaces, establishing a correspondence that characterizes their existence, with a focus on applications to surfaces in $\mathbb{P}^3$.
This paper explores and ties together three themes. The first is to establish regularity of a metric tensor, on a manifold with boundary, on which there are given Ricci curvature bounds, on the manifold and its boundary, and a Lipschitz…
The set of volumes of stable surfaces does have accumulation points. In this paper, we study this phenomenon for surfaces with one cyclic quotient singularity, towards answering the question under which conditions we can still have…
The need to compute the intersections between a line and a high-order curve or surface arises in a large number of finite element applications. Such intersection problems are easy to formulate but hard to solve robustly. We introduce a…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are…
Given a real projective curve with homogeneous coordinate ring R and a nonnegative homogeneous element f in R, we bound the degree of a nonzero homogeneous sum-of-squares g in R such that the product fg is again a sum of squares. Better…
In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…
A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…
Recent years have witnessed growing interests in solving partial differential equations by deep neural networks, especially in the high-dimensional case. Unlike classical numerical methods, such as finite difference method and finite…