Related papers: Singularity analysis via the iterated kernel metho…
We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…
Continuing earlier investigations of restricted lattice walks in $\mathbb{N}^3$, we take a closer look at the models with infinite associated groups. We find that up to isomorphism, only 12 different infinite groups appear, and we establish…
This paper is the first application of the compensation approach to counting problems. We discuss how this method can be applied to a general class of walks in the quarter plane $Z_{+}^{2}$ with a step set that is a subset of…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
We derive a path counting formula for two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves a problem of finding an explicit…
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…
We study the distributions of the continuous-time quantum walk on a one-dimensional lattice. In particular we will consider walks on unbounded lattices, walks with one and two boundaries and Dirichlet boundary conditions, and walks with…
We present general algorithms (fully implemented in Maple) for calculations of various quantities related to constrained directed walks for a general set of steps on the square lattice in two dimensions. As a special case, we rederive…
Bipolar orientations of planar maps have recently attracted some interest in combinatorics, probability theory and theoretical physics. Plane bipolar orientations with $n$ edges are known to be counted by the $n$th Baxter number $b(n)$,…
We extend the generalized gradient-flow framework of Peletier, Rossi, Savar\'e, and Tse to singular jump processes on abstract metric spaces, moving beyond the translation-invariant kernels considered in $\mathbb{R}^d$ and $\mathbb{T}^d$ in…
Circuits play a fundamental role in the theory of linear programming due to their intimate connection to algorithms of combinatorial optimization and the efficiency of the simplex method. We are interested in better understanding the…
Let $f$ be a convergent power series of $n$ variables having an isolated singularity at 0. For a rational number $\alpha$, setting $(X,0)=({\mathbb C}^n,0)$, we show that the length of the ${\mathcal D}_X$-module ${\mathcal D}_Xf^{-\alpha}$…
The squared singular values of the product of $M$ complex Ginibre matrices form a biorthogonal ensemble, and thus their distribution is fully determined by a correlation kernel. The kernel permits a hard edge scaling to a form specified in…
We consider discrete (time and space) random walks confined to the quarter plane, with jumps only in directions $(i,j)$ with $i+j \geq 0$ and small negative jumps, i.e., $i,j \geq -1$. These walks are called singular, and were recently…
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
We show that the series of all walks between any two vertices of any (possibly weighted) directed graph $\mathcal{G}$ is given by a universal continued fraction of finite depth and breadth involving the simple paths and simple cycles of…
The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…
We ask if it is possible to find some particular continuous paths of unit length in linear Brownian motion. Beginning with a discrete version of the problem, we derive the asymptotics of the expected waiting time for several interesting…