Related papers: Dispersed Dyck paths revisited
Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…
We revisit the damped string equation on a compact interval with a variety of boundary conditions and derive an infinite sequence of trace formulas associated with it, employing methods familiar from supersymmetric quantum mechanics. We…
Simplicial complexes are extensively studied in the field of algebraic topology. They have gained attention in recent time due to their applications in fields like theoretical distributed computing and simplicial neural networks. Graphs are…
We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…
In an effort to further understanding $q,t$-Catalan statistics, a new statistic on Dyck paths called $\mathtt{depth}$ was proposed in Pappe, Paul and Schilling (2022) and was shown to be jointly equi-distributed with the well-known…
Damped mechanical systems with various forms of damping are quantized using the path integral formalism. In particular, we obtain the path integral kernel for the linearly damped harmonic oscillator and a particle in a uniform gravitational…
Dissipative particle dynamics (DPD) belongs to a class of models and computational algorithms developed to address mesoscale problems in complex fluids and soft matter in general. It is based on the notion of particles that represent…
The {\it partially disjoint paths problem} is: {\it given:} a directed graph, vertices $r_1,s_1,\ldots,r_k,s_k$, and a set $F$ of pairs $\{i,j\}$ from $\{1,\ldots,k\}$, {\it find:} for each $i=1,\ldots,k$ a directed $r_i-s_i$ path $P_i$…
We study the enumeration of different classes of grand knight's paths in the plane. In particular, we focus on the subsets of zigzag knight's paths that are subject to constraints. These constraints include ending at $y$-coordinate 0,…
We construct a path distribution representing the kinetic part of the Feynman path integral at discrete times similar to that defined by Thomas [1], but on a Hilbert space of paths rather than a nuclear sequence space. We also consider…
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…
We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…
Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an input digraph G=(V,A) by a number k of sequences with entries…
The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…
Catalan numbers and their interpretations in terms of Dyck paths are widely used in different topics of applied mathematics and computer science. Here, we consider a general approach for constrained Dyck paths. In particular, we study Dyck…
We give a description of the well known Zeta map on Dyck paths which sends the dinv,area statistics to the area,bounce statistics. Our description uses Dyck paths area sequences and can be implemented easily.
We consider distributed optimization on undirected connected graphs. We propose a novel distributed conditional gradient method with (O(1/\sqrt{k})) convergence. Compared with existing methods, each iteration of our method uses both…
We derive a formula for the level spacing probability distribution in quantum graphs. We apply it to simple examples and we discuss its relation with previous work and its possible application in more general cases. Moreover, we derive an…
We propose an efficient and scalable architecture for processing generalized graph-pattern queries as they are specified by the current W3C recommendation of the SPARQL 1.1 "Query Language" component. Specifically, the class of queries we…
In this work, we seek to simulate rare transitions between metastable states using score-based generative models. An efficient method for generating high-quality transition paths is valuable for the study of molecular systems since data is…