Related papers: Determining Sidon Polynomials on Sidon Sets over $…

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

We denote $\mathcal{P}$ = $\{P(x)|$ $P(n) \mid n!$ for infinitely many $n\}$. This article identifies some polynomials that belong to $\mathcal{P}$. Additionally, we also denote $P^+(m)$ as the largest prime factor of $m$. Then, a…

We study some properties of the exponents of the terms appearing in the splitting perfect polynomials over $\mathbb{F}_{p^2}$, where $p$ is a prime number. This generalizes the work of Beard et al. over $\mathbb{F}_p$. Corrected paper.…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

Let $f(x)$ be a monic polynomial over $\mathbb{Q}$ with complex roots $\alpha_1,\dots,\alpha_n$. Linear relations among them and $1$ over $\mathbb{Q}$ play an important role when we study the distribution of roots modulo a prime. We study…

Let $(p_n)_n$ be either the $q$-Meixner or the $q$-Laguerre polynomials. We form a new sequence of polynomials $(q_n)_n$ by considering a linear combination of two consecutive $p_n$: $q_n=p_n+\beta_np_{n-1}$, $\beta_n\in \RR$. Using the…

A linearized polynomial over $\mathbb F_{q^n}$ is called scattered when for any $t,x\in\mathbb F_{q^n}$, the condition $xf(t)-tf(x)=0$ holds if and only if $x$ and $t$ are $\mathbb F_q$-linearly dependent. General conditions for linearized…

The notion of strong Frobenius structure is classically studied in the theory of $p$-adic differential operators. In the present work, we introduce a new definition of the notion of strong Frobenius structure for $q$-difference operators.…

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Given a number field $K$ and a polynomial $f(z) \in K[z]$ of degree at least 2, one can construct a finite directed graph $G(f,K)$ whose vertices are the $K$-rational preperiodic points for $f$, with an edge $\alpha \to \beta$ if and only…

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 describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $\mathbb{Q}$, up to conjugacy over $\text{PGL}_2(\bar{\mathbb{Q}})$. We describe normal forms that classify equivalence classes…

We consider the equation $P(Q(x_1,\ldots,x_\nu))=Q(P(x_1),\ldots,P(x_\nu))$ in polynomials over the field of complex numbers and prove that if ${\rm deg}(P)>1$, then it is only solvable in polynomials that are affinely conjugate to…

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

C.M. Bender and G. V. Dunne showed that linear combinations of words $q^{k}p^{n}q^{n-k}$, where $p$ and $q$ are subject to the relation $qp - pq = \imath$, may be expressed as a polynomial in the symbol $z = \tfrac{1}{2}(qp+pq)$. Relations…

We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3,…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…