Related papers: Value distribution of cyclotomic polynomial coeffi…

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

If $R=k[x_1,\ldots,x_n]/I$ is a graded artinian algebra, then the length of $k[x_1,\ldots,x_n]/I^s$ becomes a polynomial in $s$ of degree $n$ for large $s$. If we write this polynomial as $\sum_{i=0}^n(-1)^ie_i{s+n-i-1\choose n-i}$, then…

We estimate the average of any arithmetic function $k$ over the values of any smooth polynomial in many variables provided only that $k$ has a distribution in arithmetic progressions of fixed modulus. We give several applications of this…

There is a natural pluripotential-theoretic extremal function V_{K,Q} associated to a closed subset K of C^m and a real-valued, continuous function Q on K. We define random polynomials H_n whose coefficients with respect to a related…

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

Given a pair of distinct non-CM normalized eigenforms having integer Fourier coefficients $a_1 (n)$ and $a_2(n)$, we count positive integers $n$ with $(a_1(n), a_2(n))=1$ and make a conjecture about the density of the set of primes $p$ for…

Given f in Z[x_1,...,x_n], we compute the density of x in Z^n such that f(x) is squarefree, assuming the abc conjecture. Given f,g in Z[x_1,...,x_n], we compute unconditionally the density of x in Z^n such that gcd(f(x),g(x))=1. Function…

Consider the average of the first n k-th powers. We pose and answer the following natural question: For which values of n and k is this average an integer? If k is odd the answer is easy; it is an integer as long as n is incongruent to 2…

For $n\ge 3$ let $f(n)$ be the least positive integer $k$ such that $\binom nk>\frac{2^n}{n+1}$. In this paper we investigate the properties of $f(n)$.

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

We study the recurrence coefficients of the orthogonal polynomials with respect to a semi-classical extension of the Krawtchouk weight. We derive a coupled discrete system for these coefficients and show that they satisfy the fifth…

An integer $n$ is said to be \textit{arithmetic} if the arithmetic mean of its divisors is an integer. In this paper, using properties of the factorization of values of cyclotomic polynomials, we characterize arithmetic numbers. As an…

Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…

For a given set of integers $\mathcal{S}$, let $\mathcal{R}_n^*(\mathcal{S})$ denote the set of reducible polynomials $f(X)=a_nX^n+a_{n-1}X^{n-1}+\cdots+a_1X+a_0$ over $\mathbb{Z}[X]$ with $a_i\in\mathcal{S}$ and $a_0a_n\ne 0$. In this…

Given a prime $p$, let $P(t)$ be a non-constant monic polynomial in $t$ over the ring $\mathbb{Z}_{p}$ of $p$-adic integers. Let $X_{n}$ be an $n \times n$ random matrix over $\mathbb{Z}_{p}$ with independent entries that lie in any residue…