相关论文: On the Sweep Map for $\vec{k}$-Dyck Paths

A modified version of the Dijkstra algorithm using an inventive contraction hierarchy is proposed. The algorithm considers a directed acyclic graph with a conical or semi-circular structure for which a pair of edges is chosen iteratively…

Given a directed graph of nodes and edges connecting them, a common problem is to find the shortest path between any two nodes. Here we show that the shortest path distances can be found by a simple matrix inversion: If the edges are given…

The diagonal entries of pseudoinverse of the Laplacian matrix of a graph appear in many important practical applications, since they contain much information of the graph and many relevant quantities can be expressed in terms of them, such…

A new discrete time-reversible map of a unit square onto itself is proposed. The map comprises of piecewise linear two-dimensional operations, and is able to represent the macroscopic features of both equilibrium and nonequilibrium…

Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichm\"uller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal…

We present a distributed anytime algorithm for performing MAP inference in graphical models. The problem is formulated as a linear programming relaxation over the edges of a graph. The resulting program has a constraint structure that…

In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the…

Maps $f,g\colon X\to X$ are called kin if they are forward iterates of the same map $\varphi\colon X\to X$, up to a composition with a commuting homeomorphism. Kin form an important class of commuting maps on $X$. In this paper, we…

Kontsevitch's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In a subsequent work Okounkov rederived these results from the edge behavior of a Gaussian matrix integral.…

We demonstrate how path integrals often used in problems of theoretical physics can be adapted to provide a machinery for performing Bayesian inference in function spaces. Such inference comes about naturally in the study of inverse…

We give faster algorithms for producing sparse approximations of the transition matrices of $k$-step random walks on undirected, weighted graphs. These transition matrices also form graphs, and arise as intermediate objects in a variety of…

We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…

We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e. integrals of motion. The core idea of the…

The construction of topological index maps for equivariant families of Dirac operators requires factoring a general smooth map through maps of a very simple type: zero sections of vector bundles, open embeddings, and vector bundle…

Paths that consist of up-steps of one unit and down-steps of $k$ units, being bounded below by a horizontal line $-t$, behave like $t+1$ ordered tuples of $k$-Dyck paths, provided that $t\le k$. We describe the general case, allowing $t$…

We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…

The canonical tree-decomposition theorem, given by Robertson and Seymour in their seminal graph minors series, turns out to be one of the most important tool in structural and algorithmic graph theory. In this paper, we provide the…

We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al., and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial…

Network structures are reconstructed from dynamical data by respectively naive mean field (nMF) and Thouless-Anderson-Palmer (TAP) approximations. For TAP approximation, we use two methods to reconstruct the network: a) iteration method; b)…

We introduce a natural generalization of twisted maps, called \emph{warped maps}. While twisted maps play an important role in the study of Deligne--Mumford stacks, warped maps are better suited for studying Artin stacks. Heuristically,…