Related papers: Grace-like polynomials

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…

Let $N>1$ and let $\Phi_N(X,Y)\in\mathbb{Z}[X,Y]$ be the modular polynomial which vanishes precisely at pairs of $j$-invariants of elliptic curves linked by a cyclic isogeny of degree $N$. In this note we study the divisibility of the…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

Let P be an elementary closed semi-algebraic set in R^d, i.e., there exist real polynomials p_1,...,p_s such that P= \{x \in R^d : p_1(x) \ge 0, >..., p_s(x) \ge 0 \}; in this case p_1,...,p_s are said to represent P. Denote by $n$ the…

By defining the dimension of natural numbers as the number of prime factors, all natural numbers smaller than 2^(n+1) (n is a natural number) can be classified by their dimensions, and the count of numbers of each dimension gives a…

In 2012, for any integer $n \ge 2$, Kedlaya constructed an infinite class of monic irreducible polynomials of degree $n$ with integer coefficients having squarefree discriminants. Such polynomials are necessarily monogenic. Further, by…

One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…

The aim of this paper is to present the construction of exceptional Laguerre polynomials in a systematic way, and to provide new asymptotic results on the location of the zeros. To describe the exceptional Laguerre polynomials we associate…

We classify all self-reciprocal polynomials arising from reversed Dickson polynomials over $\mathbb{Z}$ and $\mathbb{F}_p$, where $p$ is prime. As a consequence, we also obtain coterm polynomials arising from reversed Dickson polynomials.

We establish that any finite extension of function fields of genus greater than 1 whose relative class group is trivial is Galois and cyclic. This depends on a result from a preceding paper which establishes a finite list of possible Weil…

We introduce the concept of piecewise interlacing zeros for studying the relation of root distribution of two polynomials. The concept is pregnant with an idea of confirming the real-rootedness of polynomials in a sequence. Roughly…

Consider a random polynomial $G_n(z)=\xi_nz^n+...+\xi_1z+\xi_0$ with i.i.d. complex-valued coefficients. Suppose that the distribution of $\log(1+\log(1+|\xi_0|))$ has a slowly varying tail. Then the distribution of the complex roots of…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

In further pursuit of a solution to the celebrated nonnegative inverse eigenvalue problem, Loewy and London [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90] posed the problem of characterizing all polynomials that preserve all…

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…