相关论文: Extensions and Corrections for: ``A Convex Geometr…

In this paper we focus on r-geometric polynomials, r-exponential polynomials and their harmonic versions. It is shown that harmonic versions of these polynomials and their generalizations are useful to obtain closed forms of some series…

A new sampling methodology based on incomplete cosine expansion series is presented as an alternative to the traditional sinc function approach. Numerical integration shows that this methodology is efficient and practical. Applying the…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…

As observed by Auderset et al. (2005) and Wiesel (2012), viewing covariance matrices as elements of a Riemannian manifold and using the concept of geodesic convexity provide useful tools for studying M-estimators of multivariate scatter. In…

This paper considers some different measures for how additively structured a convex set can be. The main result gives a construction of a convex set $A$ containing $\Omega(|A|^{3/2})$ three-term arithmetic progressions.

A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…

A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…

These lecture notes for the IAS/Park City Graduate Summer School in Geometric Combinatorics (July 2004) provide an overview of root systems, generalized associahedra, and the combinatorics of clusters. Lectures 1-2 cover classical material:…

Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…

In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…

Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…

We give new results for problems in computational and statistical machine learning using tools from high-dimensional geometry and probability. We break up our treatment into two parts. In Part I, we focus on computational considerations in…

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…

We report on various results, conjectures, and open problems related to Kazhdan-Lusztig polynomials of matroids. We focus on conjectures about the roots of these polynomials, all of which appear here for the first time.

We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain…

In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

We present mathematical methods, based on convex optimization, for correcting non-physical coherency matrices measured in polarimetry. We also develop the method for recovering the coherency matrices corresponding to the smallest and…