English
Related papers

Related papers: Intersection of ACM-curves in P^3

200 papers

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

Metric Geometry · Mathematics 2013-11-25 Imre Barany , Jiri Matousek , Attila Por

We exhibit automorphisms of a certain K3 surface in $\mathbb{P}^1\times \mathbb{P}^1 \times \mathbb{P}^1$ with an isolated fixed point at which the induced action on the stalk of the structure sheaf is arbitrarily close to the identity.…

Algebraic Geometry · Mathematics 2025-08-27 Kenji Hashimoto , Yuta Takada

Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…

Optimization and Control · Mathematics 2025-10-22 Jordan Collard , Scott B. Lindstrom

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

The point sets of all known optimal rectilinear drawings of $K_n$ share an unmistakeable clustering property, the so--called {\em 3--decomposability}. It is widely believed that the underlying point sets of all optimal rectilinear drawings…

Combinatorics · Mathematics 2007-12-28 Bernardo Abrego , Silvia Fernandez-Merchant , Jesus Leanos , Gelasio Salazar

We study incidence problems involving points and curves in $R^3$. The current (and in fact only viable) approach to such problems, pioneered by Guth and Katz, requires a variety of tools from algebraic geometry, most notably (i) the…

Combinatorics · Mathematics 2020-07-09 Micha Sharir , Noam Solomon

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if…

Combinatorics · Mathematics 2011-08-30 Abhijin Adiga , L. Sunil Chandran

The cross-ratio degree problem asks for the number of configurations of $n$ points in $\mathbb{P}^1$ that satisfy $n-3$ specified cross-ratio conditions. It is known that the maximal cross-ratio degree for 8 points is at least 4. In this…

Algebraic Geometry · Mathematics 2026-01-19 Arjun Maniyar

We propose a detailed study of a canonical bound which relates the numbers of rational points of a curve over a finite field with that over its quadratic extension. Alternative proofs which make a connection with the variance enable to…

Algebraic Geometry · Mathematics 2026-05-27 Yves Aubry , Fabien Herbaut , Julien Monaldi

We prove the existence of curves of genus $7$ and $12$ over the field with $11^5$ elements, reaching the Hasse-Weil-Serre upper bound. These curves are quotients of modular curves and we give explicit equations. We compute the number of…

Number Theory · Mathematics 2025-04-30 Valerio Dose , Guido Lido , Pietro Mercuri , Claudio Stirpe

We study the minimal degrees and gonalities of curves on complete intersections. We prove a classical conjecture which asserts that the degree of any curve on a general complete intersection $X \subseteq \mathbb{P}^N$ cut out by polynomials…

Algebraic Geometry · Mathematics 2024-06-19 Nathan Chen , Benjamin Church , Junyan Zhao

We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…

Algebraic Geometry · Mathematics 2023-08-24 Indranil Biswas , Chitrabhanu Chaudhuri , Apratim Choudhury , Ritwik Mukherjee , Anantadulal Paul

In this paper we give a complete characterization of the intersections between the Norm-Trace curve over $\mathbb{F}_{q^3}$ and the curves of the form $y=ax^3+bx^2+cx+d$, generalizing a previous result by Bonini and Sala, providing more…

Algebraic Geometry · Mathematics 2022-07-05 Matteo Bonini , Massimiliano Sala , Lara Vicino

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

Group Theory · Mathematics 2022-05-13 Tony N. Mavely , Viji Z. Thomas

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…

Combinatorics · Mathematics 2017-05-01 Micha Sharir , Noam Solomon

Let $\Omega_1, \ldots, \Omega_m$ be probability spaces, let $\Omega=\Omega_1 \times \cdots \times \Omega_m$ be their product and let $A_1, \ldots, A_n \subset \Omega$ be events. Suppose that each event $A_i$ depends on $r_i$ coordinates of…

Probability · Mathematics 2025-09-16 Alexander Barvinok

Let $S_{g,p}$ denote the genus $g$ orientable surface with $p \ge 0$ punctures, and let $\omega(g,p)= 3g+p-4$. We prove the existence of infinitely long geodesic rays $\left\{v_{0},v_{1}, v_{2}, ...\right\}$ in the curve graph satisfying…

Geometric Topology · Mathematics 2017-05-17 Tarik Aougab , Samuel J. Taylor

We consider real polynomial systems $f=g=0$ in two variables where $f$ has $t\geq 3$ monomial terms and $g$ has $3$ monomials terms. We prove that the number of positive isolated solutions of such a system does not exceed $3\cdot 2^{t-2} -…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany

In 2010, Hiriart-Urruty and Seeger posed the problem of finding the maximal possible angle $\theta_n$ between two copositive matrices of order $n$. They proved that $\theta_2=\frac{3}{4}\pi$. In this paper, we study the maximal angle…

Optimization and Control · Mathematics 2025-01-08 Daniel Gourion

Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously best algorithm solves the problem in…

Computational Geometry · Computer Science 2026-02-03 Haitao Wang
‹ Prev 1 4 5 6 7 8 10 Next ›