Related papers: Convolution Preserves Partial Synchronicity of Log…
We show that normalized Schur polynomials are strongly log-concave. As a consequence, we obtain Okounkov's log-concavity conjecture for Littlewood-Richardson coefficients in the special case of Kostka numbers.
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
We introduce the notion of infinitely log-monotonic sequences. By establishing a connection between completely monotonic functions and infinitely log-monotonic sequences, we show that the sequences of the Bernoulli numbers, the Catalan…
We prove that the (B) conjecture and the Gardner-Zvavitch conjecture are true for all log-concave measures that are rotationally invariant, extending previous results known for Gaussian measures. Actually, our result apply beyond the case…
We introduce a notion of $F$-concavity which largely generalizes the usual concavity. By the use of the notions of closedness under positive scalar multiplication and closedness under positive exponentiation we characterize power concavity…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…
Recently, the bunkbed conjecture has been shown to be false, which naturally prompts questions on how to classify the graphs that still satisfy the conjecture. We distinguish between a weak version of the bunkbed conjecture where all the…
We show that a mixture of Beta distributions has log-concave density whenever the mixing weights are themselves log-concave. Some economic and statistical applications are provided in the last section.
We prove a conjecture of Liu and Wang on the q-log-convexity of the polynomial sequence $\{\sum_{k=0}^n{n\choose k}^2q^k\}_{n\geq 0}$. By using Pieri's rule and the Jacobi-Trudi identity for Schur functions, we obtain an expansion of a sum…
We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
In this note we study the Petty projection of a log-concave function, which has been recently introduced in [9]. Moreover, we present some new inequalities involving this new notion, partly complementing and correcting some results from…
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…
We consider polynomials expressing the cohomology classes of subvarieties of products of projective spaces, and limits of positive real multiples of such polynomials. We study the relation between these covolume polynomials and Lorentzian…
The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…
In this paper, by using a general result on the monotonicity of quotients of power series, our aim is to prove some monotonicity and convexity results for the modified Struve functions. Moreover, as consequences of the above mentioned…
Graph convolution (GConv) is a widely used technique that has been demonstrated to be extremely effective for graph learning applications, most notably node categorization. On the other hand, many GConv-based models do not quantify the…
A notion of convolution is presented in the context of formal power series together with lifting constructions characterising algebras of such series, which usually are quantales. A number of examples underpin the universality of these…
In the recent research of data mining, frequent structures in a sequence of graphs have been studied intensively, and one of the main concern is changing structures along a sequence of graphs that can capture dynamic properties of data. On…