Related papers: Simultaneous direct sum decompositions of several …
The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…
We show that various identities from [1] and [3] involving Gould-Hopper polynomials can be deduced from the real but also complex orthogonal invariance of multivariate Gaussian distributions. We also deduce from this principle a useful…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
We introduce a new multivariate orthogonal polynomial which is a 2-parameter deformation of the spherical polynomial by harmonic analysis on symmetric cone. This is also regarded as a multivariate analogue of the circular Jacobi polynomial.…
We discuss various aspects of representation of a polynomial as a sum of monomials (for example, uniqueness of such representation and related estimations).
In this work we introduce and analyze a new multiscale method for strongly nonlinear monotone equations in the spirit of the Localized Orthogonal Decomposition. A problem-adapted multiscale space is constructed by solving linear local…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…
In the paper we analyse the exact solutions to scalar PDEs obtained thanks to summable Taylor series provided by Adomian's decomposition method. We propose the modification of the method which makes the calculations of Taylor coefficients…
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
Hilbert's 17th problem asks that whether every nonnegative polynomial can be a sum of squares of rational functions. It has been answered affirmatively by Artin. However, the question as to whether a given nonnegative polynomial is a sum of…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
In this note we mainly study the fine Jordan-Chevalley decomposition: a refinement of the classical Jordan-Chevalley decomposition of a matrix and we pay a particular attention to the field of the coefficients of the matrix. Moreover we…
We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of…
In this paper, we propose a high-order extension of the multiscale method introduced by the authors in [SIAM J. Numer. Anal., 63(4) (2025), pp. 1617--1641] for heterogeneous Stokes problems, while also providing several other improvements,…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.