Related papers: Triangular bases of integral closures

The main focus of this paper is on determining the highest non-vanishing local cohomology modules of \Omega_(B/R), \Omega_(B/V)(\Omega_(B/k)) where R is either a complete regular local ring or a complete local normal domain with coefficient…

Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…

We present a prescription for choosing orthogonal bases of differential $n$-forms belonging to quadratic twisted period integrals, with respect to the intersection number inner product. To evaluate these inner products, we additionally…

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…

Let $(A,\mathfrak{m})$ be an analytically un-ramified Noetherian local ring of dimension $d \geq 1$, $I$ a regular $\mathfrak{m}$-primary ideal of $A$ and let $\overline{I}$ be integral closure ideal of $I$. If $A$ is of characteristic $p >…

For positive integers m >= n >= p, we compute the GL_m x GL_n-equivariant description of the local cohomology modules of the polynomial ring S of functions on the space of m x n matrices, with support in the ideal of p x p minors. Our…

Perfect ideals $I$ of grade $3$ in a local ring $(R,\mathfrak{m},\Bbbk)$ can be classified based on multiplicative structures on $\text{Tor}^R_{\bullet}(R/I,\Bbbk)$. The classification is incomplete in the sense that it remains open which…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…

A relaxation method based on border basis reduction which improves the efficiency of Lasserre's approach is proposed to compute the optimum of a polynomial function on a basic closed semi algebraic set. A new stopping criterion is given to…

In this article, we construct integrally closed modules of rank two over a two-dimensional regular local ring. The modules are explicitly constructed from a given complete monomial ideal with respect to a regular system of parameters. Then…

Let $k$ be a field with characteristic zero, $R$ be the ring $k[x_1, \cdots, x_n]$ and $I$ be a monomial ideal of $R$. We study the Artinian local algebra $R/I$ when considered as an $R$-module $M$. We show that the largest reduced…

This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…

Let $A=K[a_1,\ldots,a_n]$ be a weighted $\mathbb{N}$-filtered solvable polynomial algebra with filtration $FA=\{ F_pA\}_{p\in\mathbb{N}}$, where solvable polynomial algebras are in the sense of (A. Kandri-Rody and V. Weispfenning,…

We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares…

The Qth-power algorithm for computing structured global presentations of integral closures of affine domains over finite fields is modified to compute structured presentations of integral closures of ideals in affine domains over finite…

Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…

Lagrangian relaxation stands among the most efficient approaches for solving a Mixed Integer Linear Programs (MILP) with difficult constraints. Given any duals for these constraints, called Lagrangian Multipliers (LMs), it returns a bound…

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Let $R$ be a real closed field and let ${\mathcal S}(M)$ be the ring of (continuous) semialgebraic functions on a semialgebraic set $M\subset R^n$ and let ${\mathcal S}^*(M)$ be its subring of bounded semialgebraic functions. In this work…