English
Related papers

Related papers: On multiple and infinite log-concavity

200 papers

A sequence $\{z_n\}_{n\geq0}$ is called ratio log-convex in the sense that the ratio sequence $\{\frac{z_{n+1}}{z_n}\}_{n\geq0}$ is log-convex. Based on a three-term recurrence for sequences, we develop techniques for dealing with the ratio…

Combinatorics · Mathematics 2013-10-01 Bao-Xuan Zhu

We study the effect on the zeros of generating functions of sequences under certain non-linear transformations. Characterizations of P\'olya--Schur type are given of the transformations that preserve the property of having only real and…

Combinatorics · Mathematics 2012-04-18 Petter Brändén

Deciding the positivity of a sequence defined by a linear recurrence and initial conditions is, in general, a hard problem. When the coefficients of the recurrences are constants, decidability has only been proven up to order 5. The…

Symbolic Computation · Computer Science 2025-03-19 Alaa Ibrahim

Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…

Logic in Computer Science · Computer Science 2026-05-15 Mishel Carelli

Denote by $A(p, n, k)$ the number of commuting $p$-tuples of permutations on $[n]$ that have exactly $k$ distinct orbits. It was conjectured in~\cite{abdesselam2023log} that $A(p, n, k)$ is log-concave with respect to $k$ for every $p\geq…

Combinatorics · Mathematics 2024-09-02 Raghavendra Tripathi

We prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave sequence in k.

Combinatorics · Mathematics 2015-02-20 Miklós Bóna , Marie-Louise Bruner

In this paper, we prove that the number of unimodal sequences of size $n$ is log-concave. These are coefficients of a mixed false modular form and have a Rademacher-type exact formula due to recent work of the second author and Nazaroglu on…

Number Theory · Mathematics 2023-07-12 Walter Bridges , Kathrin Bringmann

Briggs conjectured that if a polynomial $a_0+a_1x+\cdots+a_nx^n$ with real coefficients has only negative zeros, then $$a^2_k(a^2_k - a_{k-1}a_{k+1}) > a^2_{k-1}(a^2_{k+1} - a_ka_{k+2})$$ for any $1\leq k\leq n-1$. The Boros-Moll sequence…

Combinatorics · Mathematics 2024-02-20 Zhong-Xue Zhang , James Jing Yu Zhao

We study a class of left-invertible operators which we call weakly concave operators. It includes the class of concave operators and some subclasses of expansive strict $m$-isometries with $m > 2$. We prove a Wold-type decomposition for…

Functional Analysis · Mathematics 2021-08-24 Sameer Chavan , Jan Stochel

We study the multivariate independence polynomials of graphs and the log-concavity of the coefficients of their univariate restrictions. Let $R_{W_4}$ be the operator defined on simple and undirected graphs which replaces each edge with a…

Combinatorics · Mathematics 2025-04-17 Amire Bendjeddou , Leonard Hardiman

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

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny

Let $m$ and $k \geq 2$ be positive integers. We show that polynomial $P = (1+x)^m(1+x^k)$ is strongly unimodal (frequently known as {\it log concave\/}) if and only if $m \geq k^2 -3$; this is also the criterion for $P$ to be merely…

Combinatorics · Mathematics 2018-04-05 David Handelman

A real sequence $(a_k)_{k=0}^\infty$ is called {\it totally positive} if all minors of the infinite Toeplitz matrix $ \left\| a_{j-i} \right\|_{i, j =0}^\infty$ are nonnegative (here $a_k=0$ for $k<0$). In this paper, which continues our…

Complex Variables · Mathematics 2025-12-09 Olga Katkova , Anna Vishnyakova

We review and formulate results concerning log-concavity and strong-log-concavity in both discrete and continuous settings. We show how preservation of log-concavity and strongly log-concavity on $\mathbb{R}$ under convolution follows from…

Statistics Theory · Mathematics 2014-04-24 Adrien Saumard , Jon A. Wellner

Given a graph $G$, its independence sequence is the integral sequence $a_1,a_2,...,a_n$, where $a_i$ is the number of independent sets of vertices of size i. In the late 80's Alavi, Erdos, Malde, Schwenk showed that this sequence need not…

Combinatorics · Mathematics 2025-10-28 Eric Ramos , Sunny Sun

We show that the number $A(n,m)$ of partitions with $m$ even parts and largest hook length $n$ is strongly unimodal with mode [(n-1)/4] for $n\ge 6$. We establish this result by induction, using a $5$-term recurrence due to Lin, Xiong and…

Combinatorics · Mathematics 2023-08-23 Max Y. C. Liu , David G. L. Wang

Bi-log-concavity of probability measures is a univariate extension of the notion of log-concavity that has been recently proposed in a statistical literature. Among other things, it has the nice property from a modelisation perspective to…

Probability · Mathematics 2019-03-20 Adrien Saumard

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler

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…

Combinatorics · Mathematics 2015-08-03 H. Hu , David G. L. Wang , F. Zhao , T. Y. Zhao