Related papers: A prolongation-projection algorithm for computing …
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…
This is a tutorial on some aspects of toric varieties related to their potential use in geometric modeling. We discuss projective toric varieties and their ideals, as well as real toric varieties and the algebraic moment map. In particular,…
This paper delves into an in-depth exploration of the Variable Projection (VP) algorithm, a powerful tool for solving separable nonlinear optimization problems across multiple domains, including system identification, image processing, and…
We study a family $\mathcal{B}$ of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give…
The v-number of a graded ideal is an invariant recently introduced in the context of coding theory, particularly in the study of Reed--Muller-type codes. In this work, we study the localized v-numbers of a binomial edge ideal $J_G$…
We present an algorithm to compute the Hodge ideals of $\mathbb{Q}$-divisors associated to any reduced effective divisor $D$. The computation of the Hodge ideals is based on an algorithm to compute parts of the $V$-filtration of Malgrange…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…
We consider the following problem: Given a rational matrix $A \in \setQ^{m \times n}$ and a rational polyhedron $Q \subseteq\setR^{m+p}$, decide if for all vectors $b \in \setR^m$, for which there exists an integral $z \in \setZ^p$ such…
We consider a stochastic Inverse Variational Inequality (IVI) problem defined by a continuous and co-coercive map over a closed and convex set. Motivated by the absence of performance guarantees for stochastic IVI, we present a…
Motivated by applications arising from sensor networks and machine learning, we consider the problem of minimizing a finite sum of nondifferentiable convex functions where each component function is associated with an agent and a…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…
We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active,…
This article discusses the geometric application of the method of multiplier ideal sheaves. It first briefly describes its application to effective problems in algebraic geometry and then presents and explains its application to the…
Given an affine algebra $R=K[x_1,\dots,x_n]/I$ over a field $K$, where $I$ is an ideal in the polynomial ring $P=K[x_1,\dots,x_n]$, we examine the task of effectively calculating re-embeddings of $I$, i.e., of presentations $R=P'/I'$ such…
We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the…