Related papers: Computing Node Polynomials for Plane Curves

Kontsevich's formula for rational plane curves is a recursive relation for the number $N_d$ of degree $d$ rational curves in $\mathbb{P}^2$ passing through $3d-1$ general points. We provide two proofs of this recursion: the first more…

The purpose of this paper is to study low degree points on plane curves. We prove results analogous to those of Debarre and Klassen for singular plane curves with a finite number $\delta$ of ordinary nodes/cusps, where $\delta$ is bounded…

Let $C$ be a nonsingular irreducible projective curve of genus $g\ge2$ defined over the complex numbers. Suppose that $1\le n'\le n-1$ and $n'd-nd'=n'(n-n')(g-1)$. It is known that, for the general vector bundle $E$ of rank $n$ and degree…

The degree-diameter problem consists of finding the maximum number of vertices $n$ of a graph with diameter $d$ and maximum degree $\Delta$. This problem is well studied, and has been solved for plane graphs of low diameter in which every…

Let $C$ be a smooth plane curve. A point $P$ in the projective plane is said to be Galois with respect to $C$ if the function field extension induced from the point projection from $P$ is Galois. We denote by $\delta(C)$ (resp.…

I give a conjectural generating function for the numbers of $\delta$-nodal curves in a linear system of dimension $\delta$ on an algebraic surface. It reproduces the results of Vainsencher for the case $\delta\le 6$ and Kleiman-Piene for…

In this paper we focus on the problem of computing the number of moduli of the so called Severi varieties (denoted by V(|D|, \delta)), which parametrize universal families of irreducible, \delta-nodal curves in a complete linear system |D|,…

We propose a probabilistic variant of Brill-Noether's algorithm for computing a basis of the Riemann-Roch space $L(D)$ associated to a divisor $D$ on a projective nodal plane curve $\mathcal C$ over a sufficiently large perfect field $k$.…

We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by reordering. Using the previously…

We show that a general plane curve of degree at least 4 is uniquely determined by the full set of its bitangent lines. This problem has an elementary solution for degree at least 5, and the paper is almost entirely devoted to curves of…

The degree polynomial of a multigraph $G$ is given by $\sum _{v \in V(G)} x^{\mbox{deg}(v)}$. We investigate here properties of the roots of such polynomials. In addition to examining the roots for some families of graphs with few and many…

Ardila and Block used tropical results of Brugalle and Mikhalkin to count nodal curves on a certain family of toric surfaces. Building on a linearity result of the first author, we revisit their work in the context of the…

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

For a graph $G$, by $\chi_2(G)$ we denote the minimum integer $k$, such that there is a $k$-coloring of the vertices of $G$ in which vertices at distance at most 2 receive distinct colors. Equivalently, $\chi_2(G)$ is the chromatic number…

In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of…

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree $n$ on a bounded convex domain $D$. That is, we study…

Let $\Sigma(f)$ be critical points of a polynomial $f \in \mathbb{K}[x,y]$ in the plane $\mathbb{K}^2$, where $\mathbb{K}$ is $\mathbb{R}$ or $\mathbb{C}$. Our goal is to study the critical point map $\mathfrak{S}_d$, by sending polynomials…

We show that all knots up to $6$ crossings can be represented by polynomial knots of degree at most $7$, among which except for $5_2, 5_2^*, 6_1, 6_1^*, 6_2, 6_2^*$ and $6_3$ all are in their minimal degree representation. We provide…

In this paper, we consider the following question: how many degree $d$ curves are there in $\mathbb{P}^3$ (passing through the right number of generic lines and points), whose image lies inside a $\mathbb{P}^2$, having $\delta$ nodes and…