Related papers: Efficient Algorithms for Finite $\mathbb{Z}$-Algeb…

This article presents the first mixed-integer linear programming (MILP)-based iterative algorithm to solve factorable mixed-integer nonlinear programs (MINLPs) with bounded, differentiable periodic functions to global optimality with an…

We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Let $R$ be a commutative Noetherian ring of prime characteristic $p$. The main goal of this paper is to study in some detail when \[ \overline{W^R}:=\{\mathfrak{p}\in\operatorname{Spec} (R):\ \mathcal{F}^{E_{\mathfrak{p}}}\text{ is finitely…

We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.

Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact algorithm that runs in time singly-exponential in $r$. This…

We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

This paper is motivated by the results and questions of Jason P. Bell and Kevin G. Hare in the paper "On $\mathbb{Z}$-modules of algebraic integers" (Canad. J. Math. Vol. 61, 2009). Let $\mathcal{O}$ be a finitely generated…

We consider the computation of syzygies of multivariate polynomials in a finite-dimensional setting: for a $\mathbb{K}[X_1,\dots,X_r]$-module $\mathcal{M}$ of finite dimension $D$ as a $\mathbb{K}$-vector space, and given elements…

In this paper, we introduce a novel semidefinite programming framework for designing custom frugal resolvent splitting algorithms which find a zero in the sum of n monotone operators. This framework features a number of design choices which…

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,…

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

This note aims at finding explicit and efficient generation of ideals in subalgebras $R$ of the polynomial ring $S=k[t]$ ($k$ a field) such that $t^{c_0}S \subseteq R$ for some integer $c_0 > 0$. The class of these subalgebras which we call…

In this paper, we identify partial correlation information structures that allow for simpler reformulations in evaluating the maximum expected value of mixed integer linear programs with random objective coefficients. To this end, assuming…

Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…

This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…

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…