Related papers: Hamiltonian paths on the Sierpinski gasket
We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4…
In a directed graph $G=(V,E)$ with a capacity on every edge, a \emph{bottleneck path} (or \emph{widest path}) between two vertices is a path maximizing the minimum capacity of edges in the path. For the single-source all-destination version…
An outstanding property of any Hamiltonian system is the symplecticity of its flow, namely, the continuous trajectory preserves volume in phase space. Given a symplectic but discrete trajectory generated by a transition matrix applied at a…
The Stretched Sierpinski Gasket is a non-self-similar set but it still exhibits very high symmetry. In an earlier work we calculated the leading term for the eigenvalue counting function for operators coming from resistance forms that were…
We derive a formula expressing the average number $E_n$ of real lines on a random hypersurface of degree $2n-3$ in $\mathbb{R}\textrm{P}^n$ in terms of the expected modulus of the determinant of a special random matrix. In the case $n=3$ we…
We say that two graphs on the same vertex set are $G$-creating if their union (the union of their edges) contains $G$ as a subgraph. Let $H_n(G)$ be the maximum number of pairwise $G$-creating Hamiltonian paths of $K_n$. Cohen, Fachini and…
We study the asymptotic behavior of Bohmian trajectories in a scattering situation with short range potential and for wave functions with a scattering and a bound part. It is shown that the set of possible trajectories splits into…
We {\em derive} the exact configuration space path integral, together with the way how to evaluate it, from the Hamiltonian approach for any quantum mechanical system in flat spacetime whose Hamiltonian has at most two momentum operators.…
We study the asymptotic behavior of solutions to the Dirichlet problem for Hamilton-Jacobi equations with large drift terms, where the drift terms are given by the Hamiltonian vector fields of Hamiltonian $H$. This is an attempt to…
Grimmett and McDiarmid suggested a simple heuristic for finding stable sets in random graphs. They showed that the heuristic finds a stable set of size $\sim\log_2 n$ (with high probability) on a $G(n, 1/2)$ random graph. We determine the…
In this paper we consider the long time asymptotics of a linear version of the Smoluchowski equation which describes the evolution of a tagged particle moving at constant speed in a random distribution of fixed particles. The volumes $v$ of…
Consider the standard symplectic $(\RR^{2n}, \omega_0)$, a point $p\in\RR^{2n}$ and an immersed closed orientable hypersurface $\Sigma\subset\RR^{2n}\minus\{p\}$, all in general position. We study the following passage/tangency question:…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
It is shown explicitly how self-similar graphs can be obtained as `blow-up' constructions of finite cell graphs $\hat C$. This yields a larger family of graphs than the graphs obtained by discretising continuous self-similar fractals. For a…
We bring attention to the fact that Maxwell's mean free path for a dilute hard-sphere gas in thermal equilibrium, $(\sqrt{2}\sigma n)^{-1}$, which is ordinarily obtained by multiplying the average speed by the average time between…
In this article, we have introduced a $\mathcal{PT}$ symmetric non-Hermitian Hamiltonian model which is given as $\hat{\mathcal{H}}=\omega (\hat{b}^{\dag}\hat{b}+1/2)+ \alpha (\hat{b}^{2}-(\hat{b}^{\dag})^{2})$ where $\omega$ and $\alpha$…
This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…
The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ is the subspace of $C(G)$, spanned by the…
A supergrid graph is a finite vertex-induced subgraph of the infinite graph whose vertex set consists of all points of the plane with integer coordinates and in which two vertices are adjacent if the difference of their x or y coordinates…
A {\em Motzkin 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 $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…