English
Related papers

Related papers: On maximal curves of $n$-correct sets

200 papers

We show that Edge Multiway Cut (also called Multiterminal Cut) and Node Multiway Cut are NP-complete on graphs of maximum degree $3$ (also known as subcubic graphs). This improves on a previous degree bound of $11$. Our NP-completeness…

Computational Complexity · Computer Science 2024-08-20 Matthew Johnson , Barnaby Martin , Siani Smith , Sukanya Pandey , Daniel Paulusma , Erik Jan van Leeuwen

Generalizing a classical lemma of Castelnuovo, we characterize rational normal curves (resp. linearly normal elliptic curves) as curves $C\subset \PP^n$ such that the number of linearly independent hypersurfaces $Z\supset C$ of given…

alg-geom · Mathematics 2008-02-03 S. L'vovsky

Let $X$ be a smooth complex projective variety and let $H \in \pic(X)$ be an ample line bundle. Assume that $X$ is covered by rational curves with degree one with respect to $H$ and with anticanonical degree greater than or equal to $(\dim…

Algebraic Geometry · Mathematics 2019-08-15 Carla Novelli , Gianluca Occhetta

A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…

Discrete Mathematics · Computer Science 2018-01-25 Franz J. Brandenburg

In this paper we compute the gonality over Q of the modular curve X1(N) for all N <= 40 and give upper bounds for each N <= 250. This allows us to determine all N for which X1(N) has infinitely points of degree <= 8. We conjecture that the…

Number Theory · Mathematics 2018-05-03 Maarten Derickx , Mark van Hoeij

Inspired by the work of Backelin on non-commutative correspondences to Macaulay's theorem of the growth of the Hilbert series of affine algebras, we study embedding dimension dependant versions of his degree 2 to degree 3 result. In…

Combinatorics · Mathematics 2008-05-29 Jan Snellman

In this paper we consider n-poised planar node sets, as well as more special ones, called $GC_n$-sets. For these sets all $n$-fundamental polynomials are products of n linear factors as it always takes place in the univariate case. A line…

Numerical Analysis · Mathematics 2016-02-23 Vahagn Bayramyan , Hakop Hakopian

Let n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…

Algebraic Geometry · Mathematics 2013-02-07 Steven L. Kleiman

We study hyperelliptic curves arising from Chebyshev polynomials. The aim of this paper is to characterize the pairs $(q,d)$ such that the hyperelliptic curve $\cC$ over a finite field $\FF_{q^2}$ corresponding to the equation $y^2 =…

Algebraic Geometry · Mathematics 2019-03-11 Saeed Tafazolian , Jaap Top

The classification of maximal plane curves of degree $3$ over $\mathbb{F}_4$ will be given, which complements Hirschfeld-Storme-Thas-Voloch's theorem on a characterization of Hermitian curves in $\mathbb{P}^2$. This complementary part…

Algebraic Geometry · Mathematics 2021-12-21 Masaaki Homma

In this paper we obtain an explicit formula for the number of curves in a compact complex surface $X$ (passing through the right number of generic points), that has up to one node and one singularity of codimension $k$, provided the total…

Algebraic Geometry · Mathematics 2015-01-08 Somnath Basu , Ritwik Mukherjee

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

Computational Geometry · Computer Science 2014-05-06 Paul Accisano , Alper Üngör

We introduce a notion of good cohomology for multiple lines in $\mathbb{P}^3$ and we classify multiple lines with good cohomology up to multiplicity 4. In particular, we show that the family of space curves of degree d, not lying on a…

Algebraic Geometry · Mathematics 2025-01-07 Enrico Schlesinger

Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…

Symbolic Computation · Computer Science 2015-03-19 Michael Kerber , Michael Sagraloff

Let $X$ be either a general hypersurface of degree $n+1$ in $\mathbb P^n$ or a general $(2,n)$ complete intersection in $\mathbb P^{n+1}, n\geq 4$. We construct balanced rational curves on $X$ of all high enough degrees. If $n=3$ or $g=1$,…

Algebraic Geometry · Mathematics 2024-03-26 Ziv Ran

Let f: C --> P^3 be a general curve of genus g, mapped to P^3 via a general linear series of degree d; and let Q be a general (and thus smooth) quadric. In this paper, we show that the points of intersection f(C) \cap Q give a general…

Algebraic Geometry · Mathematics 2021-03-10 Eric Larson

Let $d$ and $k$ be positive integers. Let $\mu$ be a positive Borel measure on $\mathbb{R}^2$ possessing finite moments up to degree $2d-1$. If the support of $\mu$ is contained in an algebraic curve of degree $k$, then we show that there…

Numerical Analysis · Mathematics 2017-10-31 Cordian Riener , Markus Schweighofer

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

Combinatorics · Mathematics 2025-12-02 Jiangdong Ai , Gregory Gutin , Xiangzhou Liu , Anders Yeo , Yacong Zhou

In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…

Algebraic Geometry · Mathematics 2025-02-21 Somnath Basu , Ritwik Mukherjee

Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…

Geometric Topology · Mathematics 2016-10-21 Tarik Aougab , Ian Biringer , Jonah Gaster