Search

We study the thermal effects on the frictional properties of atomically thin sheets. We simulate a simple model based on the Prandtl-Tomlinson model that reproduces the layer dependence of friction and strengthening effects seen in AFM experiments. We investigate sliding at constant speed as well as reversing direction. We also investigate contact aging: the changes that occur to the contact when the sliding stops completely. We compare the numerical results to analytical calculations based on Kramers rates. We find that there is a slower than exponential contact aging that weakens the contact and that we expect will be observable in experiments. We discuss the implications for sliding as well as aging experiments., Comment: 12 pages. 10 figures

We have developed and tested an experimental technique for the measurement of low-energy (p,n) reactions in inverse kinematics relevant to nuclear astrophysics. The proposed setup is located at the ReA3 facility at the National Superconducting Cyclotron Laboratory. In the current approach, we operate the beam-transport line in ReA3 as a recoil separator while tagging the outgoing neutrons from the (p,n) reactions with the low-energy neutron detector array (LENDA). The developed technique was verified by using the $^{40}$Ar(p,n)$^{40}$K reaction as a probe. The results of the proof-of-principle experiment with the $^{40}$Ar beam show that cross-section measurements within an uncertainty of $\sim$25\% are feasible with count rates up to 7 counts/mb/pnA/s. In this article, we give a detailed description of the experimental setup, and present the analysis method and results from the test experiment. Future plans on using the technique in experiments with the separator for capture reactions (SECAR) that is currently being commissioned are also discussed., Comment: Submitted to NIMA. Revised manuscript after referees' first review

A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even number of edges directed in the same fixed direction around the cycle. In this paper, we examine the structure of 1-extendible graphs $G$ which have no even $F$-orientation where $F$ is a fixed $1$-factor of $G$. In the case of graphs of connectivity at least four and k-regular graphs for $k \geq 3$ we give a complete characterization., Comment: 31 pages, 9 figures

A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we present a method for constructing odd 2--factored snarks. In particular, we construct two families of odd 2-factored snarks that disprove a conjecture by some of the authors. Moreover, we approach the problem of characterizing odd 2-factored snarks furnishing a partial characterization of cyclically 4-edge connected odd 2-factored snarks. Finally, we pose a new conjecture regarding odd 2-factored snarks.

A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph of girth 4 is $K_{3,3}$, and conjectured \cite[Conjecture 3.6]{ADJLS} that the only essentially 4--edge-connected cubic bipartite graphs are $K_{3,3}$, the Heawood graph and the Pappus graph. There exists a characterization of symmetric configurations $n_3$ %{\bf decide notation and how to use it in the rest of the paper} due to Martinetti (1886) in which all symmetric configurations $n_3$ can be obtained from an infinite set of so called {\em irreducible} configurations \cite{VM}. The list of irreducible configurations has been completed by Boben \cite{B} in terms of their {\em irreducible Levi graphs}. In this paper we characterize irreducible pseudo 2--factor isomorphic cubic bipartite graphs proving that the only pseudo 2--factor isomorphic irreducible Levi graphs are the Heawood and Pappus graphs. Moreover, the obtained characterization allows us to partially prove the above Conjecture.

A graph $G$ is pseudo 2--factor isomorphic if the parity of the number of cycles in a 2--factor is the same for all 2--factors of $G$. In \cite{ADJLS} we proved that pseudo 2--factor isomorphic $k$--regular bipartite graphs exist only for $k \le 3$. In this paper we generalize this result for regular graphs which are not necessarily bipartite. We also introduce strongly pseudo 2--factor isomorphic graphs and we prove that pseudo and strongly pseudo 2--factor isomorphic 2k--regular graphs and $k$--regular digraphs do not exist for $k\geq 4$. Moreover, we present constructions of infinite families of regular graphs in these classes. In particular we show that the family of Flower snarks is strongly pseudo 2--factor isomorphic but not 2--factor isomorphic and we conjecture that, together with the Petersen and the Blanu\v{s}a2 graphs, they are the only cyclically 4--edge--connected snarks for which each 2--factor contains only cycles of odd length.

A method for the quasi-one-dimensional simulation of magnetic nozzles is presented and simulations of a magnetic nozzle are performed. The effects of the density variation due to plasma expansion and the magnetic field forces on ion acceleration are investigated. Magnetic field forces acting on the electrons are found to be responsible for the formation of potential structures which accelerate ions. The effects of the plasma density variation alone are found to only weakly affect ion acceleration. Strongly diverging magnetic fields drive more rapid potential drops.