Long path and cycle decompositions of even hypercubes

We consider edge decompositions of the $n$-dimensional hypercube $Q_n$ into isomorphic copies of a given graph $H$. While a number of results are known about decomposing $Q_n$ into graphs from various classes, the simplest cases of paths and cycles of a given length are far from being understood. A conjecture of Erde asserts that if $n$ is even, $\ell < 2^n$ and $\ell$ divides the number of edges of $Q_n$, then the path of length $\ell$ decomposes $Q_n$. Tapadia et al.\ proved that any path of length $2^mn$, where $2^m<n$, satisfying these conditions decomposes $Q_n$. Here, we make progress toward resolving Erde's conjecture by showing that cycles of certain lengths up to $2^{n+1}/n$ decompose $Q_n$. As a consequence, we show that $Q_n$ can be decomposed into copies of any path of length at most $2^{n}/n$ dividing the number of edges of $Q_n$, thereby settling Erde's conjecture up to a linear factor

The Weinstein Conjecture for Hamiltonian Fibrations

In this note we extend to non trivial Hamiltonian fibrations over symplectically uniruled manifolds a result of Lu's, \cite{Lu}, stating that any trivial symplectic product of two closed symplectic manifolds with one of them being symplectically uniruled verifies the Weinstein Conjecture for closed separating hypersurfaces of contact type, under certain technical conditions. The proof is based on the product formula for Gromov-Witten invariants ($GW$-invariant) of Hamiltonian fibrations derived in \cite{H}.Comment: 15 page

On realization graphs of degree sequences

Given the degree sequence $d$ of a graph, the realization graph of $d$ is the graph having as its vertices the labeled realizations of $d$, with two vertices adjacent if one realization may be obtained from the other via an edge-switching operation. We describe a connection between Cartesian products in realization graphs and the canonical decomposition of degree sequences described by R.I. Tyshkevich and others. As applications, we characterize the degree sequences whose realization graphs are triangle-free graphs or hypercubes.Comment: 10 pages, 5 figure

Non-Hermitian dynamics of slowly-varying Hamiltonians

We develop a theoretical description of non-Hermitian time evolution that accounts for the break- down of the adiabatic theorem. We obtain closed-form expressions for the time-dependent state amplitudes, involving the complex eigen-energies as well as inter-band Berry connections calculated using basis sets from appropriately-chosen Schur decompositions. Using a two-level system as an example, we show that our theory accurately captures the phenomenon of "sudden transitions", where the system state abruptly jumps from one eigenstate to another.Comment: 12 pages, 4 figure

Decomposing 8-regular graphs into paths of length 4

A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\ell$ edges. Kouider and Lonc (1999) conjectured that, in the special case where $T$ is the path with $\ell$ edges, $G$ admits a $T$-decomposition $\mathcal{D}$ where every vertex of $G$ is the end-vertex of exactly two paths of $\mathcal{D}$, and proved that this statement holds when $G$ has girth at least $(\ell+3)/2$. In this paper we verify Kouider and Lonc's Conjecture for paths of length $4$