相关论文: On the arithmetic of weighted complete intersectio…

The purpose of this note is twofold. First, we give a quick proof of Ballico-Chiantini's theorem stating that a Fano or Calabi-Yau variety of dimension at least 4 in codimension two is a complete intersection. Second, we improve Barth-Van…

We prove the "strong form" of the Clemens conjecture in degree 10. Namely, on a general quintic threefold F in P^4, there are only finitely many smooth rational curves of degree 10, and each curve is embedded in F with normal bundle…

Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If…

We prove that a complete intersection of $c$ very general hypersurfaces of degree at least two in $N$-dimensional complex projective space is not ruled (and therefore not rational) provided that the sum of the degrees of the hypersurfaces…

We give a proof to the following theorem, which is well-known among experts: A connected subcomplex $W$ of a finite dimensional CAT(0) cubed complex $X$ is convex if and only if Lk$(v, W)$ is a full subcomplex of Lk$(v, X)$ for every vertex…

We describe the families of minimal rational curves on any complete symmetric variety, and the corresponding varieties of minimal rational tangents (VMRT). In particular, we prove that these varieties are homogeneous and that for…

This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under which a sequence is necessarily connected i.e. the sequence…

We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…

In this paper we study smooth complex projective polarized varieties (X,H) of dimension n \ge 2 which admit a dominating family V of rational curves of H-degree 3, such that two general points of X may be joined by a curve parametrized by…

Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…

We construct the canonical structure of an irreducible projective variety on the set of connected curves of degree $d$ in $\Bbb P^n$ with rational components (some components can be multiple). The set of rational curves is open subset in…

We study the minimal degrees and gonalities of curves on complete intersections. We prove a classical conjecture which asserts that the degree of any curve on a general complete intersection $X \subseteq \mathbb{P}^N$ cut out by polynomials…

Given a smooth projective variety $X$ over a field, consider the $\mathbb Q$-vector space $Z_0(X)$ of 0-cycles (i.e. formal finite $\mathbb Q$-linear combinations of the closed points of $X$) as a module over the algebra of finite…

We define a quadratically enriched count of rational curves in a given divisor class passing through a collection of points on a del Pezzo surface $S$ of degree $\geq 3$ over a perfect field $k$ of characteristic $\neq 2,3.$ When $S$ is…

Let $k$ be a field of arbitrary characteristic. Let $S$ be a singular surface defined over $k$ with multiple rational curve singularities and suppose that the Chow group of zero cycles of its normalisation $\tilde{S}$ is finite dimensional.…

We prove results about 1-cycles on certain Fano varieties using techniques that rely on rational curves. Firstly, we show that Fano weighted complete intersections with index bigger than half their dimension have trivial first Griffiths…

In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…

Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…

We consider the structure of classes of curves on a projective simply connected surface for which fundamental groups of the complements admit free quotients having rank greater than one with irreducible components belonging to a selected…