Related papers: Computing Node Polynomials for Plane Curves

We compute the rational cohomology groups of the smooth Brill-Noether varieties $G^r_d(C)$, parametrizing linear series of degree $d$ and dimension exactly $r$ on a general curve $C$. As an application, we determine the whole intersection…

Floor diagrams are a class of weighted oriented graphs introduced by E. Brugalle and the second author. Tropical geometry arguments lead to combinatorial descriptions of (ordinary and relative) Gromov-Witten invariants of projective spaces…

We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…

A set of nodes is called $n$-independent if each its node has a fundamental polynomial of degree $n.$ We proved in a previous paper [H. Hakopian and S. Toroyan, On the minimal number of nodes determining uniquelly algebraic curves, accepted…

We obtain a formula for the degrees of the varieties parameterizing complex algebraic curves of any divisor class and genus on P^2_6, the projective plane blown-up at 6 generic points. Moreover, the formula computes the degrees of the…

Let $S\subset\Ps^r$ ($r\geq 5$) be a nondegenerate, irreducible, smooth, complex, projective surface of degree $d$. Let $\delta_S$ be the number of double points of a general projection of $S$ to $\Ps^4$. In the present paper we prove that…

The alliance polynomial of a graph $G$ with order $n$ and maximum degree $\Delta$ is the polynomial $A(G; x) = \sum_{k=-\Delta}^{\Delta} A_{k}(G) \, x^{n+k}$, where $A_{k}(G)$ is the number of exact defensive $k$-alliances in $G$. We obtain…

This paper is devoted to the explicit construction of optimal designs for discrimination between two polynomial regression models of degree $n-2$ and $n$. In a fundamental paper, Atkinson and Fedorov [Biometrika 62 (1975a) 57--70] proposed…

We give a new method to calculate the universal cohomology classes of coincident root loci. We show a polynomial behavior of them and apply this result to prove that generalized Pl\"ucker formulas are polynomials in the degree, just as the…

Extending results for space curves we establish bounds for the cohomology of a non-degenerate curve in projective $n$-space. As a consequence, for any given $n$ we determine all possible pairs $(d, g)$ where $d$ is the degree and $g$ is the…

We describe methods for calculation of polytopes of quasiadjunction for plane curve singularities which are invariants giving a Hodge theoretical refinement of the zero sets of multivariable Alexander polynomials. In particular we identify…

We generalize Block-G\"ottsche polynomials, originally defined for toric del Pezzo surfaces, to arbitrary surfaces. To do this, we show that these polynomials arise as special cases of BPS polynomials, defined for any surface $S$ as Laurent…

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

Let S be a complex smooth projective surface and L be a line bundle on S. For any given collection of isolated topological or analytic singularity types, we show the number of curves in the linear system |L| with prescribed singularities is…

We attach two binary codes to a projective nodal surface (the strict code K and, for even degree d, the extended code K' ) to investigate the `Nodal Severi varieties F(d, n) of nodal surfaces in P^3 of degree d and with n nodes, and their…

In this note we determine, for an arbitrary but a fixed degree $d$, an algorithm to list the possible values $m$ for which $M_g^{Pl}(\mathbb{Z}/m)$ is non-empty where $\mathbb{Z}/m$ denotes the cyclic group of order $m$. In particular, we…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…

We review and extend the known constructions relating Kummer threefolds, Gopel systems, theta constants and their derivatives, and the GIT quotient for 7 points in P^2 to obtain an explicit expression for the Coble quartic. The Coble…

It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar…

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…