Related papers: A note about invariant polynomial transformations …

A quantization procedure, which has recently been introduced for the analysis of Painlev\'e equations, is applied to a general time-independent potential of a Newton equation. This analysis shows that the quantization procedure preserves…

We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…

We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…

This article provides a synthesis of recent advances in the study of the PI property in various classes of noncommutative algebras of polynomial type.

We determine the most general group of equivalence transformations for a family of differential equations defined by an arbitrary vector field on a manifold. We also find all invariants and differential invariants for this group up to the…

We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…

In the present paper, we deal with Fourier-transformation of Frobenius-Euler polynomials. We shall give its applications by using infinite series. Our applications possess interesting properties which we state in this paper.

In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…

This article is dedicated to the proof of the existence of classical solutions for a class of non-linear integral variational problems. Those problems are involved in nonlocal image and signal processing.

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

In classical invariant theory, the Gr\"obner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry,…

In this short note, we describe the so-called homogeneous involution on finite-dimensional graded-division algebra over an algebraically closed field. We also compute their graded polynomial identities with involution. As pointed out by L.…

A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…

A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…

An invariant of a model of genus one curve is a polynomial in the coefficients of the model that is stable under certain linear transformations. The classical example of an invariant is the discriminant, which characterizes the singularity…

We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…

We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…

We study the compositional inverses of some general classes of permutation polynomials over finite fields. We show that we can write these inverses in terms of the inverses of two other polynomials bijecting subspaces of the finite field,…

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 roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…