Related papers: The Complexity of Testing Monomials in Multivariat…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…
Let $\mathcal F$ be either the set of all bounded holomorphic functions or the set of all $m$-homogeneous polynomials on the unit ball of $\ell\_r$. We give a systematic study of the sets of all $u\in\ell\_r$ for which the monomial…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
Polymer materials have the characteristic feature that they are multiscale systems by definition. Already the description of a single molecules involves a multitude of different scales, and cooperative processes in polymer assemblies are…
Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…
Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…
In this article, we study several probabilistic properties of polynomials defined over the ring of $p$-adic integers under the Haar measure. First, we calculate the probability that a monic polynomial is separable, generalizing a result of…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
We study the computational complexity of a diagonalization technique for multivariate homogeneous polynomials, that is, expressing them as sums of powers of independent linear forms. It is based on Harrison's center theory and consists of a…
Tropical differential equations are introduced and an algorithm is designed which tests solvability of a system of tropical linear differential equations within the complexity polynomial in the size of the system and in its coefficients.…
Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…
In this survey, different aspects of the theory of orthogonal polynomials of one (real or complex) variable are reviewed. Orthogonal polynomials on the unit circle are not discussed.
In this work we present a definition for coherence and compatibility of multilinear mappings and homogenous polynomial classes. These definitions are more restricted than the ones proposed before. We began analyzing this new definition in a…
We have developed a patch implementing multivariate polynomials seen as a multi-base algebra. The patch is to be released into the software Sage and can already be found within the Sage-Combinat distribution. One can use our patch to define…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to…
We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…