English
Related papers

Related papers: Generalizations of self-reciprocal polynomials

200 papers

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

Representation Theory · Mathematics 2007-08-10 Sergey Mozgovoy , Markus Reineke

[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…

History and Overview · Mathematics 2007-05-23 Ferdinand Minding

In 1954 it was proved if f is infinitely differentiable in the interval I and some derivative (of order depending on x) vanishes at each x, then f is a polynomial. Later it was generalized for multi-variable case. In this paper we give an…

Analysis of PDEs · Mathematics 2014-07-23 V. E. S. Szabo

We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…

Representation Theory · Mathematics 2011-11-10 Nimish A. Shah

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Number Theory · Mathematics 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

Number Theory · Mathematics 2018-03-13 Joel Specter

In this paper we prove that assuming Schanuel's conjecture, an exponential polynomial in one variable over the algebraic numbers has only finitely many algebraic solutions. This implies a positive answer to Shapiro's conjecture for…

Logic · Mathematics 2009-10-19 Ahuva C. Shkop

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is…

Number Theory · Mathematics 2017-07-12 Randell Heyman , Igor E. Shparlinski

We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).

Number Theory · Mathematics 2014-02-26 Yann Bugeaud , Andrej Dujella

Let R denote the reals, and let h: R^n --> R be a continuous, piecewise-polynomial function. The Pierce-Birkhoff conjecture (1956) is that any such h is representable in the form sup_i inf_j f_{ij}, for some finite collection of polynomials…

Algebraic Geometry · Mathematics 2010-02-02 Charles N. Delzell

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

Classical Analysis and ODEs · Mathematics 2014-06-17 D. Babusci , G. Dattoli , K. Górska , K. A. Penson

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Number Theory · Mathematics 2011-12-30 Vladimir Shevelev , Peter J. C. Moses

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

Number Theory · Mathematics 2016-12-19 Qiang Wang

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

Number Theory · Mathematics 2019-08-23 Jitender Singh , Sanjeev Kumar

Let $f(x)$ be a square free quartic polynomial defined over a quadratic field $K$ such that its leading coefficient is a square. If the continued fraction expansion of $\displaystyle \sqrt{f(x)}$ is periodic, then its period $n$ lies in the…

Number Theory · Mathematics 2016-07-01 Mohammad Sadek

In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

Number Theory · Mathematics 2025-01-20 Stefan Ehbauer , Aleksandr Grishkov , Dmitry Logachev

In 1971, Ruzsa conjectured that if $f:\ \mathbb{N}\rightarrow\mathbb{Z}$ with $f(n+k)\equiv f(n)$ mod $k$ for every $n,k\in\mathbb{N}$ and $f(n)=O(\theta^n)$ with $\theta<e$ then $f$ is a polynomial. In this paper, we investigate the…

Number Theory · Mathematics 2019-10-21 Jason P. Bell , Khoa D. Nguyen