Related papers: On mu-Symmetric Polynomials
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method's good…
We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…
There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…
Recursive maps of high order of convergence $m$ (say $m=2^{10}$ or $m=2^{20}$) induce certain monotone step functions from which one can filter relevant information needed to globally separate and compute the real roots of a function on a…
In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…
An iterative square root of a function $f$ is a function $g$ such that $g(g(\cdot))=f(\cdot)$. We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. This is used to prove that…
For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…
We introduce an operation on skew-symmetric matrices over $\mathbb{Z}/\ell\mathbb{Z}$ called switching, and also define a class of skew-symmetric matrices over $\mathbb{Z}/\ell\mathbb{Z}$ referred to as modular Eulerian matrices. We then…
In algebraic, topological, and geometric combinatorics inequalities among the coefficients of combinatorial polynomials are frequently studied. Recently a notion called the alternatingly increasing property, which is stronger than…
In arXiv:1607.06679, Marcus proved that certain functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. In this note, we generalize the results from the Marcus paper to…
We investigate the plane dynamical system given by the secant map applied to a polynomial $p$ having at least one multiple root of multiplicity $d>1$. We prove that the local dynamics around the fixed points associated to the roots of $p$…
The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…
In this paper, we survey and study definitions and properties of tropical polynomials, tropical rational functions and in general, tropical meromorphic functions, emphasizing practical techniques that can really carry out computations. For…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
We take advantage of the combinatorial interpretations of many sequences of polynomials of binomial type to define a sequence of symmetric functions corresponding to each sequence of polynomials of binomial type. We derive many of the…
The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…
Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolutions. These convolutions preserve real-rootedness and…