English
Related papers

Related papers: Asymptotic estimate for the polynomial coefficient…

200 papers

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best…

Number Theory · Mathematics 2011-11-24 Lola Thompson

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

Combinatorics · Mathematics 2008-11-25 Tewodros Amdeberhan , Richard P. Stanley

A ternary inclusion-exclusion polynomial is a polynomial of the form \[ Q_{{p,q,r}}=\frac{(z^{pqr}-1)(z^p-1)(z^q-1)(z^r-1)} {(z^{pq}-1)(z^{qr}-1)(z^{rp}-1)(z-1)}, \] where $p$, $q$, and $r$ are integers $\ge3$ and relatively prime in pairs.…

Number Theory · Mathematics 2010-06-04 Gennady Bachman , Pieter Moree

We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…

Probability · Mathematics 2020-10-12 Sean O'Rourke , Tulasi Ram Reddy

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

Number Theory · Mathematics 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

Combinatorics · Mathematics 2017-08-01 Victor J. W. Guo , Su-Dan Wang

Denote by $x$ a random infinite path in the graph of Pascal's triangle (left and right turns are selected independently with fixed probabilities) and by $d_n(x)$ the binomial coefficient at the $n$'th level along the path $x$. Then for a…

Dynamical Systems · Mathematics 2007-05-23 Terrence M. Adams , Karl E. Petersen

We used the MACH2 supercomputer to study coefficients in the $q$-series expansion of $(1-q)(1-q^2)\dots(1-q^n)$, for all $n\leq 75000$. As a result, we were able to conjecture some periodic properties associated with the before unknown…

Number Theory · Mathematics 2019-11-12 Alexander Berkovich , Ali K. Uncu

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

Combinatorics · Mathematics 2014-03-13 Igor Pak , Greta Panova

Given an integer $q\ge 2$ and a real number $c\in [0,1)$, consider the generalized Thue-Morse sequence $(t_n^{(q;c)})_{n\ge 0}$ defined by $t_n^{(q;c)} = e^{2\pi i c S_q(n)}$, where $S_q(n)$ is the sum of digits of the $q$-expansion of $n$.…

Dynamical Systems · Mathematics 2021-04-07 Aihua Fan , Joerg Schmeling , Weixiao Shen

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

Number Theory · Mathematics 2019-02-20 Javier Cilleruelo

As is well-known, a generalization of the classical concept of the factorial $n!$ for a real number $x\in {\mathbb R}$ is the value of Euler's gamma function $\Gamma(1+x)$. In this connection, the notion of a binomial coefficient naturally…

Combinatorics · Mathematics 2022-06-08 Tatiana I. Fedoryaeva

We study the asymptotic limiting function $W({G},q) = \lim_{n \to \infty}P(G,q)^{1/n}$, where $P(G,q)$ is the chromatic polynomial for a graph $G$ with $n$ vertices. We first discuss a subtlety in the definition of $W({G},q)$ resulting from…

Statistical Mechanics · Physics 2009-10-28 Robert Shrock , Shan-Ho Tsai

In this paper we compute the asymptotic behavior of the recurrence coefficients for polynomials orthogonal with respect to a logarithmic weight $w(x){\rm d}x = \log \frac{2k}{1-x}{\rm d}x$ on $(-1,1)$, $k > 1$, and verify a conjecture of…

Classical Analysis and ODEs · Mathematics 2018-06-13 Thomas Oliver Conway , Percy Deift

Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. The first two authors showed in part I that if m is a prime power and n and k range over the non-negative integers, then a(mn,k) assumes every integer value. Here this…

Number Theory · Mathematics 2012-07-30 Chun-Gang Ji , Wei-Ping Li , Pieter Moree

Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…

Number Theory · Mathematics 2011-10-24 Thomas Stoll

This is an informal and mostly expository note describing some asymptotic behavior and qualitative properties of the q-binomial coefficients. The results are mostly not new, but the overall story we present does not seem to be well known --…

Combinatorics · Mathematics 2025-05-14 Nate Harman

Let $a(n, k)$ be the $k$-th coefficient of the $n$-th cyclotomic polynomial. Recently, Ji, Li and Moree \cite{JLM09} proved that for any integer $m\ge1$, $\{a(mn, k)| n, k\in\mathbb{N}\}=\mathbb{Z}$. In this paper, we improve this result…

Number Theory · Mathematics 2009-09-08 Pingzhi Yuan

In this paper, Euler gives the general trionomial coefficient as a sum of the binomial coefficients, the general quadrinomial coefficient as a sum of the binomial and trinomial coefficients, the general quintonomial coefficient as a sum of…

History and Overview · Mathematics 2007-05-23 Leonhard Euler