Related papers: Constant term solution for an arbitrary number of …
This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
This note summarizes the state of what is known about the tractability of the problem ModPath, which asks if an input undirected graph contains a simple st-path whose length satisfies modulo constraints. We also consider the problem…
We consider heat conduction across an ordered oscillator chain with harmonic interparticle interactions and also onsite harmonic potentials. The onsite spring constant is the same for all sites excepting the boundary sites. The chain is…
Using continuation methods, we study the global solution structure of periodic solutions for a class of periodically forced equations, generalizing the case of relativistic pendulum. We obtain results on the existence and multiplicity of…
In this article the pursuit problem of objects that moves with different accelerations and initial speeds is studied. Initially, the situation in which the escaping object moves in a straight line is considered. Under this condition, and if…
We prove the existence of exponentially localised and time-periodic solutions in general nonlinear Hamiltonian lattice systems. Like normal modes, these localised solutions are characterised by collective oscillations at the lattice sites…
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
The calculation of the decay rate of a metastable state in the path-integral formulation of stochastic processes is revisited. Previous derivations of this rate were achieved at the cost of a step that is difficult to justify…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We discuss factorization of the hypergeometric-type difference equations on the uniform lattices and show how one can construct a dynamical algebra, which corresponds to each of these equations. Some examples are exhibited, in particular,…
The propagator for a certain class of two time-dependent coupled and driven harmonic oscillators with time-varying angular frequencies and masses is evaluated by path integration. This is simply done through suitably chosen generalized…
We consider sum-type strongly convex optimization problem (first term) with smooth convex not proximal friendly composite (second term). We show that the complexity of this problem can be split into optimal number of incremental oracle…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich theory partly due to their ubiquity in mathematics and computer science. Stream differential equations are a coinductive method for specifying…
This paper presents an optimal $\Theta(n \log n)$ algorithm for determining time-minimal rectilinear paths among $n$ transient rectilinear obstacles. An obstacle is transient if it exists in the scene only for a specific time interval,…
This article studies the existence of long-time solutions to the Hamiltonian boundary value problem, and their consistent numerical approximation. Such a boundary value problem is, for example, common in Molecular Dynamics, where one aims…
Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…
A {\em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…