Related papers: Higher order log-monotonicity of combinatorial seq…
Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization…
We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…
A Cullen number is a number of the form $m2^m+1$, where $m$ is a positive integer. In 2004, Luca and St\u anic\u a proved, among other things, that the largest Fibonacci number in the Cullen sequence is $F_4=3$. Actually, they searched for…
Loop percolation, also known as the dense O(1) loop model, is a variant of critical bond percolation in the square lattice Z^2 whose graph structure consists of a disjoint union of cycles. We study its connectivity pattern, which is a…
We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…
We prove that the partition function $p(n)$ is log-concave for all $n>25$. We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the…
Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…
We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…
We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…
In this article, we study the growth of solutions of the homogeneous complex linear differential equation \begin{equation*} f^{(k)}+A_{k-1}(z)f^{(k-1)}+\cdots+A_{1}(z)f^{\prime}+ A_{0}(z)f=0, \end{equation*}% where the coefficients…
In this manuscript, new algebraic and analytic aspects of the orthogonal polynomials satisfying $R_{II}$ type recurrence relation given by \begin{align*} \mathcal{P}_{n+1}(x) = (x-c_n)\mathcal{P}_n(x)-\lambda_n…
In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences,…
We show that the likelihood function for a multinomial vector observed under arbitrary interval censoring constraints on the frequencies or their partial sums is completely log-concave by proving that the constrained sample spaces comprise…
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…
Convex or concave sequences of $n$ positive terms, viewed as vectors in $n$-space, constitute convex cones with $2n-2$ and $n$ extreme rays, respectively. Explicit description is given of vectors spanning these extreme rays, as well as of…
In a recent proof of the log-concavity of genus polynomials of some families of graphs, Gross et al. defined the weakly synchronicity relation between log-concave sequences, and conjectured that the convolution operation by any log-concave…
A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$, we prove…
Rescaled Mellin-type transforms of the exponential functional of the Bourgade-Kuan-Rodgers statistic of Riemann zeroes are conjecturally related to the distribution of the total mass of the limit lognormal stochastic measure of…
We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions. The results obtained partially extend work on linear and at most…