Related papers: Chinese Remainder Theorem for Cyclotomic Polynomia…

In [1], we give Dickson's conjecture on $N^n$. In this paper, we further give Dickson's conjecture on $Z^n$ and obtain an equivalent form of Green-Tao's conjecture [2]. Based on our work, it is possible to establish a general theory that…

This paper explores the ability of the Chinese Remainder Theorem formalism to model Montgomery-type algorithms. A derivation of CRT based on Qin's Identity gives Montgomery reduction algorithm immediately. This establishes a unified…

Schm\"udgen's Theorem says that if a basic closed semialgebraic set K = {g_1 \geq 0, ..., g_s \geq 0} in R^n is compact, then any polynomial f which is strictly positive on K is in the preordering generated by the g_i's. Putinar's Theorem…

Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

A cyclotomic polynomial Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd prime factors. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Eli…

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…

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Generalized Chinese Remainder Theorem (CRT) is a well-known approach to solve ambiguity resolution related problems. In this paper, we study the robust CRT reconstruction for multiple numbers from a view of statistics. To the best of our…

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

Verifying a suspicion of Propp and Reiner concerning the cyclic sieving phenomenon (CSP), M. Thiel introduced a Catalan object called noncrossing $(1,2)$-configurations (denoted by $X_n$), which is a class of set partitions of $[n-1]$. More…

Given a nonempty set $A \subset \mathbb{N}\cup\{0\}$, define the mask polynomial $A(X)=\sum_{a\in A} X^a$. Suppose that there are $s_1,\dots,s_k\in\nn\setminus\{1\}$ such that the cyclotomic polynomials $\Phi_{s_1},\dots,\Phi_{s_k}$ divide…

We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…

Inspired by Weil's classical result on the zeta function of projective Fermat curve defined over a finite field, in this paper, we investigate some arithmetic properties of the cyclotomic matrix…

We study the number of real critical points of a cyclotomic polynomial $\Phi_{n}(x)$, that is, the real roots of $\Phi_{n}^{\prime}(x)$. As usual, one can, without losing generality, restrict $n$ to be the product of distinct odd primes,…

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

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…

We characterize the fixed divisor of a polynomial $f(X)$ in $\mathbb{Z}[X]$ by looking at the contraction of the powers of the maximal ideals of the overring ${\rm Int}(\mathbb{Z})$ containing $f(X)$. Given a prime $p$ and a positive…