An essential problem in photochemistry is understanding the coupling of electronic and nuclear dynamics in molecules, which manifests in processes such as hydrogen migration. Measurements of hydrogen migration in molecules that have more than two equivalent hydrogen sites, however, produce data that is difficult to compare with calculations because the initial hydrogen site is unknown. We demonstrate that coincidence ion-imaging measurements of a few deuterium-tagged isotopologues of ethanol can determine the contribution of each initial-site composition to hydrogen-rich fragments following strong-field double ionization. These site-specific probabilities produce benchmarks for calculations and answer outstanding questions about photofragmentation of ethanol dications; e.g., establishing that the central two hydrogen atoms are 15 times more likely to abstract the hydroxyl proton than a methyl-group proton to form H
Zero- to ultralow-field (ZULF) nuclear magnetic resonance (NMR) is an emerging tool for precision chemical analysis. In this work, we study dynamic processes and investigate the influence of chemical exchange on ZULF NMR
- Award ID(s):
- 1709944
- NSF-PAR ID:
- 10153432
- Publisher / Repository:
- Nature Publishing Group
- Date Published:
- Journal Name:
- Nature Communications
- Volume:
- 10
- Issue:
- 1
- ISSN:
- 2041-1723
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract and that hydrogen scrambling, involving the exchange of hydrogen between different sites, is important in H2O+formation. The technique extends to dynamic variables and could, in principle, be applied to larger non-cyclic hydrocarbons.$${}_{3}^{+}$$ -
Abstract Let us fix a prime
p and a homogeneous system ofm linear equations for$$a_{j,1}x_1+\dots +a_{j,k}x_k=0$$ with coefficients$$j=1,\dots ,m$$ . Suppose that$$a_{j,i}\in \mathbb {F}_p$$ , that$$k\ge 3m$$ for$$a_{j,1}+\dots +a_{j,k}=0$$ and that every$$j=1,\dots ,m$$ minor of the$$m\times m$$ matrix$$m\times k$$ is non-singular. Then we prove that for any (large)$$(a_{j,i})_{j,i}$$ n , any subset of size$$A\subseteq \mathbb {F}_p^n$$ contains a solution$$|A|> C\cdot \Gamma ^n$$ to the given system of equations such that the vectors$$(x_1,\dots ,x_k)\in A^k$$ are all distinct. Here,$$x_1,\dots ,x_k\in A$$ C and are constants only depending on$$\Gamma $$ p ,m andk such that . The crucial point here is the condition for the vectors$$\Gamma in the solution$$x_1,\dots ,x_k$$ to be distinct. If we relax this condition and only demand that$$(x_1,\dots ,x_k)\in A^k$$ are not all equal, then the statement would follow easily from Tao’s slice rank polynomial method. However, handling the distinctness condition is much harder, and requires a new approach. While all previous combinatorial applications of the slice rank polynomial method have relied on the slice rank of diagonal tensors, we use a slice rank argument for a non-diagonal tensor in combination with combinatorial and probabilistic arguments.$$x_1,\dots ,x_k$$ -
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in
and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathsf {Quasi}\text {-}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$ , by showing that$\mathcal { C}$ admits non-trivial satisfiability and/or$\mathcal { C}$ # SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a non-trivial# SAT algorithm for a circuit class . Say that a symmetric Boolean function${\mathcal C}$ f (x 1,…,x n ) issparse if it outputs 1 onO (1) values of . We show that for every sparse${\sum }_{i} x_{i}$ f , and for all “typical” , faster$\mathcal { C}$ # SAT algorithms for circuits imply lower bounds against the circuit class$\mathcal { C}$ , which may be$f \circ \mathcal { C}$ stronger than itself. In particular:$\mathcal { C}$ # SAT algorithms forn k -size -circuits running in 2$\mathcal { C}$ n /n k time (for allk ) implyN E X P does not have -circuits of polynomial size.$(f \circ \mathcal { C})$ # SAT algorithms for -size$2^{n^{{\varepsilon }}}$ -circuits running in$\mathcal { C}$ time (for some$2^{n-n^{{\varepsilon }}}$ ε > 0) implyQ u a s i -N P does not have -circuits of polynomial size.$(f \circ \mathcal { C})$ Applying
# SAT algorithms from the literature, one immediate corollary of our results is thatQ u a s i -N P does not haveE M A J ∘A C C 0∘T H R circuits of polynomial size, whereE M A J is the “exact majority” function, improving previous lower bounds againstA C C 0[Williams JACM’14] andA C C 0∘T H R [Williams STOC’14], [Murray-Williams STOC’18]. This is the first nontrivial lower bound against such a circuit class. -
A bstract Three searches are presented for signatures of physics beyond the standard model (SM) in
ττ final states in proton-proton collisions at the LHC, using a data sample collected with the CMS detector at = 13 TeV, corresponding to an integrated luminosity of 138 fb$$ \sqrt{s} $$ − 1. Upper limits at 95% confidence level (CL) are set on the products of the branching fraction for the decay intoτ leptons and the cross sections for the production of a new bosonϕ , in addition to the H(125) boson, via gluon fusion (ggϕ ) or in association with b quarks, ranging from (10 pb) for a mass of 60 GeV to 0.3 fb for a mass of 3.5 TeV each. The data reveal two excesses for gg$$ \mathcal{O} $$ ϕ production with localp -values equivalent to about three standard deviations atm ϕ = 0. 1 and 1.2 TeV. In a search fort -channel exchange of a vector leptoquark U1, 95% CL upper limits are set on the dimensionless U1leptoquark coupling to quarks andτ leptons ranging from 1 for a mass of 1 TeV to 6 for a mass of 5 TeV, depending on the scenario. In the interpretations of the and$$ {M}_{\textrm{h}}^{125} $$ minimal supersymmetric SM benchmark scenarios, additional Higgs bosons with masses below 350 GeV are excluded at 95% CL.$$ {M}_{\textrm{h},\textrm{EFT}}^{125} $$ -
Abstract Let
be an elliptically fibered$$X\rightarrow {{\mathbb {P}}}^1$$ K 3 surface, admitting a sequence of Ricci-flat metrics collapsing the fibers. Let$$\omega _{i}$$ V be a holomorphicSU (n ) bundle overX , stable with respect to . Given the corresponding sequence$$\omega _i$$ of Hermitian–Yang–Mills connections on$$\Xi _i$$ V , we prove that, ifE is a generic fiber, the restricted sequence converges to a flat connection$$\Xi _i|_{E}$$ . Furthermore, if the restriction$$A_0$$ is of the form$$V|_E$$ for$$\oplus _{j=1}^n{\mathcal {O}}_E(q_j-0)$$ n distinct points , then these points uniquely determine$$q_j\in E$$ .$$A_0$$