Related papers: Rotor-routing orbits in directed graphs and the Pi…
A complete analysis of classical periodic orbits (POs) and their bifurcations was conducted in spherical harmonic oscillator system with spin-orbit coupling. The motion of the spin is explicitly considered using the spin canonical variables…
This paper investigates the global structures of periodic orbits that appear in Rayleigh-B\'enard convection, which is modeled by a two-dimensional perturbed Hamiltonian model, by focusing upon resonance, symmetry and bifurcation of the…
We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…
It has long been conjectured that generic dynamical systems has finite periodic orbits, ever since the time of Poincar\'e. In this article, a perturbation method is proposed for the $C^r$ closing of periodic orbits. This method is…
We study a simple generalization of the rotation (or circular shift) of the binary sequences. In particular, we show each orbit of this generalized rotation has a certain statistical symmetry. This generalized rotation naturally arises when…
It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such…
A circular-arc hypergraph $H$ is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set $V(H)$ such that every hyperedge is an arc of consecutive vertices. An arc ordering is tight if, for any two hyperedges…
Chip-firing is a combinatorial game played on an undirected graph in which we place chips on vertices. We study chip-firing on an infinite binary tree in which we add a self-loop to the root to ensure each vertex has degree 3. A vertex can…
The T-graph of a multigraded Hilbert scheme records the zero and one-dimensional orbits of the T = (K^*)^n action on the Hilbert scheme induced from the T-action on A^n. It has vertices the T-fixed points, and edges the one-dimensional…
This paper initiates the study of circular orderability of $3$-manifold groups, motivated by the L-space conjecture. We show that a compact, connected, $\mathbb{P}^2$-irreducible $3$-manifold has a circularly orderable fundamental group if…
When the Poincar\'{e} map associated with a periodic orbit of a hybrid dynamical system has constant-rank iterates, we demonstrate the existence of a constant-dimensional invariant subsystem near the orbit which attracts all nearby…
A graph is said to be $k$-{\em isoregular} if any two vertex subsets of cardinality at most $k$, that induce subgraphs of the same isomorphism type, have the same number of neighbors. It is shown that no $3$-isoregular bicirculant (and more…
The properties of motion close to the transition of a stable family of periodic orbits to complex instability is investigated with two symplectic 4D mappings, natural extensions of the standard mapping. As for the other types of…
A bicirculant is a regular graph that admits a semi-regular automorphism with two vertex-orbits of the same size. By $m$ we denote the size of vertex-orbits and by $d$ the valence of a bicirculant. Furthermore, we denote by $s$ the valence…
This paper explains the periodicity of the Grover walk on finite graphs. We characterize the graphs to induce 2, 3, 4, 5-periodic Grover walk and obtain a necessary condition of the graphs to induce an odd-periodic Grover walk.
We consider the existence of patterned Hamilton cycles in randomly colored random graphs. Given a string $\Pi$ over a set of colors $\{1,2,\ldots,r\}$, we say that a Hamilton cycle is $\Pi$-colored if the pattern repeats at intervals of…
Inspired by a twist maps theorem of Mather we study recurrent invariant sets that are ordered like rigid rotation under the action of the lift of a bimodal circle map $g$ to the $k$-fold cover. For each irrational in the interior of the…
Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a linear ordering of its vertex set for which their adjacency…
We use numerical continuation and bifurcation techniques in a boundary value setting to follow Lyapunov families of periodic orbits. These arise from the polygonal system of $n$ bodies in a rotating frame of reference. When the frequency of…
The development of multi-core processor systems is a demanded branch of science and technology. The appearance of processors with dozens and hundreds of cores poses to the developers the question of choosing the optimal topology capable to…