相关论文: Extensions and Corrections for: ``A Convex Geometr…
In [1] we highlighted the fact that the log polynomial expansion employed in Nature Astron. 3, no.3, 272-277 (2019) [2] is a poor approximation to flat $\Lambda$CDM, so using it to infer deviations from flat $\Lambda$CDM is not…
This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…
This paper has been withdrawn: it has been merged with the preprint to which it refers.
In this appendix we provide additional supplementary material to "A Collective, Probabilistic Approach to Schema Mapping." We include an additional extended example, supplementary experiment details, and proof for the complexity result…
This paper has been withdrawn by the author due to an error in the main proof (thanks to Carlos D'Andrea)
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
Zonotopes are a rich and fascinating family of polytopes, with connections to many areas of mathematics. In this article we provide a brief survey of classical and recent results related to lattice zonotopes. Our emphasis is on connections…
Geometric number systems, obtained by extending the real number system to include new anticommuting square roots of +1 and -1, provide a royal road to higher mathematics by largely sidestepping the tedious languages of tensor analysis and…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
Previous analyses of Laguerre's method have provided results on the convergence and properties of this popular method when applied to the polynomials $p_n(z)=z^n-1$, $n\in\mathbb{N}$. While these analyses appear to provide a fairly complete…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
Combinatorial samplers are algorithmic schemes devised for the approximate- and exact-size generation of large random combinatorial structures, such as context-free words, various tree-like data structures, maps, tilings, RNA molecules.…
We present a novel technical method for analyzing the hidden convex structure embedded in the joint range of a quadratic mapping defined on a Hilbert space. Our approach stands out by relying exclusively on elementary mathematical…
Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…
In this paper, we improve Polyak's local convexity result for quadratic transformations. Extension and open problems are also presented.
We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…
The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…