相关论文: On the uniqueness of algebraic curves passing thro…

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that\\ $\#\mathcal X=d(n,n-3)+3= (n+1)+n+\cdots+5+3.$ In this paper we prove that there are at most three…

Let a set of nodes $\mathcal X$ in plain be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Suppose also that $|\mathcal X|= d(n,k-2)+2,$ where $d(n,k-2) = (n+1)+n+\cdots+(n-k+4)$ and $\ k\le n-1.$ In this paper…

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that $\#\mathcal X=d(n,k-3)+3= (n+1)+n+\cdots+(n-k+5)+3$ and $4 \le k\le n-1.$ In this paper we prove that…

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can…

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

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

In the long paper "Family Blowup formula, Admissible Graphs and the Enumeration of Singular Curves (I)" (appearing in JDG), the author solved the enumeration problem of nodal (or general singular) curve counting on algebraic surfaces by…

By Brook's Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A subset $I$ of $V(G)$ is an independent vertex subset if no two vertices in $I$ are adjacent in $G$. We study the number, $\sigma_1(G)$, of all subsets of $v(G)$ that contain…

Galvin showed that for all fixed $\delta$ and sufficiently large $n$, the $n$-vertex graph with minimum degree $\delta$ that admits the most independent sets is the complete bipartite graph $K_{\delta,n-\delta}$. He conjectured that except…

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…

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…

Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…

In this paper, we develop a systematic approach to enumerate curves with a certain number of nodes and one further singularity which maybe more degenerate. As a result, we obtain an explicit formula for the number of curves in a…

The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…