English
Related papers

Related papers: An asymptotic approach to Borwein-type sign patter…

200 papers

This note describes a conjecture involving cyclotomic polynomials and some initial thoughts towards a solution. Given positive integers $m,n$, the conjecture is that either $\Phi_m(q)\leqslant\Phi_n(q)$ or $\Phi_m(q)\geqslant\Phi_n(q)$…

Number Theory · Mathematics 2019-03-08 S. P. Glasby

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

General Mathematics · Mathematics 2016-10-07 Dhananjay P. Mehendale

Consider the polynomial $tr (A + tB)^m$ in $t$ for positive hermitian matrices $A$ and $B$ with $m \in \N$. The Bessis-Moussa-Villani conjecture (in the equivalent form of Lieb and Seiringer) states that this polynomial has nonnegative…

Mathematical Physics · Physics 2008-11-04 Christian Fleischhack , Shmuel Friedland

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

Number Theory · Mathematics 2015-02-26 Quan-Hui Yang

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$…

Combinatorics · Mathematics 2014-12-04 Jiyou Li

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…

Number Theory · Mathematics 2020-08-28 Andreas Decker , Pieter Moree

F. Bergeron recently asked the intriguing question whether $\binom{b+c}{b}_q -\binom{a+d}{d}_q$ has nonnegative coefficients as a polynomial in $q$, whenever $a,b,c,d$ are positive integers, $a$ is the smallest, and $ad=bc$. We conjecture…

Combinatorics · Mathematics 2018-04-30 Fabrizio Zanello

Consider the polynomial $tr (A + tB)^m$ in $t$ for positive hermitian matrices $A$ and $B$ with $m \in \N$. The Bessis-Moussa-Villani conjecture (in the equivalent form of Lieb and Seiringer) states that this polynomial has nonnegative…

Mathematical Physics · Physics 2008-04-24 Christian Fleischhack

We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…

High Energy Physics - Theory · Physics 2015-06-26 P. Di Francesco , C. Itzykson , J. -B. Zuber

A Newman polynomial has all the coefficients in $\{ 0,1\}$ and constant term 1, whereas a Littlewood polynomial has all coefficients in $\{-1,1\}$. We call $P(X)\in\mathbb{Z}[X]$ a Borwein polynomial if all its coefficients belong to $\{…

Number Theory · Mathematics 2016-09-26 Paulius Drungilas , Jonas Jankauskas , Jonas Šiurys

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

It is shown that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has positive coefficients when $m = 6$ and $A$ and $B$ are any two 3-by-3 complex Hermitian positive definite matrices. This case is the first that is not covered by prior,…

Mathematical Physics · Physics 2007-07-06 Christopher J. Hillar , Charles R. Johnson

In 1995 Magnus posed a conjecture about the asymptotics of the recurrence coefficients of orthogonal polynomials with respect to the weights on [-1,1] of the form $$ (1-x)^\alpha (1+x)^\beta |x_0 - x|^\gamma \times a jump at x_0, $$ with…

Classical Analysis and ODEs · Mathematics 2009-05-19 A. Foulquie Moreno , A. Martinez-Finkelshtein , V. L. Sousa

Robbins conjectured, and Zeilberger recently proved, that there are 1!4!7!...(3n-2)!/n!/(n+1)!/.../(2n-1)! alternating sign matrices of order n. We give a new proof of this result using an analysis of the six-vertex state model (also called…

Combinatorics · Mathematics 2007-05-23 Greg Kuperberg

In this paper, we investigate the signs changes of Fourier coefficients of infinite products of $q$-series of Rogers--Ramanujan type. In particular, we prove a conjecture made by Schlosser--Zhou pertaining to such sign changes for products…

Combinatorics · Mathematics 2024-07-15 Kathrin Bringmann , Bernhard Heim , Ben Kane

In this paper we establish some new results similar to Lagrange's four-square theorem. For example, we prove that any integer $n>1$ can be written as $w(5w+1)/2+x(5x+1)/2+y(5y+1)/2+z(5z+1)/2$ with $w,x,y,z\in\mathbb Z$. Let $a$ and $b$ be…

Number Theory · Mathematics 2024-12-06 Zhi-Wei Sun

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Number Theory · Mathematics 2026-04-28 Terence Tao , Joni Teräväinen

Recently, we showed that global root numbers of modular forms are biased toward +1. Together with Pharis, we also showed an initial bias of Fourier coefficients towards the sign of the root number. First, we prove analogous results with…

Number Theory · Mathematics 2025-10-31 Kimball Martin

We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the $W$-polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for…

Combinatorics · Mathematics 2012-04-18 Petter Branden

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

Symbolic Computation · Computer Science 2024-12-12 Alaa Ibrahim , Bruno Salvy