5,604 research outputs found
Complex coupled-cluster approach to an ab-initio description of open quantum systems
We develop ab-initio coupled-cluster theory to describe resonant and weakly
bound states along the neutron drip line. We compute the ground states of the
helium chain 3-10He within coupled-cluster theory in singles and doubles (CCSD)
approximation. We employ a spherical Gamow-Hartree-Fock basis generated from
the low-momentum N3LO nucleon-nucleon interaction. This basis treats bound,
resonant, and continuum states on equal footing, and is therefore optimal for
the description of properties of drip line nuclei where continuum features play
an essential role. Within this formalism, we present an ab-initio calculation
of energies and decay widths of unstable nuclei starting from realistic
interactions.Comment: 4 pages, revtex
Cubulating hyperbolic free-by-cyclic groups: the general case
Let be an automorphism of the finite-rank free group
. Suppose that is word-hyperbolic. Then acts
freely and cocompactly on a CAT(0) cube complex.Comment: 36 pages, 11 figures. Version 2 contains minor corrections. Accepted
to GAF
Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
The hypergraph duality problem DUAL is defined as follows: given two simple
hypergraphs and , decide whether
consists precisely of all minimal transversals of (in which case
we say that is the dual of ). This problem is
equivalent to deciding whether two given non-redundant monotone DNFs are dual.
It is known that non-DUAL, the complementary problem to DUAL, is in
, where
denotes the complexity class of all problems that after a nondeterministic
guess of bits can be decided (checked) within complexity class
. It was conjectured that non-DUAL is in . In this paper we prove this conjecture and actually
place the non-DUAL problem into the complexity class which is a subclass of . We here refer to the logtime-uniform version of
, which corresponds to , i.e., first order
logic augmented by counting quantifiers. We achieve the latter bound in two
steps. First, based on existing problem decomposition methods, we develop a new
nondeterministic algorithm for non-DUAL that requires to guess
bits. We then proceed by a logical analysis of this algorithm, allowing us to
formulate its deterministic part in . From this result, by
the well known inclusion , it follows
that DUAL belongs also to . Finally, by exploiting
the principles on which the proposed nondeterministic algorithm is based, we
devise a deterministic algorithm that, given two hypergraphs and
, computes in quadratic logspace a transversal of
missing in .Comment: Restructured the presentation in order to be the extended version of
a paper that will shortly appear in SIAM Journal on Computin
- …