Related papers: A simple proof of Andrews's 5F4 evaluation

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…

Given $f\in \mathbb{Z}[t]$ of positive degree, we investigate the existence of auxiliary polynomials $g\in \mathbb{Z}[t]$ for which $f(g(t))$ factors as a product of polynomials of small relative degree. One consequence of this work shows…

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of ``elementary transformations" which are Nielsen transformations augmented by arbitrary…

We provide an alternative exposition of a result due to Schinzel. Fix an integer $k \ge 2$. For almost all choices of positive integers $n_{1} < \cdots < n_{k}$, we show that the polynomial $F(x) = 1 + x^{n_{1}} + \cdots + x^{n_{k}}$,…

Let F be characteristic zero field, G a residually finite group and W a G-prime and PI F-algebra. By constructing G-graded central polynomials for W, we prove the G-graded version of Posner's theorem. More precisely, if S denotes all…

We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

In this paper, we give results that partially prove a conjecture which was discussed in our previous work (arXiv:1307.4991). More precisely, we prove that as $n\to \infty,$ the zeros of the polynomial$${}_{2}\text{F}_{1}\left[…

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…

For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…

In light of the well-known fact that the $n$th divided difference of any polynomial of degree $m$ must be zero while $m<n$,the present paper proves the $(\alpha,\beta)$-inversion formula conjectured by Hsu and Ma [J. Math. Res. $\&$…

This paper studies polynomials with core entropy zero. We give several characterizations of polynomials with core entropy zero. In particular, we show that a degree d post-critically finite polynomial f has core entropy zero if and only if…

Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

We consider the irreducibility of polynomial $L_n^{(\alpha)} (x) $ where $\alpha$ is a negative integer. We observe that the constant term of $L_n^{(\alpha)} (x) $ vanishes if and only if $n \geq |\alpha| = -\alpha$. Therefore we assume…

We find and prove a class of congruences modulo 4 for Andrews' partition with certain ternary quadratic form. We also discuss distribution of $\overline{\mathcal{EO}}(n)$ and further prove that $\overline{\mathcal{EO}}(n)\equiv0\pmod4$ for…

Let $k$ be a field of characteristic two. We prove that a non constant monic polynomial $f\in k[X]$ of degree $n$ is the minimal/characteristic polynomial of a symmetric matrix with entries in $k$ if and only if it is not the product of…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…