Related papers: Counting Hamiltonian Paths in Transitive Tournamen…
We construct a collection of numerical invariants for approximately transitive (AT) actions (of $\Z$). We use them (sometimes supplemented by other invariants to show that members of various one-parameter families of AT actions are mutually…
Transition probabilities for stochastic systems can be expressed in terms of a functional integral over paths taken by the system. Evaluating the integral by the saddle point method in the weak-noise limit leads to a remarkable mapping…
For an orientation $H$ with $n$ vertices, let $T(H)$ denote the maximum possible number of labeled copies of $H$ in an $n$-vertex tournament. It is easily seen that $T(H) \ge n!/2^{e(H)}$ as the latter is the expected number of such copies…
In this work we consider open quantum random walks on the non-negative integers. By considering orthogonal matrix polynomials we are able to describe transition probability expressions for classes of walks via a matrix version of the…
Reversible part of evolution equations of physical systems is often generated by a Poisson bracket. We discuss geometric means of construction of Poisson brackets and their mutual coupling (direct, semidirect and matched-pair products) as…
We give lower bound on the number of periodic billiard trajectories inside a generic smooth strictly convex closed surface in 3-space: for odd n, there are at least 2(n-1) such trajectories. We apply a topological approach based on the…
Transition path theory (TPT) offers a powerful formalism for extracting the rate and mechanism of rare dynamical transitions between metastable states. Most applications of TPT either focus on systems with modestly sized state spaces or use…
We develop a Fourier approach to rough path integration, based on the series decomposition of continuous functions in terms of Schauder functions. Our approach is rather elementary, the main ingredient being a simple commutator estimate,…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
We consider a class $\mathcal{F}$ of Markov multi-maps on the unit interval. Any multi-map gives rise to a space of trajectories, which is a closed, shift-invariant subset of $[0,1]^{\mathbb{Z}_+}$. For a multi-map in $\mathcal{F}$, we show…
The main result of this note is a characterization of the Poisson commutativity of Hamilton functions in terms of their principal action functions.
Every human likes choices. But today's fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative routes, but this topic has not been studied thoroughly. Often,…
Fay, Hurlbert and Tennant recently introduced a one-player game on a finite connected graph $G$, which they called cup stacking. Stacks of cups are placed at the vertices of $G$, and are transferred between vertices via stacking moves,…
In the case of two degree system the pairs of quadratic in momenta Hamiltonians commuting according the standard Poisson bracket are considered. The new many-parametrical families of such pairs are founded. The universal method of…
We enumerate rational curves in toric surfaces passing through points and satisfying cross-ratio constraints using tropical and combinatorial methods. Our starting point is arXiv:1509.07453, where a tropical-algebraic correspondence theorem…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
Establishing the existence of periodic orbits is one of the crucial and most intricate topics in the study of dynamical systems, and over the years, many methods have been developed to this end. On the other hand, finding closed orbits in…
Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…
We prove that every $n$-vertex tournament has at most $n\left(\frac{n-1}{2}\right)^k$ walks of length $k$.
In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…