Related papers: Multiplicity estimates, analytic cycles and Newton…
A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
By defining multiplicities for zeros of polynomials over hyperfields, Baker and Lorscheid were able to provide a unifying perspective on Descartes's rule and the Newton polygon rule for polynomials over a formally-real and valued field…
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…
In a multidimensional infinite layer bounded by two hyperplanes, the Poisson equation with the polynomial right-hand side is considered. It is shown that the Dirichlet boundary value problem and the mixed Dirichlet-Neumann boundary value…
Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…
We show that for continuous time dynamical systems described by polynomial differential equations of modest degree (typically equal to three), the following decision problems which arise in numerous areas of systems and control theory…
We study multivariate problems like function approximation, numerical integration, global optimization and dispersion. We obtain new results on the information complexity $n(\varepsilon,d)$ of these problems. The information complexity is…
In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…
Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…
We investigate geometric and topological properties of $d$-majorization -- a generalization of classical majorization to positive weight vectors $d \in \mathbb{R}^n$. In particular, we derive a new, simplified characterization of…
The paper develops Newton's method of finding multiple eigenvalues with one Jordan block and corresponding generalized eigenvectors for matrices dependent on parameters. It computes the nearest value of a parameter vector with a matrix…
We study differentially private (DP) optimization algorithms for stochastic and empirical objectives which are neither smooth nor convex, and propose methods that return a Goldstein-stationary point with sample complexity bounds that…
Generally, multi-objective optimisation problems are solved exactly or approximated by solving a series of scalarisations, for example by dichotomic search. In this paper, we take a different approach and attempt to compute the set of all…
In this article we investigate a finite element formulation of strongly monotone quasi-linear elliptic PDEs in the context of fixed-point iterations. As opposed to Newton's method, which requires information from the previous iteration in…
The purpose of this paper is to show that the multiplicities of a discrete series representation relatively to a compact subgroup can be "computed" geometrically, in the way predicted by the "qantization commutes with reduction" principle…
We provide combinatorial/topological formula for the multiplicity of a complex analytic normal surface singularity whenever the analytic structure on the fixed topological type is generic.
Geometry of sparse systems of polynomial equations (i.e. the ones with prescribed monomials and generic coefficients) is well studied in terms of their Newton polytopes. The results of this study are colloquially known as the…
We prove stronger variants of a multiplier theorem of Kislyakov. The key ingredients are based on ideas of Kislaykov and the Kahane-Salem-Zygmund inequality. As a by-product we show various multiplier theorems for spaces of trigonometric…
We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal…