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

Let $C$ be a genus $2$ curve with Jacobian isomorphic to the square of an elliptic curve with complex multiplication by a maximal order in an imaginary quadratic field of discriminant $-d<0$. We show that if the stable model of $C$ has bad…

Let $B$ be a sixth-power-free integer and $P$ be a non-torsion point on the Mordell curve $E_B:y^2=x^3+B$. In this paper, we study integral multiples $[n]P$ of $P$. Among other results, we show that $P$ has at most three integral multiples…

We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance…

We bound the j -invariant of integral points on a modular curve in terms of the congruence group defining the curve. We apply this to prove that the modular curve Xsplit (p3) has no non-trivial rational point if p is a sufficiently large…

In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…

The article proposes a new method for finding the triangle-triangle intersection in 3D space, based on the use of computer graphics algorithms -- cutting off segments on the plane when moving and rotating the beginning of the coordinate…

For a non-degenerate irreducible curve $C$ of degree $d$ in $\mathbb{P}^3$ over $\mathbb{F}_q$, we prove that the number $N_q(C)$ of $\mathbb{F}_q$-rational points of $C$ satisfies the inequality $N_q(C) \leq (d-2)q+1$. Our result improves…

In this note, we examine the arrangements of lines and configurations of points that emerge from Fermat (von Dyck) and Komiya-Kuribayashi quartics. These quartics are characterized by having the maximum number of lines of maximal tangency,…

In this paper, we continue the study of intersections of closed curves on translation surfaces, initiated in by S. Cheboui, A. Kessi and D. Massart for a family of arithmetic Veech surfaces and the author, E. Lanneau and D. Massart for a…

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair touches. We improve upon the proof of the second author that $N \leq 18$ to show that $N \leq 10$.…

The average value of the number of intersection points of two plane curves given by trigonometrical polynomial maps of degree $N$ and bounded $L_2$- or $W_2^r$- norms is calculated

We study arithmetical and geometrical properties of {\it maximal curves}, that is, curves defined over the finite field $\mathbb F_{q^2}$ whose number of $\mathbb F_{q^2}$-rational points reachs the Hasse-Weil upper bound. Under a…

The maximum rectilinear crossing number of a graph $G$ is the maximum number of crossings in a good straight-line drawing of $G$ in the plane. In a good drawing any two edges intersect in at most one point (counting endpoints), no three…

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

In this paper, an upper bound for the number of integral points of bounded height on an affine complete intersection defined over $\mathbb{Z}$ is proven. The proof uses an extension to complete intersections of the method used for…

We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.

We describe an algorithm to compute the number of points over finite fields on a broad class of modular curves: we consider quotients $X_H/W$ for $H$ a subgroup of $\GL_2(\mathbb Z/n\mathbb Z)$ such that for each prime $p$ dividing $n$, the…

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$.…