Related papers: Bounds on ternary cyclotomic coefficients

This paper shows that $t_m \leq \|\mathbf{A}\|_\infty \leq \sqrt{t_m}$ holds, when $\mathbf{A} \in \mathbb{R}^{m \times m}$ is a Runge-Kutta matrix which nodes originating from the Gaussian quadrature that integrates polynomials of degree…

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…

We study the autocorrelation coefficients of the Rudin-Shapiro polynomials, proving in particular that their maximum on the interval $[1, 2^n)$ is bounded from below by $C_1 2^{\alpha n}$ and is bounded from above by $C_2 2^{\alpha' n}$…

We show that many quadratic binomial functions on a finite field of characteristic 2 are not APN infinitely often. This is of interest in the light of recent discoveries of new families of quadratic binomial APN functions. The proof uses…

Let $f_1,\cdots,f_r\in k[x_1,\cdots,x_n]$ be homogeneous polynomial of degree $d$. Ananyan and Hochster (2016) proved that there exists a bound $N=N(r,d)$ where if collective strength of $f_1,\cdots,f_r\geq N$, then $f_1,\cdots,f_r$ are…

We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…

Let $\Phi_n(q)$ be the $n$-th cyclotomic polynomial in $q$. Recently, the author and Zudilin provide a creative microscoping method to prove some $q$-supercongruences mainly modulo $\Phi_n(q)^3$ by introducing an additional parameter $a$.…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

We provide a bound on the maximum degree of the Jones polynomial of any positive link with second Jones coefficient equal to $\pm 1$. This builds on the result of our previous work, in which we found such a bound for positive fibered links.

Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a…

We show that the Schur polynomials in all primitive $n$th roots of unity are $1$, $0$, or $-1$, if $n$ has at most two distinct odd prime factors. This result can be regarded as a generalization of properties of the coefficients of the…

Let $\Psi_n(x)$ be the monic polynomial having precisely all non-primitive $n$th roots of unity as its simple zeros. One has $\Psi_n(x)=(x^n-1)/\Phi_n(x)$, with $\Phi_n(x)$ the $n$th cyclotomic polynomial. The coefficients of $\Psi_n(x)$…

We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, we improve a bound due to I. Schur.

The aim of this work is to establish congruences $\left( \operatorname{mod}p^{2}\right) $ involving the trinomial coefficients $\binom{np-1}{p-1}_{2}$ and $\binom{np-1}{\left( p-1\right)/2}_{2}$ arising from the expansion of the powers of…

We prove that the number of combinatorially distinct causal 3-dimensional triangulations homeomorphic to the 3-dimensional sphere is bounded by an exponential function of the number of tetrahedra. It is also proven that the number of…

We provide a new bound on the maximum degree of the Jones polynomial of a positive link with second Jones coefficient equal to $\pm 1$ or $\pm 2$. This builds upon the result of our previous work, in which we found such a bound for positive…

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…