Related papers: Simultaneous direct sum decompositions of several …
The theory of direct decomposition of a centrally orthocomplete effect algebra into direct summands of various types utilizes the notion of a type-determining (TD) set. A pseudo-effect algebra (PEA) is a (possibly) noncommutative version of…
In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
We consider polynomials that are orthogonal over an analytic Jordan curve L with respect to a positive analytic weight, and show that each such polynomial of sufficiently large degree can be expanded in a series of certain integral…
Exactly solvable Hamiltonians are useful in the study of quantum many-body systems using quantum computers. In the variational quantum eigensolver, a decomposition of the target Hamiltonian into exactly solvable fragments can be used for…
Any finite union of disjoint, mutually exterior Jordan curves in the complex plane can be approximated arbitrarily well in the Hausdorff topology by polynomial Julia sets. Furthermore, the proof is constructive.
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
We refine and extend quantitative bounds, on the fraction of nonnegative polynomials that are sums of squares, to the multihomogenous case.
Using a new compactification (toroidal compactification) and desingularization, we obtain a complete characterization of monodromy at infinity for polynomial Newton system of arbitrary degree, in which we establish an equivalence between…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
We study the Dynkin diagram associated to the monodromy of direct sums of polynomials. The monodromy problem asks under which conditions on a polynomial, the monodromy of a vanishing cycle generates the whole homology of a regular fiber. We…
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
We present an algebraic theory of orthogonal polynomials in several variables that includes classical orthogonal polynomials as a special case. Our bottom line is a straightforward connection between apolarity of binary forms and the inner…
Iterative methods for the simultaneous determination of all roots of an equation are dis-cussed. The multiplicities of the roots are assumed to be known in advance. The methods are proved to have a cubical rate of convergence. Numerical…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
The dissertation focuses on decomposing a group algebra $kG$ over a field of positive characteristic into a direct sum of projective indecomposable modules. Such a decomposition is obtained together with the Artin--Wedderburn Theorem. The…
All rational parametric curves with prescribed polynomial tangent direction form a vector space. Via tangent directions with rational norm, this includes the important case of rational Pythagorean hodograph curves. We study vector subspaces…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \in K[x_1 , . . . , x_n]$ (where $K \subseteq \mathbb{C}$) of…