Related papers: Path counting and random matrix theory
We introduce dilogarithm identities through a beta integral-based technique that we apply to provide analytic proofs of previously conjectured dilogarithm relations, solving open problems given by both Bytsko and Campbell, and that we…
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how…
We classify which local problems with inputs on oriented paths have so-called Borel solution and show that this class of problems remains the same if we instead require a measurable solution, a factor of iid solution, or a solution with the…
We consider random hermitian matrices in which distant above-diagonal entries are independent but nearby entries may be correlated. We find the limit of the empirical distribution of eigenvalues by combinatorial methods. We also prove that…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We prove a recent conjecture by Ren\'e Marczinzik involving certain statistics on Dyck paths that originate in the representation theory of Nakayama algebras of a linearly oriented quiver. We do so by analysing the effect of the…
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
We consider the enumeration of walks on the two dimensional non-negative integer lattice with short steps. Up to isomorphism there are 79 unique two dimensional models to consider, and previous work in this area has used the kernel method,…
We introduce and study a family of random processes on trees we call hipster random walks, special instances of which we heuristically connect to the min-plus binary trees introduced by Robin Pemantle and studied by Auffinger and Cable…
We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…
We present a new bijection between variants of $m$-Dyck paths (paths with steps in $\{+1,-m\}$ starting and ending at height $0$ and remaining at non-negative height), which generalizes a classical bijection between Dyck prefixes and…
We call progressive paths and rushed paths two families of Dyck paths studied by Asinowski and Jelinek, which have the same enumerating sequence (OEIS entry A287709). We present a bijection proving this fact. Rushed paths turn out to be in…
We characterize the signature of piecewise continuously differentiable paths transformed by a polynomial map in terms of the signature of the original path. For this aim, we define recursively an algebra homomorphism between two shuffle…
We provide a refined combinatorial identity for the set of partitions of $\{1,\dots, n\}$, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free…
This letter treats the quantum random walk on the line determined by a 2 times 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Motivated by Berkovich's nine $q$-binomial identities involving the Legendre symbol $(\frac{d}{3})$, we establish a unified form of $q$-binomial identities of this type through a combinatorial approach. This unified form includes…