相关论文: Hamiltonian paths on the Sierpinski gasket

We use a method, inspired by Pohozeav's work, to study asymptotic behaviors of non-variational elliptic systems in dimension n greater than two. The results apply to changing sign solutions.

Let G_{\rm 3-out} denote the random graph on vertex set [n] in which each vertex chooses 3 neighbors uniformly at random. Note that G_{\rm 3-out} has minimum degree 3 and average degree 6. We prove that the probability that G_{\rm 3-out} is…

This paper is a continuation of our study of the dynamics of contact Hamiltonian systems in \cite{JY}, but without monotonicity assumption. Due to the complexity of general cases, we focus on the behavior of action minimizing orbits. We…

Let $H$ be an $n$-vertex 3-uniform hypergraph such that every pair of vertices is in at least $n/3+o(n)$ edges. We show that $H$ contains two vertex-disjoint tight paths whose union covers the vertex set of $H$. The quantity two here is…

The main purpose of this paper is to study the length minimizing property of Hamiltonian paths on closed symplectic manifolds $(M,\omega)$ such that there are no spherical homology class $A \in H_2(M)$ with $$ \omega(A) > 0 \quad \text{and}…

We consider criteria for the differentiability of functions with continuous Laplacian on the Sierpinski Gasket and its higher-dimensional variants $SG_N$, $N>3$, proving results that generalize those of Teplyaev. When $SG_N$ is equipped…

We construct an explicit Hamiltonian cycle in the state graph of the 5-puzzle on a toroidal 2x 3 grid, a graph with 720 vertices. The cycle is described by a short symbolic sequence of 48 moves over the alphabet {L,R,V}, repeated $15$…

We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly…

A {\em k-generalized Dyck 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 $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…

An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We first…

\L{}ukasiewicz paths are lattice paths in $\Bbb{N}^2$ starting at the origin, ending on the $x$-axis, and consisting of steps in the set $\{(1,k), k\geq -1\}$. We give generating function and exact value for the number of $n$-length…

We obtain, by extensive direct numerical simulations, trajectories of heavy inertial particles in two-dimensional, statistically steady, homogeneous, and isotropic turbulent flows, with friction. We show that the probability distribution…

In any dimension $2n \ge 6$ we show that certain spaces of symplectic embeddings of a polydisk into a product $B^4 \times \Bbb R^{2(n-2)}$ of a $4$-ball and Euclidean space, are not path connected. We also show that any pair of such…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

We consider solutions of the $2\times 2$ matrix Hamiltonian of physical systems within the context of the asymptotic iteration method. Our technique is based on transformation of the associated Hamiltonian in the form of the first order…

The generalized Petersen graph $G(n, k)$ is a cubic graph with vertex set $V(G(n, k)) = \{v_i\}_{0 \leq i < n} \cup \{w_i\}_{0 \leq i < n}$ and edge set $E(G(n, k)) = \{v_i v_{i+1}\}_{0 \leq i < n} \cup \{w_i w_{i+k}\}_{0 \leq i < n} \cup…

We study classical particles on the sites of an open chain which diffuse, coagulate and decoagulate preferentially in one direction. The master equation is expressed in terms of a spin one-half Hamiltonian $H$ and the model is shown to be…

The multifractal behavior of the normalized first passage time is investigated on the two dimensional Sierpinski gasket with both absorbing and reflecting barriers. The normalized first passage time for Sinai model and the logistic model to…

We study the structure of quasiperiodic Lorentz gases, i.e., particles bouncing elastically off fixed obstacles arranged in quasiperiodic lattices. By employing a construction to embed such structures into a higher dimensional periodic…

The path probability of stochastic motion of non dissipative or quasi-Hamiltonian systems is investigated by numerical experiment. The simulation model generates ideal one-dimensional motion of particles subject only to conservative forces…