Related papers: Neighboring ternary cyclotomic coefficients differ…

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Let $n$ be an even positive integer with at most three distinct prime factors and let $\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \in \Q[x]$ having at least…

Let $a(r,n)$ be $r$th coefficient of $n$th cyclotomic polynomial. Suzuki proved that $\{a(r,n)|r\geq 1,n\geq 1\}=\mathbb{Z}$. If $m$ and $n$ are two natural numbers we prove an analogue of Suzuki's theorem for divisors of $x^n-1$ with…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

Let $m$ and $n$ be positive integers, and let $p$ be a prime. Let $T(x)=\Phi_{p^m}\left(\Phi_{2^n}(x)\right)$, where $\Phi_k(x)$ is the cyclotomic polynomial of index $k$. In this article, we prove that $T(x)$ is irreducible over $\mathbb…

In their work, Serre and Swinnerton-Dyer study the congruence properties of the Fourier coefficients of modular forms. We examine similar congruence properties, but for the coefficients of a modified Taylor expansion about a CM point…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime $p$, reduce its coefficients mod $p$ and consider its action on the field $\mathbb{F}_p$. The questions of whether and…

The homogeneous form $\Phi_n(X,Y)$ of degree $\varphi(n)$ which is associated with the cyclotomic polynomial $\phi_n(X)$ is dubbed a {\it cyclotomic binary form}. A positive integer $m\ge 1$ is said to be {\it representable by a cyclotomic…

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 investigate the structure of polynomials of degree four in many variables over a fixed prime field $\mathbb{F}=\mathbb{F}_{p}$. In 2007, Green and Tao proved that if a polynomial $f:\mathbb{F}^{n}\rightarrow\mathbb{F}$ is poorly…

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

In this paper, we introduce polynomials (in $t$) of signed relative derangements that track the number of signed elements. The polynomials are clearly seen to be in a sense symmetric. Note that relative derangements are those without any…