32,218 research outputs found
Magnetoelastic Coupling in the Spin-Dimer System TlCuCl
We present high-resolution measurements of the thermal expansion and the
magnetostriction of TlCuCl which shows field-induced antiferromagnetic
order. We find pronounced anomalies in the field and temperature dependence of
different directions of the lattice signaling a large magnetoelastic coupling.
The phase boundary is extremely sensitive to pressure, e.g. the transition
field would change by about +/- 185$%/GPa under uniaxial pressure applied along
certain directions. This drastic effect can unambiguously be traced back to
changes of the intradimer coupling under uniaxial pressure. The interdimer
couplings remain essentially unchanged under pressure, but strongly change when
Tl is replaced by K.Comment: 4 pages with 4 figures include
Reconfiguration on sparse graphs
A vertex-subset graph problem Q defines which subsets of the vertices of an
input graph are feasible solutions. A reconfiguration variant of a
vertex-subset problem asks, given two feasible solutions S and T of size k,
whether it is possible to transform S into T by a sequence of vertex additions
and deletions such that each intermediate set is also a feasible solution of
size bounded by k. We study reconfiguration variants of two classical
vertex-subset problems, namely Independent Set and Dominating Set. We denote
the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete
on graphs of bounded bandwidth and W[1]-hard parameterized by k on general
graphs. We show that ISR is fixed-parameter tractable parameterized by k when
the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we
answer positively an open question concerning the parameterized complexity of
the problem on graphs of bounded treewidth. Moreover, our techniques generalize
recent results showing that ISR is fixed-parameter tractable on planar graphs
and graphs of bounded degree. For DSR, we show the problem fixed-parameter
tractable parameterized by k when the input graph does not contain large
bicliques, a class of graphs which includes graphs of bounded degeneracy and
nowhere-dense graphs
Computational methods for estimation of parameters in hyperbolic systems
Approximation techniques for estimating spatially varying coefficients and unknown boundary parameters in second order hyperbolic systems are discussed. Methods for state approximation (cubic splines, tau-Legendre) and approximation of function space parameters (interpolatory splines) are outlined and numerical findings for use of the resulting schemes in model "one dimensional seismic inversion' problems are summarized
The complexity of dominating set reconfiguration
Suppose that we are given two dominating sets and of a graph
whose cardinalities are at most a given threshold . Then, we are asked
whether there exists a sequence of dominating sets of between and
such that each dominating set in the sequence is of cardinality at most
and can be obtained from the previous one by either adding or deleting
exactly one vertex. This problem is known to be PSPACE-complete in general. In
this paper, we study the complexity of this decision problem from the viewpoint
of graph classes. We first prove that the problem remains PSPACE-complete even
for planar graphs, bounded bandwidth graphs, split graphs, and bipartite
graphs. We then give a general scheme to construct linear-time algorithms and
show that the problem can be solved in linear time for cographs, trees, and
interval graphs. Furthermore, for these tractable cases, we can obtain a
desired sequence such that the number of additions and deletions is bounded by
, where is the number of vertices in the input graph
- …