相关论文: An Algorithm for Fat Points on P2

Given a finite set of points $\Gamma$ in $\mathbb P^{k-1}$ not all contained in a hyperplane, the "fitting problem" asks what is the maximum number $hyp(\Gamma)$ of these points that can fit in some hyperplane and what is (are) the…

Let $G$ be a complex simply connected semisimple Lie group and let $\Gamma$ be a torsionless uniform irreducible lattice in $G$. Then $\Gamma\backslash G$ is a compact complex non-K\"ahler manifold whose tangent bundle is holomorphically…

We study fundamental point-line covering problems in computational geometry, in which the input is a set $S$ of points in the plane. The first is the Rich Lines problem, which asks for the set of all lines that each covers at least…

In this work, we introduce $(r,i)$-regular fat linear sets, which are defined as linear sets containing exactly $r$ points of weight $i$ and all other points of weight one. This notion generalizes and unifies existing constructions;…

Let $X$ be a submanifold of dimension $d\geq 2$ of the complex projective space $\mathbb P^n$. We prove results of the following type. i) If $X$ is irregular and $n=2d$ then the normal bundle $N_{X|\mathbb P^n}$ is indecomposable. ii) If…

Let $\mathcal{F}$ be a family of graphs, and let $p,r$ be nonnegative integers. The \textsc{$(p,r,\mathcal{F})$-Covering} problem asks whether for a graph $G$ and an integer $k$, there exists a set $D$ of at most $k$ vertices in $G$ such…

Given a set $P$ of points in the plane, a point burning process is a discrete time process to burn all the points of $P$ where fires must be initiated at the given points. Specifically, the point burning process starts with a single burnt…

A fake projective plane is a complex surface with the same Betti numbers as $\mathbb{C} P^2$ but not biholomorphic to it. We study the fake projective plane $\mathbb{P}_{\operatorname{fake}}^2 = (a = 7, p = 2, \emptyset, D_3 2_7)$ in the…

We prove a number of results to the general effect that, under obviously necessary numerical and determinant constraints, "most" morphisms between fixed bundles on a complex elliptic curve produce (co)kernels which can either be specified…

Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…

In order to enumerate the fake projective planes, as announced in~\cite{CS}, we found explicit generators and a presentation for each maximal arithmetic subgroup $\bar\Gamma$ of~$PU(2,1)$ for which the (appropriately normalized) covolume…

Let $f_s: X_s \to {\bf {P}}^2$ be the blowing-up of $s$ distinct points and $E$ a vector bundle on $X_s$. Here we give a cohomological criterio which is equivalent to $E \cong f_s^\ast (A)$ with $A$ a direct sum of line bundles. We also…

The SHGH conjecture proposes a solution to the question of how many conditions a general union of fat points imposes on the complete linear system of curves in $\mathbb P^2$ of fixed degree $d$, and it is known to be true in many cases. We…

The purpose of this paper is to construct some special kind of subschemes in $\mathbb{P}^N$ with $ N\ge 3$, which we call them "fat flat subschemes" and compute their Waldschmidt constants. These subschemes are constructed by adding, in a…

We investigate different approaches to machine learning of line bundle cohomology on complex surfaces as well as on Calabi-Yau three-folds. Standard function learning based on simple fully connected networks with logistic sigmoids is…

Accurately predicting the three-dimensional structures of protein-ligand complexes remains a fundamental challenge in computational drug discovery that limits the pace and success of therapeutic design. Deep learning methods have recently…

In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that…

We are interested in those bundles $C$ on $\mathbb{P}^N$ which admit a resolution of the form $$ 0 \to \mathbb{C}^s \otimes E \xrightarrow{\mu} \mathbb{C}^t \otimes F \to C \to 0.$$ In this paper we prove that, under suitable conditions on…

During the last years, several algorithmic meta-theorems have appeared (Bodlaender et al. [FOCS 2009], Fomin et al. [SODA 2010], Kim et al. [ICALP 2013]) guaranteeing the existence of linear kernels on sparse graphs for problems satisfying…

Developing a previous idea of Faltings, we characterize the complete intersections of codimension 2 in P^n, n>=3, over an algebraically closed field of any characteristic, among l.c.i. X, as those that are subcanonical and…