Related papers: Simultaneous direct sum decompositions of several …
Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…
This paper is mainly concerned with identities like \[ (x_1^d + x_2^d + \cdots + x_r^d) (y_1^d + y_2^d + \cdots y_n^d) = z_1^d + z_2^d + \cdots + z_n^d \] where $d>2,$ $x=(x_1, x_2, \dots, x_r)$ and $y=(y_1, y_2, \dots, y_n)$ are systems of…
A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…
A problem concerning the shift of roots of a system of homogeneous algebraic equations is investigated. Its conservation and decomposition of a multiple root into simple roots are discussed.
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…
Calculations of the Fourier transform of a constant quantity over an area or volume defined by polygons (connected vertices) are often useful in modeling wave scattering, or in fourier-space filtering of real-space vector-based volumes and…
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…
We present a new closed form for the interpolating polynomial of the general univariate Hermite interpolation that requires only calculation of polynomial derivatives, instead of derivatives of rational functions. This result is used to…
Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
The article is devoted to the investigation of transformation groups of polynomials over Cayley-Dickson algebras and their manifolds of zeros. The problems about expressibility of zeros with the help of roots and decomposibility of…
Let $F$ be a homogeneous form of degree $d$ in $n$ variables. A Waring decomposition of $F$ is a way to express $F$ as a sum of $d^{th}$ powers of linear forms. In this paper we consider the decompositions of a form as a sum of expressions,…