Related papers: On the Sweep Map for $\vec{k}$-Dyck Paths
Using the concept of self-decomposable subordinators introduced in Gardini et al. [11], we build a new bivariate Normal Inverse Gaussian process that can capture stochastic delays. In addition, we also develop a novel path simulation scheme…
We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…
If a graph $G_M$ is embedded into a closed surface $S$ such that $S \backslash G_M$ is a collection of disjoint open discs, then $M=(G_M,S)$ is called a {\em map}. A {\em zigzag} in a map $M$ is a closed path which alternates choosing, at…
In this paper, we developed new numeric and symbolic algorithms to find the inverse of any nonsingular heptadiagonal matrix. Symbolic algorithm will not break and it is without setting any restrictive conditions. The computational cost of…
We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods applied to systems of (non-necessarily Hamiltonian) ordinary differential equations by means of Newton-like iterations. We pay particular…
We investigate the $K$-theoretic Gysin map for type $A$ partial flag bundles from the viewpoint of integrability. We introduce several types of partition functions for one version of $q=0$ degeneration of $U_q(\widehat{sl_n})$ vertex models…
Dispersed Dyck paths are Dyck paths, with possible flat steps on level 0. We revisit and augment questions about them from the Encyclopedia of Integer Sequences, in a systematic way that uses generating functions and the kernel method.
By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…
The signature is a representation of a path as an infinite sequence of its iterated integrals. Under certain assumptions, the signature characterizes the path, up to translation and reparameterization. Therefore, a crucial question of…
In inverting large sparse matrices, the key difficulty lies in effectively exploiting sparsity during the inversion process. One well-established strategy is the nested dissection, which seeks the so-called sparse Cholesky factorization. We…
We investigate the computational complexity of finding temporally disjoint paths or walks in temporal graphs. There, the edge set changes over discrete time steps and a temporal path (resp. walk) uses edges that appear at monotonically…
Input design is an important problem for system identification and has been well studied for the classical system identification, i.e., the maximum likelihood/prediction error method. For the emerging regularized system identification, the…
Motivated by efforts to incorporate sheaves into networking, we seek to reinterpret pathfinding algorithms in terms of cellular sheaves, using Dijkstra's algorithm as an example. We construct sheaves on a graph with distinguished source and…
We consider a greedy version of the $m$-Tamari order defined on $m$-Dyck paths, recently introduced by Dermenjian. Inspired by intriguing connections between intervals in the ordinary 1-Tamari order and planar triangulations, and more…
Neural network systems describe complex mappings that can be very difficult to understand. In this paper, we study the inverse problem of determining the input images that get mapped to specific neural network classes. Ultimately, we expect…
Special exotic class of dynamical systems~ -- the implicit maps~ -- is considered. Such maps, particularly, can appear as a result of using of implicit and semi-implicit iterative numerical methods. In the present work we propose the…
We present an algorithm for solving inverse problems on graphs analogous to those arising in diffuse optical tomography for continuous media. In particular, we formulate and analyze a discrete version of the inverse Born series, proving…
In this article, we investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface…
We discuss a non-reversible, lifted Markov-chain Monte Carlo (MCMC) algorithm for particle systems in which the direction of proposed displacements is changed deterministically. This algorithm sweeps through directions analogously to the…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…