Related papers: Summing a polynomial function over integral points…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
In this paper, we consider a general form of the analogue of Ramanujan's sum in the ring of polynomials over a finite field. We first prove some multiplicative properties of such functions before considering their finite Fourier series and…
Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [Kal04]. Here we consider the polynomiography of the partial sums of the exponential series. While…
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…
An extensive table of pairs of functions linked by the Legendre transformation is presented. Many special functions and formulas that are used in the sciences are included in the pairs. Formulations are provided for finding the Legendre…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We study arithmetic inequalities for multiplicative, sub(super)-multiplicative, sub(super)-homogeneous functions. Applications for the classical arithmetic functions are pointed out.
In this paper, we develop the theory of absolutely summing multipolynomials. Among other results, we generalize and unify previous works of G. Botelho and D. Pellegrino concerning absolutely summing polynomials/multilinear mappings in…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
The Integral Image algorithm is often applied in tasks that require efficient integration over images, such as object detection. In this paper we discuss theoretical aspects of the algorithm's continuous version. We suggest to define the…
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.
A characterization of multiplicative (and additive) arithmetical functions is given. Using this characterization, we show that the group of multiplicative arithmetical functions is isomorphic to the group of additive arithmetical functions.
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…