Related papers: Left to right maxima in Dyck Paths
We say that two graphs $H_1,H_2$ on the same vertex set are $G$-creating ($G$-different in other papers, this difference is explained in the introduction) if the union of the two graphs contains $G$ as a subgraph. Let $H(n,k)$ be the…
The principle of maximum irreversible is proved to be a consequence of a stochastic order of the paths inside the phase space; indeed, the system evolves on the greatest path in the stochastic order. The result obtained is that, at the…
Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large…
Using the Wiener-Hopf factorization, it is shown that it is possible to bound the path of an arbitrary Levy process above and below by the paths of two random walks. These walks have the same step distribution, but different random starting…
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering…
Motivated by the recently reported diboson and dijet excesses in Run 1 data at ATLAS and CMS, we explore models of mixed dark matter in left-right symmetric theories. In this study, we calculate the relic abundance and the elastic…
Extremal problems involving independent sets are much studied. Two of the most important extremal problems in this context are concerned with the sharp upper bounds for the number of independent sets of fixed size and the independence…
For a strictly stationary sequence of random variables we derive functional convergence of the joint partial sum and partial maxima process under joint regular variation with index $\alpha \in (0,2)$ and weak dependence conditions. The…
This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…
The on-line nearest-neighbour graph on a sequence of $n$ uniform random points in $(0,1)^d$ ($d \in \N$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this…
Every (left) linear function on a subspace of a finite-dimensional vector space over a (skew) field can be extended to a (left) linear function on the whole space. This paper explores the extent to what this basic fact of linear algebra is…
A tight upper bound is given on the distribution of the maximum of a supermartingale. Specifically, it is shown that if $Y$ is a semimartingale with initial value zero and quadratic variation process $[Y,Y]$ such that $Y + [Y,Y]$ is a…
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…
The Markov-Dyck shifts arise from finite directed graphs. An expression for the zeta function of a Markov-Dyck shift is given. The derivation of this expression is based on a formula in Keller (G. Keller, {\it Circular codes, loop counting,…
In Dark Matter direct detection we are facing the situation of some experiments reporting positive signals which are in conflict with limits from other experiments. Such conclusions are subject to large uncertainties introduced by the…
The joint distribution of the maximum loss and the maximum gain is obtained for a spectrally negative Levy process until the passage time of a given level. Their marginal distributions up to an independent exponential time are also…
We call a coupling of two stochastic processes which maximizes the time until the first disagreement a maximal agreement coupling. We show that such a coupling always exists. Furthermore, it is possible to construct a lower bound on the…
Dyck paths where peaks are only allowed on level 1 and on even-indexed levels, were introduced by Retakh and analysed by Zeilberger, with assistance from Ekhad. We add some combinatorial comments to the enumeration, which involves Motzkin…
The notion of weak cyclic monotonicity of set-valued maps generalizing the cyclic monotonicity is introduced. The existence of solutions of differential inclusions with compact, upper semi-continuous, not necessarily convex right-hand sides…
We provide generating functions for the popularity and the distribution of patterns of length at most three over the set of Dyck paths having a first return decomposition constrained by height.