English
Related papers

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

200 papers

We consider intersections of n diagonal forms of degrees k 1 < $\bullet$ $\bullet$ $\bullet$ < kn, and we prove an asymptotic formula for the number of rational points of bounded height on these varieties. The proof uses the…

Number Theory · Mathematics 2022-01-27 Simon Boyer , Olivier Robert

Let $N$ denote the maximum number of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair of cylinders touches each other. Littlewood posed the question of whether $N=7$, which remains unsolved. In this…

Metric Geometry · Mathematics 2025-06-25 Junnosuke Koizumi

The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as…

Combinatorics · Mathematics 2024-04-04 Aleksa Milojević , István Tomon , Benny Sudakov

This paper examines the Arithmetically Cohen-Macaulay (ACM) property for certain codimension 2 varieties in $\mathbb P^1\times \mathbb P^2$ called sets of lines in $\mathbb P^1\times \mathbb P^2$ (not necessarily reduced). We discuss some…

Commutative Algebra · Mathematics 2021-02-12 Giuseppe Favacchio , Juan Migliore

We give a bound on the number $\mathcal{Z}$ of intersection points in a ball of the complex plane, between a rational curve and a lacunary algebraic curve $Q=0$. This bound depends only on the lacunarity diagram of $Q$, and in particular is…

Algebraic Geometry · Mathematics 2024-01-12 Georges Comte , Sébastien Tavenas

Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…

Combinatorics · Mathematics 2017-06-20 Péter Györgyi , Bálint Hujter , Sándor Kisfaludi-Bak

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

Number Theory · Mathematics 2009-09-24 D. R. Heath-Brown , D. Testa

We obtain a sharp bound on the number of self-intersections of a closed planar curve with trigonometric parameterization. Moreover, we show that a generic curve of this form is normal in the sense of Whitney.

Complex Variables · Mathematics 2024-12-10 Sergei Kalmykov , Leonid V. Kovalev

We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…

Algebraic Geometry · Mathematics 2025-07-18 Gregorio Baldi , David Urbanik

According to a conjecture of Pach, there are $O(n)$ tangent pairs among any family of $n$ Jordan arcs in which every pair of arcs has precisely one common point and no three arcs share a common point. This conjecture was proved for two…

Combinatorics · Mathematics 2026-03-13 Eyal Ackerman , Balázs Keszegh

We establish new bounds on the number of tangencies and orthogonal intersections determined by an arrangement of curves. First, given a set of $n$ algebraic plane curves, we show that there are $O(n^{3/2})$ points where two or more curves…

Combinatorics · Mathematics 2018-07-10 Jordan S. Ellenberg , Jozsef Solymosi , Joshua Zahl

Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum size of a matching of each of these types, whether some given…

Combinatorics · Mathematics 2017-10-24 M. Fürst , D. Rautenbach

Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in $\mathcal G$ is of size at least $t$. For a real number $p\in(0,1)$ we…

Combinatorics · Mathematics 2023-03-03 Norihide Tokushige

Let $P$ be a set of at most $n$ points and let $R$ be a set of at most $n$ geometric ranges, such as for example disks or rectangles, where each $p \in P$ has an associated supply $s_{p} > 0$, and each $r \in R$ has an associated demand…

Computational Geometry · Computer Science 2023-12-05 Sergio Cabello , Siu-Wing Cheng , Otfried Cheong , Christian Knauer

We study, for the first time, the maximum modulus set of a quasiregular map. It is easy to see that these sets are necessarily closed, and contain at least one point of each modulus. Blumenthal showed that for entire maps these sets are…

Complex Variables · Mathematics 2020-09-15 Alastair N. Fletcher , David J. Sixsmith

Let $T(\Z_m \times \Z_n)$ denote the maximal number of points that can be placed on an $m \times n$ discrete torus with "no three in a line," meaning no three in a coset of a cyclic subgroup of $\Z_m \times \Z_n$. By proving upper bounds…

Combinatorics · Mathematics 2012-03-30 Jim Fowler , Andrew Groot , Deven Pandya , Bart Snapp

Edoukou, Ling and Xing in 2010, conjectured that in \mathbb{P}^n(\mathbb{F}_{q^2}), n \geq 3, the maximum number of common points of a non-degenerate Hermitian variety \mathcal{U}_n and a hypersurface of degree d is achieved only when the…

Algebraic Geometry · Mathematics 2025-10-13 Subrata Manna

We improve the lower bound on the $d$-dimensional rectilinear crossing number of the complete $d$-uniform hypergraph having $2d$ vertices to $\Omega\left(\dfrac{(4\sqrt{2}/3^{3/4})^d}{d}\right)$ from $\Omega(2^d \sqrt{d})$. We also…

Combinatorics · Mathematics 2023-09-21 Rahul Gangopadhyay , Ayan

For a nondegenerate irreducible curve $C$ of degree $d$ in ${\Bbb P}^r$ over ${\Bbb F}_q$ with $r \geq 3$, we prove that the number $N_q(C)$ of ${\Bbb F}_q$-points of $C$ satisfies the inequality $N_q(C) \leq (d-1)q +1$, which is known as…

Algebraic Geometry · Mathematics 2011-08-26 Masaaki Homma

We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in…

Optimization and Control · Mathematics 2024-04-22 C. Yalçın Kaya , Lyle Noakes , Philip Schrader
‹ Prev 1 8 9 10 Next ›