相关论文: On the Sweep Map for $\vec{k}$-Dyck Paths
In this paper we present two different variants of method for symmetric matrix inversion, based on modified Gaussian elimination. Both methods avoid computation of square roots and have a reduced machine time's spending. Further, both of…
This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…
Analysis of cosmic shear is an integral part of understanding structure growth across cosmic time, which in-turn provides us with information about the nature of dark energy. Conventional methods generate \emph{shear maps} from which we can…
We prove an inverse function theorem of Nash-Moser type for maps between Fr\'echet spaces satisfying tame estimates. In contrast to earlier proofs, we do not use the Newton method, that is, we do not use quadratic convergence to overcome…
Convex Integration is a theory developed in the '70s by M. Gromov. This theory allows to solve families of differential problems satisfying some convex assumptions. From a subsolution, the theory iteratively builds a solution by applying a…
A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…
We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…
In this paper a generalization of the Gram-Schmidt Algorithm is presented. Actually we provide an algorithm to construct a set of equiangular vectors with a given angle $\theta\in(0,\arccos(\frac{-1}{n-1}))$ using a set of input independent…
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic…
We describe a new forward-backward variant of Dijkstra's and Spira's Single-Source Shortest Paths (SSSP) algorithms. While essentially all SSSP algorithm only scan edges forward, the new algorithm scans some edges backward. The new…
Recently, Li et al. [2022] presented a dynamic Dyck-reachability algorithm for bidirected graphs. The basic idea is based on updating edge weights in a data structure called the merged graph $G_m$. As noted in Krishna et al. [2023], the…
In this paper, we introduce an alternative method for applying averaging theory of orders $1$ and $2$ in the plane. This is done by combining Taylor expansions of the displacement map with the integral form of the…
A (discrete) dynamical system may have various symmetries and reversing symmetries, which together form its so-called reversing symmetry group. We study the set of 3D trace maps (obtained from two-letter substitution rules) which preserve…
The replacement paths problem for directed graphs is to find for given nodes s and t and every edge e on the shortest path between them, the shortest path between s and t which avoids e. For unweighted directed graphs on n vertices, the…
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix $Q$ with linearithmic complexity, i.e. with $\frac{1}{2}n\lg(n)$ rotations over pairs of coordinates,…
The topics of source seeking and Newton-based extremum seeking have flourished, independently, but never combined. We present the first Newton-based source seeking algorithm. The algorithm employs forward velocity tuning, as in the very…
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…
We extend work of McKay, Morse, and Wilf by giving exact formulas and asymptotic formulas for the number of skew Young tableaux T in two situations: (1) the "inside shape" and total number of cells of T are fixed, and (2) the inside shape…
Given $k$ pairs of terminals $\{(s_{1}, t_{1}), \ldots, (s_{k}, t_{k})\}$ in a graph $G$, the min-sum $k$ vertex-disjoint paths problem is to find a collection $\{Q_{1}, Q_{2}, \ldots, Q_{k}\}$ of vertex-disjoint paths with minimum total…
In the k-Disjoint Shortest Paths problem, a set of terminal pairs of vertices $\{(s_i,t_i)\mid 1\le i\le k\}$ is given and we are asked to find paths $P_1,\ldots,P_k$ such that each path $P_i$ is a shortest path from $s_i$ to $t_i$ and…