Related papers: Polynomials whose reducibility is related to the G…

A practical criterion for the irreducibility (with respect to integration by part identities) of a particular Feynman integral to a given set of integrals is presented. The irreducibility is shown to be related to the existence of stable…

About four centuries ago, Johann Faulhaber developed formulas for the power sum $1^n + 2^n + \cdots + m^n$ in terms of $m(m+1)/2$. The resulting polynomials are called the Faulhaber polynomials. We first give a short survey of Faulhaber's…

We study some divisibility properties related to the factors of the discriminant of the characteristic polynomial of generalized Fibonacci sequences $(G_n)_{n\ge0}$ defined by $G_0=0$, $G_1=1$ and $G_n=pG_{n-1}+qG_{n-2}$ for $n\ge2$, where…

Let $ K $ be a number field, $ S $ a finite set of places of $ K $, and $ \mathcal{O}_S $ be the ring of $ S $-integers. Moreover, let $$ G_n^{(0)} Z^d + \cdots + G_n^{(d-1)} Z + G_n^{(d)} $$ be a polynomial in $ Z $ having simple linear…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…

We give examples of infinitely renormalizable quadratic polynomials $F_c: z\maps to z^2+c$ with stationary combinatorics whose Julia sets have Hausdorff dimension arbitrar y close to 1. The combinatorics of the renormalization involved is…

Given a natural number $n \geq 4$ we show that there exists infinitely many polynomials $f_{n}(x):= \prod_{i=1}^{n} (x^{2} - a_{i})$ such that (i) $f_{n}(x)$ has a root modulo every positive integer, (ii) $f_{n}(x)$ has no rational roots,…

We study the irreducibility and Galois group of random polynomials over function fields. We prove that a random polynomial $f=y^n+\sum_{i=0}^{n-1}a_i(x)y^i\in\mathbb F_q[x][y]$ with i.i.d coefficients $a_i$ taking values in the set…

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

A semidomain is a subsemiring of an integral domain. We call a semidomain $S$ additively reduced if $0$ is the only invertible element of the monoid $(S, +)$, while we say that $S$ is additively Furstenberg if every non-invertible element…

We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

It has been proved several times in the literature that a polynomial map from $C^2$ to $C$ with irreducible rational fibers cannot be a component of a counterexample to the Jacobian Conjecture. This note points out that this result is…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

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,…

We investigate a connection between generalized Fibonacci numbers and renewal theory for stochastic processes. Using Blackwell's renewal theorem we find an approximation to the generalized Fibonacci numbers. With the help of error estimates…