Related papers: Using Semicontinuity for Standard Bases Computatio…
In this article we investigate when a homogeneous ideal in a graded ring is normal, that is, when all positive powers of the ideal are integrally closed. We are particularly interested in homogeneous ideals in an N-graded ring generated by…
The primary goal of this paper is to provide a general multiplicity estimate. Our main theorem allows to reduce a proof of multiplicity lemma to the study of ideals stable under some appropriate transformation of a polynomial ring. In…
This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…
We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…
We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is…
We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…
Submodular maximization is a general optimization problem with a wide range of applications in machine learning (e.g., active learning, clustering, and feature selection). In large-scale optimization, the parallel running time of an…
The theory of standard bases in polynomial rings with coefficients in a ring R with respect to local orderings is developed. R is a commutative Noetherian ring with 1 and we assume that linear equations are solvable in R.
We extend classical results of Rado on partition regularity of systems of linear equations with integer coefficients to the case when the coefficient ring is either an arbitrary integral domain or a noetherian ring. In particular, we show…
Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimization problems. In this paper, we show that a large class of…
Standard integration-by-parts (IBP) reduction methods typically yield Feynman integral bases where the reduction of some integrals gives rise to coefficients singular as the dimensional regulator $\epsilon\rightarrow 0$. These singular…
It is a notorious open question whether integer programs (IPs), with an integer coefficient matrix $M$ whose subdeterminants are all bounded by a constant $\Delta$ in absolute value, can be solved in polynomial time. We answer this question…
We describe some "unrestricted" algorithms which are useful for the computation of elementary and special functions when the precision required is not known in advance. Several general classes of algorithms are identified and illustrated by…
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
We give a quantum algorithm for solving semidefinite programs (SDPs). It has worst-case running time $n^{\frac{1}{2}} m^{\frac{1}{2}} s^2 \text{poly}(\log(n), \log(m), R, r, 1/\delta)$, with $n$ and $s$ the dimension and row-sparsity of the…
In this work, we develop machine learning techniques to study nonperturbative scattering amplitudes. We focus on the two-to-two scattering amplitude of identical scalar particles, setting the double discontinuity to zero as a simplifying…
A new relaxed variant of interior point method for low-rank semidefinite programming problems is proposed in this paper. The method is a step outside of the usual interior point framework. In anticipation to converging to a low-rank primal…
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…