相关论文: An Algorithmic Proof of Suslin's Stability Theorem…
In this paper we present a method for learning the parameters of a mixture of $k$ identical spherical Gaussians in $n$-dimensional space with an arbitrarily small separation between the components. Our algorithm is polynomial in all…
By the classical Sturm's theorem, the number of distinct real roots of a given real polynomial $f(x)$ within any interval $(a,b]$ can be expressed by the number of variations in the sign of the Sturm chain at the bounds. Through…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
We investigate the support of a distribution $f$ on the real grassmannian $\mathrm{Gr}_k(\mathbb R^n)$ whose spectrum, namely its nontrivial $\mathrm O(n)$-components, is restricted to a subset $\Lambda$ of all $\mathrm O(n)$-types. We…
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…
We prove that any stable method for resolving the Gibbs phenomenon - that is, recovering high-order accuracy from the first $m$ Fourier coefficients of an analytic and nonperiodic function - can converge at best root-exponentially fast in…
We survey the numerical stability of some fast algorithms for solving systems of linear equations and linear least squares problems with a low displacement-rank structure. For example, the matrices involved may be Toeplitz or Hankel. We…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
The stability of Bernstein's characterization of Gaussian distributions is extended to vectors by utilizing characteristic functions. Stability is used to develop a soft doubling argument that establishes the optimality of Gaussian vectors…
The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…
We show that, contrary to common belief, Dijkstra's self-stabilizing mutual exclusion algorithm on a ring [Dij74,Dij82] also stabilizes when the number of states per node is one less than the number of nodes on the ring.
The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…
It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
We obtain the most general matrix criterion for stability and instability of multi-component solitary waves considering a system of $N$ incoherently coupled nonlinear Schrodinger equations. Soliton stability is studied as a constrained…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…
This work is focused on the study of the nonlinear elliptic higher order equation \begin{equation}\nonumber \left( -\Delta \right)^m u = S_k[-u] + \lambda f, \qquad x \in \mathbb{R}^N, \end{equation} where the $k-$Hessian $S_k[u]$ is the…
We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…
We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…