相关论文: Log Sarkisov Program

We introduce a variant of stable logarithmic maps, which we call punctured logarithmic maps. They allow an extension of logarithmic Gromov-Witten theory in which marked points have a negative order of tangency with boundary divisors. As a…

Bayesian networks provide an elegant formalism for representing and reasoning about uncertainty using probability theory. Theyare a probabilistic extension of propositional logic and, hence, inherit some of the limitations of propositional…

The purpose of this short article is to prove a product formula relating the log Gromov-Witten invariants of $V \times W$ with those of $V$ and $W$ in the case the log structure on $V$ is trivial.

The goal of this paper is to provide a methodology to prove existence of (fiberwise hyperbolic) real-analytic invariant tori in real-analytic quasi-periodic skew-product dynamical systems that present nearly-invariant tori of the same…

We introduce the concept of sos-convex Lyapunov functions for stability analysis of both linear and nonlinear difference inclusions (also known as discrete-time switched systems). These are polynomial Lyapunov functions that have an…

In this work we develop a theory of motives for logarithmic schemes over fields in the sense of Fontaine, Illusie, and Kato. Our construction is based on the notion of finite log correspondences, the dividing Nisnevich topology on log…

We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…

We introduce homological and homotopical $r$-syzygies of Mori fibre spaces as a generalization of Sarkisov links and relations of Sarkisov links. For any proper morphism $Y/R$, we construct a contractible (if not empty) CW complex such that…

We study Vassiliev invariants of links in a 3-manifold $M$ by using chord diagrams labeled by elements of the fundamental group of $M$. We construct universal Vassiliev invariants of links in $M$, where $M=P^2\times [0,1]$ is a cylinder…

In this article we prove a multidimensional version of the Nazarov lemma. The proof is based on an appropriate generalisation of the regularised system of intervals introduced by Havin, Nazarov and Mashreghi to several dimensions.

We introduce the notion of induced Maslov cycle, which describes and unifies geometrical and topological invariants of many apparently unrelated problems, from Real Algebraic Geometry to sub-Riemannian Geometry.

The normal field extension Q(rho(n)), with the algebraic number rho(n) = 2 cos(pi/n) for natural n, is related to ratios of the lengths between diagonals and the side of a regular n-gon. This has been considered in a paper by P. Steinbach.…

The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

We study the construction and properties of the Gysin triangle in an axiomatic framework which covers triangulated mixed motives and MGl-modules over an arbitrary base S. This allows to define the Gysin morphism associated to a projective…

We present a new system S for handling uncertainty in a quantified modal logic (first-order modal logic). The system is based on both probability theory and proof theory. The system is derived from Chisholm's epistemology. We concretize…

We introduce rigid syntomic cohomology for strictly semistable log schemes over a complete discrete valuation ring of mixed characteristic (0,p). In case a good compactification exists, we compare this cohomology theory to…

The Erd\H{o}s-Ginzburg-Ziv theorem states that for any sequence of $2n-1$ integers, there exists a subsequence of $n$ elements whose sum is divisible by $n$. In this article, we provide a simple, practical $O(n\log\log n)$ algorithm and a…

Here we give a detailed proof for the crucial point in our Minsky machine simulation - that any linear logic derivation for a specific Horn sequent can be transformed into a Minsky computation leading from an initial configuration to the…

In this article, we introduce the notion of good map and use it to establish Gromov-Witten theory for orbifolds.