Related papers: Unimodality via alternating gamma vectors
Recently, Guo and Zeng discovered two families of polynomials featuring in a q-analogue of Faulhaber's formula for the sums of powers and a q-analogue of Gessel-Viennot's formula involving Salie's coefficients for the alternating sums of…
Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…
In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…
A recent nice result due to I. Pak and G. Panova is the strict unimodality of the $q$-binomial coefficients $\binom{a+b}{b}_q$ (see \cite{PP} and also \cite{PP2} for a slightly revised version of their theorem). Since their proof used…
An unresolved conjecture by Graham Higman states that for all $n\geq 1$ the number of conjugacy classes of the group of $n \times n$ unitriangular matrices with entries in the finite field $\mathbb{F}_q$ is a polynomial in $q$. In this…
In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…
We start from a parametrized system of $d$ generalized polynomial equations (with real exponents) for $d$ positive variables, involving $n$ generalized monomials with $n$ positive parameters. Existence and uniqueness of a solution for all…
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…
A combinatorial proof of the Gaussian product inequality (GPI) is given under the assumption that each component of a centered Gaussian random vector $\boldsymbol{X} = (X_1, \ldots, X_d)$ of arbitrary length can be written as a linear…
The Heilmann-Lieb Theorem on (univariate) matching polynomials states that the polynomial $\sum_k m_k(G) y^k$ has only real nonpositive zeros, in which $m_k(G)$ is the number of $k$-edge matchings of a graph $G$. There is a stronger…
We prove that a certain family of sums of products of three binomials has alternating behavior modulo a prime $p$. To accomplish this we rewrite these sums as signed sums of products of three binomials, the better to handle $p$, and we give…
We consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…
A noncommutative (nc) polynomial is called (globally) trace-positive if its evaluation at any tuple of operators in a tracial von Neumann algebra has nonnegative trace. Such polynomials emerge as trace inequalities in several matrix or…
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…
In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…
In this paper, we examine the unimodality and strict unimodality of certain formal bivariate Laurent series with non-negative coefficients. We show that the sets of these formal bivariate Laurent series form commutative semirings under the…
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…