Related papers: The Minimal Model Program for threefolds in charac…
We prove the following results for projective klt pairs of dimension $3$ over an algebraically closed field of char $p>5$: the cone theorem, the base point free theorem, the contraction theorem, finiteness of minimal models, termination…
We show that there are algorithms to determine if a 3-manifold contains an essential lamination or a Reebless foliation.
We prove the existence of a geometric characteristic submanifold for non-positively curved manifolds of any dimension greater than or equal to three. In dimension three, our result is a geometric version of the topological characteristic…
The algebra of invariants of several 3 x 3 matrices under the action of the orthogonal group by simultaneous conjugation is considered over a field of characteristic different from two. The maximal degree of elements of minimal system of…
Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number…
In two recent papers, we described some Siegel modular threefolds which admit a weak Calabi--Yau model. Not all of them admit a {\it projective} model. The purpose of this paper is to exhibit criterions for the projectivity, to treat…
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…
We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3-manifolds up to complexity 8. The program can treat also not necessarily closed 3-manifolds of bigger complexities, but here some…
In this paper a concise, complete proof of resolution of singularities of 3-folds in positive characteristic (>5) is given. The first proof of this theorem was given by Abhyankar in 1966. The resolution morphism in our proof is an…
We show the finiteness of log pluricanonical representations under the assumption of the existence of a good minimal model.
We describe a general program for studying the dynamics of surjective endomorphisms of algebraic varieties that are amenable to techniques from the minimal model program. We obtain density results on the pre-periodic points of surjective…
We improve the results in a previous article of Dieulefait and Manoharmayum and we deduce some stronger modularity results. In particular we deduce that any rigid Calabi-Yau threefold defined over Q with good reduction at 5 is modular and…
We give a complete topological classification of minimal surfaces in Euclidian three-space.
In this paper, we establish a vanishing theorem of Nadel type for the Witt multiplier ideals on threefolds over perfect fields of characteristic larger than five. As an application, if a projective normal threefold over $\mathbb{F}_q$ is…
We prove that the existence of log minimal models in dimension $d$ essentially implies the LMMP with scaling in dimension $d$. As a consequence we prove that a weak nonvanishing conjecture in dimension $d$ implies the minimal model…
A classification theorem is given of smooth threefolds of $\Bbb P^5$ covered by a family of dimension at least three of plane integral curves of degree $d\geq 2.$ It is shown that for such a threefold $X$ there are two possibilities:…
Context: The importance of the feature modeling for the software product lines considering the modeling and management of the variability. Objective: Define a protocol to conduct a systematic mapping study to summarize and synthesize the…
The Recognition Theorem for graded Lie algebras is an essential ingredient in the classification of finite-dimensional simple Lie algebras over an algebraically closed field of characteristic p > 3. The main goal of this monograph is to…
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…