Related papers: Multiplicity estimates, analytic cycles and Newton…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…
We consider the fundamental learning problem of estimating properties of distributions over large domains. Using a novel piecewise-polynomial approximation technique, we derive the first unified methodology for constructing sample- and…
The classical polynomial interpolation problem in several variables can be generalized to the case of points with greater multiplicities. What is known, as yet, is essentially concentrated in the Alexander-Hirschowitz Theorem which says…
For a polynomial dynamical system, we study the problem of computing the minimal differential equation satisfied by a chosen coordinate (in other words, projecting the system on the coordinate). This problem can be viewed as a special case…
The goal of this work is threefold. First, we give an expression of the most general five point integral on M_{0,n} in terms of Chebyshev polynomials. Second, we choose a special kinematics that transforms the polynomial form of the…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
In this revised form, the proof of the principal lemma has been simplified and the main theorem has been extended to all characteristics for those varieties which are smooth in codimension one. This principal theorem essentially says the…
According to the Kouchnirenko theorem, for a generic (precisely non-degenerate in the Kouchnirenko sense) isolated singularity $f$ its Milnor number $\mu (f)$ is equal to the Newton number $\nu (\Gamma_{+}(f))$ of a combinatorial object…
The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…
For the space of single-variable monic and centered complex polynomial vector fields of arbitrary degree d, it is proved that any bifurcation which preserves the multiplicity of equilibrium points can be realized as a composition of a…
We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…
We introduce a spectrum for arbitrary varieties. This generalizes the definition by Steenbrink for hypersurfaces. In the isolated complete intersection singularity case, it coincides with the one given by Ebeling and Steenbrink except for…
The notion of $\varepsilon$-multiplicity was originally defined by Ulrich and Validashti as a limsup and they used it to detect integral dependence of modules. It is important to know if it can be realized as a limit. In this article we…
Finding suitable points for multivariate polynomial interpolation and approximation is a challenging task. Yet, despite this challenge, there has been tremendous research dedicated to this singular cause. In this paper, we begin by…
Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to polytrees of bounded in-degree. Polynomial-time algorithms are…
We generalize to all normal complex algebraic varieties the valuative characterization of multiplier ideals due to Boucksom-Favre-Jonsson in the smooth case. To that end, we extend the log discrepancy function to the space of all real…
The multi-objective optimization is to optimize several objective functions over a common feasible set. Since the objectives usually do not share a common optimizer, people often consider (weakly) Pareto points. This paper studies…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We use tropical geometry to compute the multidegree and Newton polytope of the hypersurface of a statistical model with two hidden and four observed binary random variables, solving an open question stated by Drton, Sturmfels and Sullivant…
We study the problem nonparametric classification with repeated observations. Let $\bX$ be the $d$ dimensional feature vector and let $Y$ denote the label taking values in $\{1,\dots ,M\}$. In contrast to usual setup with large sample size…