Related papers: Rotor-routing orbits in directed graphs and the Pi…
For certain types of quantum graphs we show that the random-matrix form factor can be recovered to at least third order in the scaled time $\tau$ from periodic-orbit theory. We consider the contributions from pairs of periodic orbits…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
Inspired by the study of loose cycles in hypergraphs, we define the \emph{loose core} in hypergraphs as a structure which mirrors the close relationship between cycles and $2$-cores in graphs. We prove that in the $r$-uniform binomial…
We give criteria for the existence of bifurcations of symmetric periodic orbits in reversible Hamiltonian systems in terms of local equivariant Lagrangian Rabinowitz Floer homology. As an example, we consider the family of the direct…
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between the cop numbers of an oriented graph and its underlying…
In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids. We define non-even oriented matroids generalising non-even…
Characterizations graphs of some classes to induce periodic Grover walks have been studied for recent years. In particular, for the strongly regular graphs, it has been known that there are only three kinds of such graphs. Here, we focus on…
We prove that for a generic family of circle diffeomorphisms every parameter value that corresponds to an irrational rotation number is approximated by parameter values for which the diffeomorphisms have arbitrarily large finite numbers of…
In this paper we consider a one dimensional liner piecewise-smooth discontinuous map. It is well known that stable periodic orbits exist in this type of map for a specific parameter region. It is also known that the corresponding…
We investigate rational maps with period one and two cluster cycles. Given the definition of a cluster, we show that, in the case where the degree is $d$ and the cluster is fixed, the Thurston class of a rational map is fixed by the…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
The gonality of a graph measures how difficult it is to move chips around the entirety of a graph according to certain chip-firing rules without introducing debt. In this paper we study the gonality of circulant graphs, a class of…
In 1972, Woodall raised the following Ore type condition for directed Hamilton cycles in digraphs: Let $D$ be a digraph. If for every vertex pair $u$ and $v$, where there is no arc from $u$ to $v$, we have $d^+u)+d^-(v)\geq |D|$, then $D$…
The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…
We define and investigate a new three-parameter family of graphs that further generalizes the Fibonacci and metallic cubes. Namely, the number of vertices in this family of graphs satisfies Horadam recurrence, a linear recurrence of second…
We review some properties of periodic orbit families in polygonal billiards and discuss in particular a sum rule that they obey. In addition, we provide algorithms to determine periodic orbit families and present numerical results that shed…
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{Gr}^{\geq 0}(n,k)$. Any two plabic graphs for the same…
Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest…
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…