An official website of the United States government
The bond strength and photodissociation dynamics of MgI+ are determined by a combination of theory, photodissociation spectroscopy, and photofragment velocity map imaging. From 17 000 to 21 500 cm−1, the photodissociation spectrum of MgI+ is broad and unstructured; photofragment images in this region show perpendicular anisotropy, which is consistent with absorption to the repulsive wall of the (1) Ω = 1 or (2) Ω = 1 states followed by direct dissociation to ground state products Mg+ (2S) + I (2P3/2). Analysis of photofragment images taken at photon energies near the threshold gives a bond dissociation energy D0(Mg+-I) = 203.0 ± 1.8 kJ/mol (2.10 ± 0.02 eV; 17 000 ± 150 cm−1). At photon energies of 33 000–41 000 cm−1, exclusively I+ fragments are formed. Over most of this region, the formation of I+ is not energetically allowed via one-photon absorption from the ground state of MgI+. Images show the observed product is due to resonance enhanced two-photon dissociation. The photodissociation spectrum from 33 000 to 38 500 cm−1 shows vibrational structure, giving an average excited state vibrational spacing of 227 cm−1. This is consistent with absorption to the (3) Ω = 0+ state from ν = 0, 1 of the (1) Ω = 0+ ground state; from the (3) Ω = 0+ state, absorption of a second photon results in dissociation to Mg* (3P°J) + I+ (3PJ). From 38 500 to 41 000 cm−1, the spectrum is broad and unstructured. We attribute this region of the spectrum to one-photon dissociation of vibrationally hot MgI+ at low energy and ground state MgI+ at higher energy to form Mg (1S) + I+ (3PJ) products.
more »
« less
Quantum phase transition in a clean superconductor with repulsive dynamical interaction
Abstract We consider a model of electrons at zero temperature, with a repulsive interaction which is a function of the energy transfer. Such an interaction can arise from the combination of electron–electron repulsion at high energies and the weaker electron–phonon attraction at low energies. As shown in previous works, superconductivity can develop despite the overall repulsion due to the energy dependence of the interaction, but the gap Δ( ω ) must change sign at some (imaginary) frequency ω 0 to counteract the repulsion. However, when the constant repulsive part of the interaction is increased, a quantum phase transition towards the normal state occurs. We show that, as the phase transition is approached, Δ and ω 0 must vanish in a correlated way such that $$1/| \log [{{\Delta }}(0)]| \sim {\omega }_{0}^{2}$$ 1 / ∣ log [ Δ ( 0 ) ] ∣ ~ ω 0 2 . We discuss the behavior of phase fluctuations near this transition and show that the correlation between Δ(0) and ω 0 locks the phase stiffness to a non-zero value.
more »
« less
- Award ID(s):
- 1834856
- PAR ID:
- 10355971
- Date Published:
- Journal Name:
- npj Quantum Materials
- Volume:
- 7
- Issue:
- 1
- ISSN:
- 2397-4648
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We consider diffusivity of random walks with transition probabilities depending on the number of consecutive traversals of the last traversed edge, the so called senile reinforced random walk (SeRW). In one dimension, the walk is known to be sub-diffusive with identity reinforcement function. We perturb the model by introducing a small probability δ of escaping the last traversed edge at each step. The perturbed SeRW model is diffusive for any δ > 0 , with enhanced diffusivity (≫ O ( δ^2 ) ) in the small δ regime. We further study stochastically perturbed SeRW models by having the last edge escape probability of the form δ ξ n with ξ n ’s being independent random variables. Enhanced diffusivity in such models are logarithmically close to the so called residual diffusivity (positive in the zero δ limit), with diffusivity between O ( 1/| log δ | ) and O ( 1/ log | log δ | ) . Finally, we generalize our results to higher dimensions where the unperturbed model is already diffusive. The enhanced diffusivity can be as much as O ( 1/log ^2 δ )more » « less
-
Abstract May the triforce be the 3-uniform hypergraph on six vertices with edges {123′, 12′3, 1′23}. We show that the minimum triforce density in a 3-uniform hypergraph of edge density δ is δ 4– o (1) but not O ( δ 4 ). Let M ( δ ) be the maximum number such that the following holds: for every ∊ > 0 and $$G = {\mathbb{F}}_2^n$$ with n sufficiently large, if A ⊆ G × G with A ≥ δ | G | 2 , then there exists a nonzero “popular difference” d ∈ G such that the number of “corners” ( x , y ), ( x + d , y ), ( x , y + d ) ∈ A is at least ( M ( δ )–∊)| G | 2 . As a corollary via a recent result of Mandache, we conclude that M ( δ ) = δ 4– o (1) and M ( δ ) = ω ( δ 4 ). On the other hand, for 0 < δ < 1/2 and sufficiently large N , there exists A ⊆ [ N ] 3 with | A | ≥ δN 3 such that for every d ≠ 0, the number of corners ( x , y , z ), ( x + d , y , z ), ( x , y + d , z ), ( x , y , z + d ) ∈ A is at most δ c log(1/ δ ) N 3 . A similar bound holds in higher dimensions, or for any configuration with at least 5 points or affine dimension at least 3.more » « less
-
Kumar, Amit; Ron-Zewi, Noga (Ed.)We study the Matrix Multiplication Verification Problem (MMV) where the goal is, given three n × n matrices A, B, and C as input, to decide whether AB = C. A classic randomized algorithm by Freivalds (MFCS, 1979) solves MMV in Õ(n²) time, and a longstanding challenge is to (partially) derandomize it while still running in faster than matrix multiplication time (i.e., in o(n^ω) time). To that end, we give two algorithms for MMV in the case where AB - C is sparse. Specifically, when AB - C has at most O(n^δ) non-zero entries for a constant 0 ≤ δ < 2, we give (1) a deterministic O(n^(ω-ε))-time algorithm for constant ε = ε(δ) > 0, and (2) a randomized Õ(n²)-time algorithm using δ/2 ⋅ log₂ n + O(1) random bits. The former algorithm is faster than the deterministic algorithm of Künnemann (ESA, 2018) when δ ≥ 1.056, and the latter algorithm uses fewer random bits than the algorithm of Kimbrel and Sinha (IPL, 1993), which runs in the same time and uses log₂ n + O(1) random bits (in turn fewer than Freivalds’s algorithm). Our algorithms are simple and use techniques from coding theory. Let H be a parity-check matrix of a Maximum Distance Separable (MDS) code, and let G = (I | G') be a generator matrix of a (possibly different) MDS code in systematic form. Our deterministic algorithm uses fast rectangular matrix multiplication to check whether HAB = HC and H(AB)^T = H(C^T), and our randomized algorithm samples a uniformly random row g' from G' and checks whether g'AB = g'C and g'(AB)^T = g'C^T. We additionally study the complexity of MMV. We first show that all algorithms in a natural class of deterministic linear algebraic algorithms for MMV (including ours) require Ω(n^ω) time. We also show a barrier to proving a super-quadratic running time lower bound for matrix multiplication (and hence MMV) under the Strong Exponential Time Hypothesis (SETH). Finally, we study relationships between natural variants and special cases of MMV (with respect to deterministic Õ(n²)-time reductions).more » « less
-
Abstract The starting point for this work was a set of crystal structures containing the motif of interaction between methyl groups in homodimers. Two structures were selected for which QTAIM, NCI and NBO analyses suggested an attractive interaction. However, the calculated interaction energy was negative for only one of these systems. The ability of methyl groups to interact with one another is then examined by DFT calculations. A series of (CH3PnHCH3)2homodimers were allowed to interact with each other for a range of Pn atoms N, P, As, and Sb. Interaction energies of these C⋅⋅⋅C tetrel‐bonded species were below 1 kcal/mol, but could be raised to nearly 3 kcal/mol if the C atom was changed to a heavier tetrel. A strengthening of the C⋅⋅⋅C intermethyl bonds can also be achieved by introducing an asymmetry via an electron‐withdrawing substituent on one unit and a donor on the other. The attractions between the methyl and related groups occur in spite of a coulombic repulsion between σ‐holes on the two groups. NBO, AIM, and NCI tools must be interpreted with caution as they can falsely suggest bonding when the potentials are repulsive.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript
- Journal Article:
- https://doi.org/10.1038/s41535-022-00457-3
