Equivalent Hamiltonians

I give a characterization of the conditions for two Hamiltonians to be equivalent, discuss the construction of the operators that relate equivalent Hamiltonians, and introduce variational methods that can select Hamiltonians with desirable features from the space of equivalent Hamiltonians.Comment: 15 page

Deuteron-equivalent and phase-equivalent interactions within light nuclei

Background: Phase-equivalent transformations (PETs) are well-known in quantum scattering and inverse scattering theory. PETs do not affect scattering phase shifts and bound state energies of two-body system but are conventionally supposed to modify two-body bound state observables such as the rms radius and electromagnetic moments. Purpose: In order to preserve all bound state observables, we propose a new particular case of PETs, a deuteron-equivalent transformation (DET-PET), which leaves unchanged not only scattering phase shifts and bound state (deuteron) binding energy but also the bound state wave function. Methods: The construction of DET-PET is discussed; equations defining the simplest DET-PETs are derived. We apply these simplest DET-PETs to the JISP16 $NN$ interaction and use the transformed $NN$ interactions in calculations of $^3$H and $^4$He binding energies in the No-core Full Configuration (NCFC) approach based on extrapolations of the No-core Shell Model (NCSM) basis space results to the infinite basis space. Results: We demonstrate the DET-PET modification of the $np$ scattering wave functions and study the DET-PET manifestation in the binding energies of $^3$H and $^4$He nuclei and their correlation (Tjon line). Conclusions: It is shown that some DET-PETs generate modifications of the central component while the others modify the tensor component of the $NN$ interaction. DET-PETs are able to modify significantly the $np$ scattering wave functions and hence the off-shell properties of the $NN$ interaction. DET-PETs give rise to significant changes in the binding energies of $^3$H (in the range of approximately 1.5 MeV) and $^4$He (in the range of more than 9 MeV) and are able to modify the correlation patterns of binding energies of these nuclei

Weakly Equivalent Arrays

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and extensionality axioms originally proposed by McCarthy. Various filters are used to limit the number of axiom instantiations while preserving completeness. We present an algorithm that lazily instantiates lemmas based on weak equivalence classes. These lemmas are easier to interpolate as they only contain existing terms. We formally define weak equivalence and show correctness of the resulting decision procedure

Equivalent birational embeddings

Let $X$ be a projective variety of dimension $r$ over an algebraically closed field. It is proven that two birational embeddings of $X$ in $\P^n$, with $n\geq r+2$ are equivalent up to Cremona transformations of $\P^n$

Locally Equivalent Correspondences

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally construct bijections between central simple algebras, maximal orders, various Galois cohomology sets, and commensurability classes of arithmetic lattices in simple, inner algebraic groups. We show that under certain conditions, lattices corresponding to one another under our bijections have the same covolume and pro-congruence completion. We also make effective a finiteness result of Prasad and Rapinchuk.Comment: Final Version. To appear in Ann. Inst. Fourie

Equivalent relaxations of optimal power flow

Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite relaxation that computes a full matrix, a chordal relaxation based on a chordal extension of the network graph, and a second-order cone relaxation that computes the smallest partial matrix. We prove a bijection between the feasible sets of the OPF in the bus injection model and the branch flow model, establishing the equivalence of these two models and their second-order cone relaxations. Our results imply that, for radial networks, all these relaxations are equivalent and one should always solve the second-order cone relaxation. For mesh networks, the semidefinite relaxation is tighter than the second-order cone relaxation but requires a heavier computational effort, and the chordal relaxation strikes a good balance. Simulations are used to illustrate these results.Comment: 12 pages, 7 figure