Related papers: Counting Hamiltonian Paths in Transitive Tournamen…
Classical trajectories are calculated for two Hamiltonian systems with ring shaped potentials. Both systems are super-integrable, but not maximally super-integrable, having four globally defined single valued integrals of motion each. All…
Thomassen conjectured that there is a function $f(k)$ such that every strongly $f(k)$-connected tournament contains $k$ edge-disjoint Hamiltonian cycles. This conjecture was recently proved by K\"uhn, Lapinskas, Osthus, and Patel who showed…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We examine the possible trajectories of a classical particle, trapped in a two-dimensional infinite rectangular well, using the Hamilton-Jacobi equation. We observe that three types of trajectories are possible: periodic orbits, open orbits…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
The Traveling Tournament Problem(TTP) is a combinatorial optimization problem where we have to give a scheduling algorithm which minimizes the total distance traveled by all the participating teams of a double round-robin tournament…
In this paper we develop the alternative path-integral approach to quantum mechanics. We present a resolvent of a Hamiltonian (which is Laplace transform of a evolution operator) in a form which has a sense of ``the sum over paths'' but it…
A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
We introduce the concept of a "transitory" dynamical system---one whose time-dependence is confined to a compact interval---and show how to quantify transport between two-dimensional Lagrangian coherent structures for the Hamiltonian case.…
A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…
We investigate time dependent, first order Mean Field Games on the torus comparing, in a broad and general framework, the classical differential formulation , given by a Hamilton Jacobi equation coupled with a continuity equation, with a…
We study the interplay between the regularity of paths and Hamiltonians in the theory of pathwise Hamilton-Jacobi equations with the use of interpolation methods. The regularity of the paths is measured with respect to Sobolev, Besov,…
A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such…
We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this…
In a non-compact context the first natural step in the search for periodic orbits of a hamiltonian flow is to detect bounded ones. In this paper we show that, in a non-compact setting, certain algebraic topological constraints imposed to a…
We briefly review a hamiltonian path integral formalism developed earlier by one of us. An important feature of this formalism is that the path integral quantization in arbitrary co-ordinates is set up making use of only classical…
We solve two problems regarding the enumeration of lattice paths in $\mathbb{Z}^2$ with steps $(1,1)$ and $(1,-1)$ with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.…
We study the functorial and growth properties of closed orbits for maps. By viewing an arbitrary sequence as the orbit-counting function for a map, iterates and Cartesian products of maps define new transformations between integer…
In this paper, we derive several formulas of counting families of non-intersecting paths for two-sided ladder-shaped regions. As an application, we give a new proof to a combinatorial interpretation of Fibonacci numbers obtained by G.…