Related papers: The log concavity of two graphical sequences
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…
We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…
The Links--Gould invariant $\mathrm{LG}(L ; t_0, t_1)$ of a link $L$ is a two-variable quantum generalization of the Alexander--Conway polynomial $\Delta_L(t)$ and has been shown to share some of its most geometric features in several…
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…
Anari, Gharan, and Vinzant proved (complete) log-concavity of the basis generating functions for all matroids. From the viewpoint of combinatorial Hodge theory, it is natural to ask whether these functions are "strictly" log-concave for…
A classical result of Kahn and Saks states that given any partially ordered set with two distinguished elements, the number of linear extensions in which the ranks of the distinguished elements differ by $k$ is log-concave as a function of…
I summarize Bagnoli and Bergstrom (2005)'s review on log-concave functions, make several corrections, and augment the discussion with further results that can be useful in obtaining monotone hazard rate. I also provide an application of…
In 1983, Conway-Gordon showed that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices,…
We establish discrete and continuous log-concavity results for a biparametric extension of the $q$-numbers and of the $q$-binomial coefficients. By using classical results for the Jacobi theta function we are able to lift some of our…
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…
We find sufficient conditions for log-convexity and log-concavity for the functions of the forms $a\mapsto\sum{f_k}(a)_kx^k$, $a\mapsto\sum{f_k}\Gamma(a+k)x^k$ and $a\mapsto\sum{f_k}x^k/(a)_k$. The most useful examples of such functions are…
In this paper, we investigate the properties of sequences and series under the action of the log-concave operator \(\mathcal{L}\). We explore the relationship between the convergence of a sequence \((a_k)\) and the convergence of sequences…
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
A multivariate Gauss-Lucas theorem is proved, sharpening and generalizing previous results on this topic. The theorem is stated in terms of a seemingly new notion of convexity. Applications to multivariate stable polynomials are given.