相关论文: Log Sarkisov Program
In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the $n$-torus admits a fibre whose homological size is bounded below by some…
This work develops some technology for accessing the loop expansion of the Kontsevich integral of a knot. The setting is an application of the LMO invariant to certain surgery presentations of knots by framed links in the solid torus. A…
The purpose of this article is to give a Chlodowsky type generalization of Szasz operators defined by means of the Sheffer type polynomials. We obtain convergence properties of our operators with the help of Korovkin's theorem and the order…
We extend the simply-typed guarded $\lambda$-calculus with discrete probabilities and endow it with a program logic for reasoning about relational properties of guarded probabilistic computations. This provides a framework for programming…
This paper presents algorithms for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated…
We overview our recently introduced theory of n-fold integer programming which enables the polynomial time solution of fundamental linear and nonlinear integer programming problems in variable dimension. We demonstrate its power by…
Many years ago, Rota proposed a program on determining algebraic identities that can be satisfied by linear operators. After an extended period of dormant, progress on this program picked up speed in recent years, thanks to perspectives…
We use stratified Morse theory to construct a complex to compute the cohomology of the complement of a hyperplane arrangement with coefficients in a complex rank one local system. The linearization of this complex is shown to be the…
We provide a definition of Multidimensional Chebyshev Systems of order N which is satisfied by the solutions of a wide class of elliptic equations of order 2N. This definition generalizes a very large class of Extended Complete Chebyshev…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a…
We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…
We prove that (logarithmic) prismatic and (logarithmic) syntomic cohomology are representable in the category of logarithmic motives. As an application, we obtain Gysin maps for prismatic and syntomic cohomology, and we explicitly identify…
We study the minimal model program for lc pairs on projective morphism between complex analytic spaces. More precisely, we generalize the results by Birkar and the second author to the setup by Fujino.
Regev recently introduced a quantum factoring algorithm that may be perceived as a $d$-dimensional variation of Shor's factoring algorithm. In this work, we extend Regev's factoring algorithm to an algorithm for computing discrete…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In this thesis we define and study a categorification of the sl(N)-link polynomial using foams, for N\geq 3. For N=3 we define the universal sl(3)-link homology, using foams, which depends on three parameters and show that it is functorial,…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
In this paper, we introduce some new polynomials associated to linear codes over $\mathbb{F}_{q}$. In particular, we introduce the notion of split complete Jacobi polynomials attached to multiple sets of coordinate places of a linear code…
We take an algorithmic and computational approach to a basic problem in abstract algebra: determining the correct generalization to dialgebras of a given variety of nonassociative algebras. We give a simplified statement of the KP algorithm…
In this article we study polynomial logarithmic $q$-forms on a projective space and characterize those that define singular foliations of codimension $q$. Our main result is the algebraic proof of their infinitesimal stability when $q=2$…