Related papers: Multiplicity estimates, analytic cycles and Newton…
Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required…
In this paper, we treat estimation and prediction problems where negative multinomial variables are observed and in particular consider unbalanced settings. First, the problem of estimating multiple negative multinomial parameter vectors…
We show a lower estimate of the Milnor number of an isolated hypersurface singularity, via its Newton number. We also obtain analogous estimate of the Milnor number of an isolated singularity of a similar complete intersection variety.
We establish a rigorous well-posedness results for the Marchenko system associated to the scattering theory of the one dimensional Gross-Pitaevskii equation (GP). Under some assumptions on the scattering data, these well-posedness results…
This research introduces a new method for the transition from partial to ordinary differential equations that is based on the Kolmogorov superposition theorem. In this paper, we discuss the numerical implementation of the Kolmogorov theorem…
The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an unknown real-valued low-rank matrix from a random sample of…
We give an effective method to determine the multiplier ideals and jumping numbers associated with a curve singularity $C$ in a smooth surface. We characterize the multiplier ideals in terms of certain Newton polygons, generalizing a…
In this paper, we study the polynomial optimization problem of multi-forms over the intersection of the multi-spheres and the nonnegative orthants. This class of problems is NP-hard in general, and includes the problem of finding the best…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…
We study the $L_1$-approximation of $d$-variate monotone functions based on information from $n$ function evaluations. It is known that this problem suffers from the curse of dimensionality in the deterministic setting, that is, the number…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
Using invariants from commutative algebra to count geometric objects is a basic idea in singularities. For example, the multiplicity of an ideal is used to count points of intersection of two analytic sets at points of non-transverse…
In Bayesian probabilistic programming, a central problem is to estimate the normalised posterior distribution (NPD) of a probabilistic program with conditioning via score (a.k.a. observe) statements. Most previous approaches address this…
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…
We define a version of multiplier ideals, the Mather multiplier ideals, on a variety with arbitrary singularities, using the Mather discrepancy and the Jacobian ideal. In this context we prove a relative vanishing theorem, thus obtaining…
Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…
We prove limit equalities between the sharp constants in weighted Nikolskii-type inequalities for multivariate polynomials on an $m$-dimensional cube and ball and the corresponding constants for entire functions of exponential type.
Papadimitriou and Yannakakis show that the polynomial-time solvability of a certain singleobjective problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $(1+\varepsilon, \dots ,…
This paper proposes a method for construction of approximate feasible primal solutions from dual ones for large-scale optimization problems possessing certain separability properties. Whereas infeasible primal estimates can typically be…