Related papers: On the logarithmic energy of solutions to the poly…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We study the Riesz and logarithmic energies on the Grassmannian $\operatorname{Gr}_{2,4}$ of $2$-dimensional subspaces of $\mathbb{R}^4$. We prove that the continuous Riesz and logarithmic energies are uniquely minimized by the uniform…

By expressing polynomials in the basis of Chebyshev polynomials, certain families of hyperbolic polynomials appear naturally. Some of these families have all their roots in the interval $[-2,2]$. In many cases the span of the family of…

Using a formulation of quantum mechanics based on orthogonal polynomials in the energy and physical parameters, we present a method that gives the class of potential functions for exactly solvable problems corresponding to a given energy…

We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…

This paper presents an innovative set of tools developed to support a methodology to find the left eigenvalues of $m$ order quaternion square matrix. It is solving four real polynomial equations of order not greater than $4m-3$ in four…

Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The classical algorithm to solve this problem is based on a time memory trade-off. We will present an…

We show how a number of NP-complete as well as NP-hard problems can be reduced to the Sturm-Liouville eigenvalue problem in the quantum setting with queries. We consider power queries which are derived from the propagator of a system…

Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is…

In this paper, we investigate discrete logarithmic energy problems in the unit circle. We study the equilibrium configuration of $n$ electrons and $n-1$ pairs of external protons of charge $+1/2$. It is shown that all the critical points of…

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

We consider the lower order eigenvalues of poly-Laplacian with any order on spherical domains. We obtain universal inequalities for them and show that our results are optimal.

We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…

This paper considers submodular function minimization (SFM) restricted to a family of subsets. We show that SFM over complements of families with certain hierarchical structures can be solved in polynomial-time. This yields a…

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behavior of an experiment? How many of the…

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…

Energy functions offer natural extensions of controllability and observability Gramians to nonlinear systems, enabling various applications such as computing reachable sets, optimizing actuator and sensor placement, performing balanced…

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

In this paper, we study first-order methods on a large variety of low-rank matrix optimization problems, whose solutions only live in a low dimensional eigenspace. Traditional first-order methods depend on the eigenvalue decomposition at…