Related papers: Algorithms for Del Pezzo Surfaces of Degree 5 (Con…
We construct nontrivial L-equivalence between curves of genus one and degree five, and between elliptic surfaces of multisection index five. These results give the first examples of L-equivalence for curves (necessarily over…
We study unirationality of a Del Pezzo surface of degree two over a given (non algebraically closed) field, under the assumption that it admits at least one rational double point over an algebraic closure of the base field. As corollaries…
We study automorphism groups of real del Pezzo surfaces, concentrating on finite groups acting minimally on them. As a result, we obtain a vast part of classification of finite subgroups in the real plane Cremona group.
Three-dimensional del Pezzo varieties of degree 2 are double covers of projective space $\mathbb{P}^{3}$ branced in a quadric. In this paper we prove that if a del Pezzo variety of degree 2 has exactly 15 nodes then the corresponding…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…
We obtain new parameterized algorithms for the classical problem of determining whether a directed acyclic graph admits an upward planar drawing. Our results include a new fixed-parameter algorithm parameterized by the number of sources, an…
We classify completely the surfaces of general type whose canonical map is 3-to-1 onto a surface of minimal degree in projective space. These surfaces fall into 5 distinct classes and we give explicit examples belonging to each of these…
We classify del Pezzo surfaces with 1/3(1,1) points in 29 qG-deformation families grouped into six unprojection cascades (this overlaps with work of Fujita and Yasutake), we tabulate their biregular invariants, we give good model…
We solve the inverse Galois problem for del Pezzo surfaces of degree 1 over finite fields completely for 85 of the 112 possible types. We also determine for all 112 types the smallest field of existence. As an aside, we provide an example…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Given a birational parameterization of an algebraic surface S in the projective space, the purpose of this paper is to investigate the sets of points on S whose preimage consists in k or more points, counting multiplicities. They are…
We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with…
We completely solve the inverse Galois problem for del Pezzo surfaces of degree $2$ and $3$ over all finite fields.
A new concept for the higher-order accurate approximation of partial differential equations on manifolds is proposed where a surface mesh composed by higher-order elements is automatically generated based on level-set data. Thereby, it…
The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…
This is an expanded version of our work [AN88], 1988, in Russian. We classify del Pezzo surfaces over C with log terminal singularities of index \le 2. By classification, we understand a description of the intersection graph of all…
Regularization is used in many different areas of optimization when solutions are sought which not only minimize a given function, but also possess a certain degree of regularity. Popular applications are image denoising, sparse regression…
The global log canonical threshold of each non-singular complex del Pezzo surface was computed by Cheltsov. The proof used Koll\'ar-Shokurov's connectedness principle and other results relying on vanishing theorems of Kodaira type, not…
A frame is scalable if each of its vectors can be rescaled in such a way that the resulting set becomes a Parseval frame. In this paper, we consider four different optimization problems for determining if a frame is scalable. We offer some…
Given two graphs $H$ and $G$, the Subgraph Isomorphism problem asks if $H$ is isomorphic to a subgraph of $G$. While NP-hard in general, algorithms exist for various parameterized versions of the problem: for example, the problem can be…