Related papers: Behaviour of Newton Polygon over polynomial compos…

We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.

In this paper, we propose a new algebraic structure of permutation polynomials over $\mathbb{F}_{q^n}$. As an application of this new algebraic structure, we give some classes of new PPs over $\mathbb{F}_{q^n}$ and answer an open problem in…

Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u_1 o u_2 o ... o u_r. His main achievement was a procedure for obtaining any decomposition of f from any other by…

Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…

We develop a theory of multiplicities of roots for polynomials over hyperfields and use this to provide a unified and conceptual proof of both Descartes' rule of signs and Newton's "polygon rule".

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

We present two algorithms that compute the Newton polytope of a polynomial defining a hypersurface H in C^n using numerical computation. The first algorithm assumes that we may only compute values of f - this may occur if f is given as a…

In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…

Let $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ be a polynomial and $\mathcal{Z}(f)$ its zero set. In this paper, in terms of the so-called Newton polyhedron of $f,$ we present a necessary criterion and a sufficient condition for the…

In this article we study the behavior of Newton polygons along $\mathbb{Z}_p$-towers of curves. Fix an ordinary curve $X$ over a finite field $\mathbb{F}_q$ of characteristic $p$. By a $\mathbb{Z}_p$-tower $X_\infty/X$ we mean a tower of…

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

Let $n>1$ and let $R$ be a commutative ring with identity $1\ne 0$ and $R[x_1,\ldots,x_n]^n$ the set of all $n$-tuples of polynomials of the form $(f_1,\ldots,f_n),$ where $f_1,\ldots,f_n\in R[x_1,\ldots,x_n]$. We call these $n$-tuples…

We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.

We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…

We study multiplicative dependence between elements in orbits ofalgebraic dynamical systems over number fields modulo a finitely generated multiplicative subgroup of the field. We obtain a series of results, many of which may be viewed as a…

We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…

We show that for a monic polynomial $f(x)$ over a number field $K$ containing a global permutation polynomial of degree $>1$ as its composition factor, the Newton Polygon of $f\mod\mathfrak p$ does not converge for $\mathfrak p$ passing…

In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the…

We start by formulating geometrically the Newton's law for a classical free particle in terms of Riemannian geometry, as pattern for subsequent developments. In fact, we use this scheme for further generalisation devoted to a constrained…

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…