3,235 research outputs found
An exact solution on the ferromagnetic Face-Cubic spin model on a Bethe lattice
The lattice spin model with --component discrete spin variables restricted
to have orientations orthogonal to the faces of -dimensional hypercube is
considered on the Bethe lattice, the recursive graph which contains no cycles.
The partition function of the model with dipole--dipole and
quadrupole--quadrupole interaction for arbitrary planar graph is presented in
terms of double graph expansions. The latter is calculated exactly in case of
trees. The system of two recurrent relations which allows to calculate all
thermodynamic characteristics of the model is obtained. The correspondence
between thermodynamic phases and different types of fixed points of the RR is
established. Using the technique of simple iterations the plots of the zero
field magnetization and quadrupolar moment are obtained. Analyzing the regions
of stability of different types of fixed points of the system of recurrent
relations the phase diagrams of the model are plotted. For the phase
diagram of the model is found to have three tricritical points, whereas for there are one triple and one tricritical points.Comment: 20 pages, 7 figure
The Complexity of Routing with Few Collisions
We study the computational complexity of routing multiple objects through a
network in such a way that only few collisions occur: Given a graph with
two distinct terminal vertices and two positive integers and , the
question is whether one can connect the terminals by at least routes (e.g.
paths) such that at most edges are time-wise shared among them. We study
three types of routes: traverse each vertex at most once (paths), each edge at
most once (trails), or no such restrictions (walks). We prove that for paths
and trails the problem is NP-complete on undirected and directed graphs even if
is constant or the maximum vertex degree in the input graph is constant.
For walks, however, it is solvable in polynomial time on undirected graphs for
arbitrary and on directed graphs if is constant. We additionally study
for all route types a variant of the problem where the maximum length of a
route is restricted by some given upper bound. We prove that this
length-restricted variant has the same complexity classification with respect
to paths and trails, but for walks it becomes NP-complete on undirected graphs
Visibility Representations of Boxes in 2.5 Dimensions
We initiate the study of 2.5D box visibility representations (2.5D-BR) where
vertices are mapped to 3D boxes having the bottom face in the plane and
edges are unobstructed lines of sight parallel to the - or -axis. We
prove that: Every complete bipartite graph admits a 2.5D-BR; The
complete graph admits a 2.5D-BR if and only if ; Every
graph with pathwidth at most admits a 2.5D-BR, which can be computed in
linear time. We then turn our attention to 2.5D grid box representations
(2.5D-GBR) which are 2.5D-BRs such that the bottom face of every box is a unit
square at integer coordinates. We show that an -vertex graph that admits a
2.5D-GBR has at most edges and this bound is tight. Finally,
we prove that deciding whether a given graph admits a 2.5D-GBR with a given
footprint is NP-complete. The footprint of a 2.5D-BR is the set of
bottom faces of the boxes in .Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
- …