32,391 research outputs found
Irreducible complexity of iterated symmetric bimodal maps
We introduce a tree structure for the iterates of symmetric bimodal maps and
identify a subset which we prove to be isomorphic to the family of unimodal
maps. This subset is used as a second factor for a -product that we
define in the space of bimodal kneading sequences. Finally, we give some
properties for this product and study the *-product induced on the associated
Markov shifts
Black Holes in 2+1 Teleparallel Theories of Gravity
We apply the Hamiltonian formulation of teleparallel theories of gravity in
2+1 dimensions to a circularly symmetric geometry. We find a family of
one-parameter black hole solutions. The BTZ solution fixes the unique free
parameter of the theory. The resulting field equations coincide with the
teleparallel equivalent of Einstein's three-dimensional equations. We calculate
the gravitational energy of the black holes by means of the simple expression
that arises in the Hamiltonian formulation and conclude that the resulting
value is identical to that calculated by means of the Brown-York method.Comment: 20 pages, Latex file, no figure
Canonical Formulation of Gravitational Teleparallelism in 2+1 Dimensions in Schwinger's Time Gauge
We consider the most general class of teleparallel gravitational {}{}theories
quadratic in the torsion tensor, in three space-time dimensions, and carry out
a detailed investigation of its Hamiltonian formulation in Schwinger's time
gauge. This general class is given by a family of three-parameter theories. A
consistent implementation of the Legendre transform reduces the original theory
to a one-parameter family of theories. By calculating Poisson brackets we show
explicitly that the constraints of the theory constitute a first-class set.
Therefore the resulting theory is well defined with regard to time evolution.
The structure of the Hamiltonian theory rules out the existence of the
Newtonian limit.Comment: 17 pages, Latex file, no figures; a numerical coefficient has been
corrected and a different result is achieve
Dangling-bond spin relaxation and magnetic 1/f noise from the amorphous-semiconductor/oxide interface: Theory
We propose a model for magnetic noise based on spin-flips (not
electron-trapping) of paramagnetic dangling-bonds at the
amorphous-semiconductor/oxide interface. A wide distribution of spin-flip times
is derived from the single-phonon cross-relaxation mechanism for a
dangling-bond interacting with the tunneling two-level systems of the amorphous
interface. The temperature and frequency dependence is sensitive to three
energy scales: The dangling-bond spin Zeeman energy delta, as well as the
minimum (E_min) and maximum (E_max) values for the energy splittings of the
tunneling two-level systems. We compare and fit our model parameters to a
recent experiment probing spin coherence of antimony donors implanted in
nuclear-spin-free silicon [T. Schenkel {\it et al.}, Appl. Phys. Lett. 88,
112101 (2006)], and conclude that a dangling-bond area density of the order of
10^{14}cm^{-2} is consistent with the data. This enables the prediction of
single spin qubit coherence times as a function of the distance from the
interface and the dangling-bond area density in a real device structure. We
apply our theory to calculations of magnetic flux noise affecting SQUID devices
due to their Si/SiO_2 substrate. Our explicit estimates of flux noise in SQUIDs
lead to a noise spectral density of the order of 10^{-12}Phi_{0}^{2} {Hz}^{-1}
at f=1Hz. This value might explain the origin of flux noise in some SQUID
devices. Finally, we consider the suppression of these effects using surface
passivation with hydrogen, and the residual nuclear-spin noise resulting from a
perfect silicon-hydride surface.Comment: Final published versio
Heuristic Backtracking Algorithms for SAT
In recent years backtrack search SAT solvers have been the subject of dramatic improvements. These improvements allowed SAT solvers to successfully replace BDDs in many areas of formal verification, and also motivated the development of many new challenging problem instances, many of which too hard for the current generation of SAT solvers. As a result, further improvements to SAT technology are expected to have key consequences in formal verification. The objective of this paper is to propose heuristic approaches to the backtrack step of backtrack search SAT solvers, with the goal of increasing the ability of the SAT solver to search different parts of the search space. The proposed heuristics to the backtrack step are inspired by the heuristics proposed in recent years for the branching step of SAT solvers, namely VSIDS and some of its improvements. The preliminary experimental results are promising, and motivate the integration of heuristic backtracking in state-of-the-art SAT solvers. 1
- …