English
Related papers

Related papers: Behaviour of Newton Polygon over polynomial compos…

200 papers

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

Number Theory · Mathematics 2015-03-19 Dijana Kreso , Robert F. Tichy

We study orthogonal polynomials for a weight function defined over a domain of revolution, where the domain is formed from rotating a two-dimensional region and goes beyond the quadratic domains. Explicit constructions of orthogonal bases…

Classical Analysis and ODEs · Mathematics 2023-11-28 Yuan Xu

We study the $p$-adic absolute value of the roots of the $L$-functions associated to certain twisted character sums, and additive character sums associated to polynomials $P(x^d)$, when $P$ varies among the space of polynomial of fixed…

Number Theory · Mathematics 2007-06-18 Regis Blache , Eric Ferard

Let $\mathbb{F}$ be a finite field and let $f$ be a linear polynomial in $\mathbb{F}[x]$. We investigate the number of polynomials of degree $d$ which commute with $f$ under composition. In so doing, we rediscover a result of Park, but with…

Number Theory · Mathematics 2023-06-16 Jeffrey Hatley , Mayah Teplitskiy

For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $\chi$ when $p$ is larger than an explicit…

Number Theory · Mathematics 2015-11-03 Yi Ouyang , Shenxing Zhang

For a system of polynomial equations, whose coefficients depend on parameters, the Newton polyhedron of its discriminant is computed in terms of the Newton polyhedra of the coefficients. This leads to an explicit formula (involving mixed…

Algebraic Geometry · Mathematics 2010-08-03 Alexander Esterov

We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…

Metric Geometry · Mathematics 2024-04-16 Kyle Fridberg

Orthogonal polynomials with respect to a weight function defined on a wedge in the plane are studied. A basis of orthogonal polynomials is explicitly constructed for two large class of weight functions and the convergence of Fourier…

Classical Analysis and ODEs · Mathematics 2018-07-06 Sheehan Olver , Yuan Xu

Particular solutions of the Poisson equation can be constructed via Newtonian potentials, integrals involving the corresponding Green's function which in two-dimensions has a logarithmic singularity. The singularity represents a significant…

Numerical Analysis · Mathematics 2025-06-04 Sheehan Olver

Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…

Combinatorics · Mathematics 2018-06-05 Jang Soo Kim , U-Keun Song

The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…

Algebraic Geometry · Mathematics 2010-02-24 Carlos D'Andrea , Martin Sombra

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

Number Theory · Mathematics 2012-06-22 Domingo Gomez-Perez , Alejandro P. Nicolas , Alina Ostafe , Daniel Sadornil

We study the geometric structure of Poncelet $n$-gons from a projective point of view. In particular we present explicit constructions of Poncelet $n$-gons for certain $n$ and derive algebraic characterisations in terms of bracket…

Combinatorics · Mathematics 2024-08-20 Leah Wrenn Berman , Gábor Gévay , Jürgen Richter-Gebert , Serge Tabachnikov

Interactions are explored through the observation of the dynamics of particles. On the classical level the basic underlying assumption in that scheme is that Newton's second law holds. Relaxing the validity of this axiom by, e.g., allowing…

General Relativity and Quantum Cosmology · Physics 2009-05-01 Claus Lämmerzahl , Patricia Rademaker

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

Number Theory · Mathematics 2020-03-26 Shushi Harashita

We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…

Number Theory · Mathematics 2024-04-09 Francesco Veneziano , Solomon Vishkautsan

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

History and Overview · Mathematics 2026-03-03 James M Parks

Let $F(x,y)$ be a polynomial over the rationals. We show that if $F$ is not an expander (over the rationals) then it has a special multiplicative or additive form. For example if $F$ is a homogeneous non-expander polynomial then…

Combinatorics · Mathematics 2012-12-17 Jozsef Solymosi

In this paper, we study the dynamics of Newton maps for arbitrary polynomials. Let $p$ be an arbitrary polynomial with at least three distinct roots, and $f$ be its Newton map. It is shown that the boundary $\partial B$ of any immediate…

Dynamical Systems · Mathematics 2018-12-27 Xiaoguang Wang , Yongcheng Yin , Jinsong Zeng

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g and h. In this thesis we consider functional decom- positions…

Symbolic Computation · Computer Science 2010-05-03 Mark Giesbrecht