Related papers: An algorithm for the normal bundle of rational mon…

We show that on a generic curve, a bundle obtained by successive extensions is stable. We compute the dimension of the set of such extensions. We use degeneration methods specializing the curve to a chain of elliptic components

We give an explicit parametrization of the Hilbert schemes of rational curves C in P^n having a given splitting type of the restricted tangent bundle from P^n to C. The adopted technique uses the description of such curves as projections of…

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

The moduli space of slope-stable vector bundles on a normal projective variety over an algebraically closed field of characteristic $p\geq 0$ is stratified with respect to the decomposition type. On a smooth projective curve of genus at…

Using discrete Morse theory, we give an algorithm that prunes the excess of information in the Taylor resolution and constructs a new cellular free resolution for an arbitrary monomial ideal. The pruned resolution is not simplicial in…

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

We obtain a new important basic result on splice-quotient singularities in an elegant combinatorial-geometric way: every level of the divisorial filtration of the ring of functions is generated by monomials of the defining coordinate…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

In this paper, we propose a new splitting algorithm for dynamical low-rank approximation motivated by the fibre bundle structure of the set of fixed rank matrices. We first introduce a geometric description of the set of fixed rank matrices…

A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…

We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.

We describe algorithms for computing the intersection numbers of divisors and of Chern classes of the Hodge bundle on the moduli spaces of stable pointed curves. We also discuss the implementations and the results obtained. There are…

We construct a normal form for the walled Brauer algebra, together with the reduction algorithm. We apply normal form to calculate the numbers of monomials in generators with minimal length. We further utilize normal form to give explicit…

Let $C$ be a comb-like curve over $\mathbb{C}$, and $E$ be a vector bundle of rank $n$ on $C$. In this paper, we investigate the criteria for the semistability of the restriction of $E$ onto the components of $C$ when $E$ is given to be…

Given two general rational curves of the same degree in two projective spaces, one can ask whether there exists a third rational curve of the same degree that projects to both of them. We show that, under suitable assumptions on the degree…

We develop in this article an algorithm that, given a projective curve $C$, computes a \textit{gonal map}, that is, a finite morphism from $C$ to the projective line of minimal degree. Our method is based on the computation of scrollar…

We study (slope-)stability properties of syzygy bundles on a projective space P^N given by ideal generators of a homogeneous primary ideal. In particular we give a combinatorial criterion for a monomial ideal to have a semistable syzygy…

We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…

We give some methods for computing equations for certain Shimura curves, natural maps between them, and special points on them. We then illustrate these methods by working out several examples in varying degrees of detail. For instance, we…

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…