Related papers: A note on the log-concavity of parking functions

In this short note we prove a conjecture for the interval $(0,1)$, related to a logarithmically completely monotonic function, presented in \cite{BG}. Then, we extend by proving a more generalized theorem. At the end we pose an open problem…

We prove that Sarnak's conjecture holds for any infinite measure symbolic rank-one map. We further extended Bourgain-Sarnak's result, which says that the M\"{o}bius function is a good weight for the ergodic theorem, to maps acting on…

In this note, we introduce a class of indicators that enable to compute efficiently optimal transport plans associated to arbitrary distributions of $N$ demands and $N$ supplies in $\mathbf{R}$ in the case where the cost function is…

Let M be a compact, connected symplectic 2n-dimensional manifold on which an(n-2)-dimensional torus T acts effectively and Hamiltonianly. Under the assumption that there is an effective complementary 2-torus acting on M with symplectic…

In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…

The paper studies logarithmic convexity and concavity of the generalized hypergeometric function with respect to simultaneous shift of several parameters. We use integral representations and properties of Meijer's $G$ function to prove…

In this paper, a class of $\log$-polyharmonic mappings $\mathcal{L}_p\mathcal{H}$ together with its subclass $\mathcal{L}_p\mathcal{H}(G)$ in the unit disk $\mathbb{D}=\{z: |z|<1\}$ is introduced, and several geometrical properties such as…

Fixed point results with respect to generalized rational contractive mappings in semi-metric spaces endowed with a directed graph are proved. Some examples are provided to illustrate the results. The obtained results extend, improve and…

Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…

The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…

In this paper, we equip a C*-algebra-valued b-metric spaces with a graph G = (V,E) and establish some common fixed point theorems. Also, some examples in support of our main results are provided. Finally, as applications, existence and…

We study configuration spaces of linkages whose underlying graph are polygons with diagonal constrains, or more general, partial two-trees. We show that (with an appropriate definition) the oriented area is a Bott-Morse function on the…

We study the convexity properties of the generalized trigonometric functions considered as functions of parameter. We show that $p\to\sin_p(y)$ and $p\to\cos_p(y)$ are log-concave on the appropriate intervals while $p\to\tan_p(y)$ is…

This is a survey paper concerning some theorems on stochastic convex ordering and their applications to functional inequalities for convex functions. We present the recent results on those subjects

We consider convex trace functions $\Phi_{p,q,s} = Trace[ (A^{q/2}B^p A^{q/2})^s]$ where $A$ and $B$ are positive $n\times n$ matrices and ask when these functions are convex or concave. We also consider operator convexity/concavity of…

Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Damron, Gravner, Junge, Lyu, and Sivakoff introduced a model…

We show that unary log-analytic functions are polynomially bounded. In the higher dimensional case globally a log-analytic function can have exponential growth. We show that a log-analytic function is polynomially bounded on a definable set…

We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…

We give a very short proof of the fact that the number of $(a,b)$-parking functions of length $n$ equals $a(a+bn)^{n-1}$. This was first proved in 2003 by Kung and Yan, via a very long and torturous route, as a corollary of a more general…

We show that the notion of parkization of a word, a variant of the classical standardization, allows to introduce an internal product on the Hopf algebra of parking functions. Its Catalan subalgebra is stable under this operation and…