Dynamics of One‐Dimensional Electrons With Broken Spin–Charge Separation

Spin–charge separation is known to be broken in many physically interesting one‐dimensional (1D) and quasi‐1D systems with spin–orbit interaction because of which spin and charge degrees of freedom are mixed in collective excitations. Mixed spin–charge modes carry an electric charge and therefore can be investigated by electrical means. We explore this possibility by studying the dynamic conductance of a 1D electron system with image‐potential‐induced spin–orbit interaction. The real part of the admittance reveals an oscillatory behavior versus frequency that reflects the collective excitation resonances for both modes at their respective transit frequencies. By analyzing the frequency dependence of the conductance the mode velocities can be found and their spin–charge structure can be determined quantitatively.     

Long cycles and spanning subgraphs of locally maximal 1-planar graphs

A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a complete subgraph, then the graph is locally maximal 1-planar. For a 3-connected locally maximal 1-planar graph G, we show the existence of a spanning 3-connected planar subgraph and prove that G is Hamiltonian if G has at most three 3-vertex-cuts, and that G is traceable if G has at most four 3-vertex-cuts. Moreover, infinitely many nontraceable 5-connected 1-planar graphs are presented.     

Graph-like compacta: Characterizations and Eulerian loops

A compact graph-like space is a triple $\left(X,V,E\right)$, where $X$ is a compact, metrizable space, $V\subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X⧹V\cong \text{◂+▸}E\times \left(0,1\right)$. New characterizations of compact graph-like spaces are given, connecting them to certain classes of continua, and to standard subspaces of Freudenthal compactifications of locally finite graphs. These are applied to characterize Eulerian graph-like compacta.     

Edge proximity and matching extension in projective planar graphs

A graph $G$ with at least $2m+2$ vertices is said to be distance $d$ $m$-extendable if, for any matching $M$ of $G$ with $m$ edges in which the edges lie at distance at least $d$ pairwise, there exists a perfect matching of $G$ containing $M$. In this paper we prove that every 5-connected triangulation on the projective plane of even order is distance 3 7-extendable and distance 4 $m$-extendable for any $m$.     

A shuffling theorem for reflectively symmetric tilings

The author and Rohatgi recently proved a ‘shuffling theorem’ for doubly-dented hexagons. In particular, they showed that shuffling removed unit triangles along a horizontal axis in a hexagon changes the tiling number by only a simple multiplicative factor. In this paper, we consider a similar phenomenon for a symmetry class of tilings, namely, the reflectively symmetric tilings. We also prove several shuffling theorems for halved hexagons.     

Simple expressions of the reflection and transmission coefficients of fundamental Lamb waves by a rectangular notch

The scattering of Lamb waves by a two-dimensional rectangular notch is investigated for rapid inspection of defects in a structure. To derive the reflection and transmission coefficients of the scattered waves in a simple way, the scattering caused by the notch is analyzed through the composition of individual scattering processes. Linear equations corresponding to the reflection and transmission coefficients are constructed along with scattering graphs. For an illustration of the efficacy of the presented method, the scattering of fundamental symmetric and anti-symmetric modes are inspected according to the depth and width of a notch in a plate. Validity of these expressions is demonstrated by the comparison of the theoretical analysis results with those from the finite element analysis.     

On the imaginary parts of chromatic roots

While much attention has been directed to the maximum modulus and maximum real part of chromatic roots of graphs of order $n$ (ie, with $n$ vertices), relatively little is known about the maximum imaginary part of such graphs. We prove that the maximum imaginary part can grow linearly in the order of the graph. We also show that for any fixed $\text{◂+▸}p\in \left(0,1\right)$, almost every random graph $G$ in the Erdös-Rényi model has a nonreal root.