Related papers: Non-decreasing Deutsch paths
We consider Deutsch's computational model of a quantum system evolving in a spacetime containing closed timelike curves. Although it is known that this model predicts non-linear and non-unitary evolutions of the system, we demonstrate that…
The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…
A notion of a nearly toric variety is introduced. The examples of nearly toric varieties in the context of Schubert varieties are discussed. In particular, combinatorial characterizations of the smooth and singular nearly toric Schubert…
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is on the connections and differences between the two types of…
A descent of a labeled acyclic digraph is a directed edge $x\to y$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
This article introduces a non-parametric information-theoretic approach to inference about the tail of a continuous or a discrete distribution. Leveraging a new concept named tail profile -- a set of information-theoretic quantities…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
There are three classical lattices on the Catalan numbers: the Tamari lattice, the lattice of noncrossing partitions and the lattice of Dyck paths. The first is known to be isomorphic to the lattice of torsion classes of the path algebra of…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…
Chen and collaborators give a recursively defined bijection from 021-avoiding ascent sequences to 021-avoiding (aka 132-avoiding) permutations. Here we give an algorithmic bijection from 021-avoiding ascent sequences to Dyck paths. Our…
Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3, 4]. In the paper we are dealing with the numbering of Dyck paths, with the resulting numbers, the…
We compute the limiting distribution of height of a random discrete excursion with step sets consisting of one positive step 1 and arbitrary finite set of non-positive integers. The limit law is the supremum of a Brownian excursion. This is…
Pedestrian egress from training schools in the after-class period (especially in China, as children walk down stairs together with their parents) raises practical concerns related to degraded flow conditions and possible safety hazards, but…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The…
Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
We show bijectively that Dyck paths with all peaks at odd height are counted by the Motzkin numbers and Dyck paths with all peaks at even height are counted by the Riordan numbers.