Related papers: An algorithmic approach to resolutions

We develop a moduli theory of algebraic varieties and pairs of non-negative Kodaira dimension. We define stable minimal models and construct their projective coarse moduli spaces under certain natural conditions. This can be applied to a…

Minimal models of chain complexes associated with free torus actions on spaces have been extensively studied in the literature. In this paper, we discuss these constructions using the language of operads. The main goal of this paper is to…

This paper presents an efficient gradient projection-based method for structural topological optimization problems characterized by a nonlinear objective function which is minimized over a feasible region defined by bilateral bounds and a…

This work proposes a new method to select the augmentation parameters in the operator splitting quadratic program (OSQP) algorithm so as to reduce the computation time of overall algorithm. The selection is based upon the information of…

For R=Q/J with Q a commutative graded algebra over a field and J non-zero, we relate the slopes of the minimal resolutions of R over Q and of k=R/R_{+} over R. When Q and R are Koszul and J_1=0 we prove Tor^Q_i(R,k)_j=0 for j>2i, for each…

In this article we study modules over wild canonical algebras which correspond to extension bundles [9] over weighted projective lines. We prove that all modules attached to extension bundles can be established by matrices with coefficients…

Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article,…

We prove that applying a projective functor to a holonomic simple module over a semi-simple finite dimensional complex Lie algebra produces a module that has an essential semi-simple submodule of finite length. This implies that holonomic…

Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…

This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…

A novel algorithm to solve the quadratic programming problem over ellipsoids is proposed. This is achieved by splitting the problem into two optimisation sub-problems, quadratic programming over a sphere and orthogonal projection. Next, an…

A presheaf of complexes is constructed on a category of weighted finite subsets of a fixed Euclidean space. To each object, a Koszul complex is assigned which resolves the coordinate ring of least squares solutions on that data set for a…

We provide a locally free resolution of the projectivized symmetric algebra of the ideal sheaf of a zero-dimensional scheme defined by n + 1 equations in an n-dimensional variety. The resolution is given in terms of the resolution of the…

In previous work, the authors introduced the notion of Q-Koszul algebras, as a tool to "model" module categories for semisimple algebraic groups over fields of large characteristics. Here we suggest the model extends to small…

Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…

We propose a categorical and algebraic study of quantale modules. The results and constructions presented are also applied to abstract algebraic logic and to image processing tasks.

We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

We give an explicit quadratic Grobner basis for generalized Chow rings of supersolvable built lattices, with the help of the operadic structure on geometric lattices introduced in a previous article. This shows that the generalized Chow…

In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…