643 research outputs found
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes
The -dimensional hypercube network is one of the most popular
interconnection networks since it has simple structure and is easy to
implement. The -dimensional locally twisted cube, denoted by , an
important variation of the hypercube, has the same number of nodes and the same
number of connections per node as . One advantage of is that the
diameter is only about half of the diameter of . Recently, some
interesting properties of were investigated. In this paper, we
construct two edge-disjoint Hamiltonian cycles in the locally twisted cube
, for any integer . The presence of two edge-disjoint
Hamiltonian cycles provides an advantage when implementing algorithms that
require a ring structure by allowing message traffic to be spread evenly across
the locally twisted cube.Comment: 7 pages, 4 figure
On embeddings of CAT(0) cube complexes into products of trees
We prove that the contact graph of a 2-dimensional CAT(0) cube complex of maximum degree can be coloured with at most
colours, for a fixed constant . This implies
that (and the associated median graph) isometrically embeds in the
Cartesian product of at most trees, and that the event
structure whose domain is admits a nice labeling with
labels. On the other hand, we present an example of a
5-dimensional CAT(0) cube complex with uniformly bounded degrees of 0-cubes
which cannot be embedded into a Cartesian product of a finite number of trees.
This answers in the negative a question raised independently by F. Haglund, G.
Niblo, M. Sageev, and the first author of this paper.Comment: Some small corrections; main change is a correction of the
computation of the bounds in Theorem 1. Some figures repaire
Combinatorics and geometry of finite and infinite squaregraphs
Squaregraphs were originally defined as finite plane graphs in which all
inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e.,
the vertices not incident with the outer face) have degrees larger than three.
The planar dual of a finite squaregraph is determined by a triangle-free chord
diagram of the unit disk, which could alternatively be viewed as a
triangle-free line arrangement in the hyperbolic plane. This representation
carries over to infinite plane graphs with finite vertex degrees in which the
balls are finite squaregraphs. Algebraically, finite squaregraphs are median
graphs for which the duals are finite circular split systems. Hence
squaregraphs are at the crosspoint of two dualities, an algebraic and a
geometric one, and thus lend themselves to several combinatorial
interpretations and structural characterizations. With these and the
5-colorability theorem for circle graphs at hand, we prove that every
squaregraph can be isometrically embedded into the Cartesian product of five
trees. This embedding result can also be extended to the infinite case without
reference to an embedding in the plane and without any cardinality restriction
when formulated for median graphs free of cubes and further finite
obstructions. Further, we exhibit a class of squaregraphs that can be embedded
into the product of three trees and we characterize those squaregraphs that are
embeddable into the product of just two trees. Finally, finite squaregraphs
enjoy a number of algorithmic features that do not extend to arbitrary median
graphs. For instance, we show that median-generating sets of finite
squaregraphs can be computed in polynomial time, whereas, not unexpectedly, the
corresponding problem for median graphs turns out to be NP-hard.Comment: 46 pages, 14 figure
On several varieties of cacti and their relations
Motivated by string topology and the arc operad, we introduce the notion of
quasi-operads and consider four (quasi)-operads which are different varieties
of the operad of cacti. These are cacti without local zeros (or spines) and
cacti proper as well as both varieties with fixed constant size one of the
constituting loops. Using the recognition principle of Fiedorowicz, we prove
that spineless cacti are equivalent as operads to the little discs operad. It
turns out that in terms of spineless cacti Cohen's Gerstenhaber structure and
Fiedorowicz' braided operad structure are given by the same explicit chains. We
also prove that spineless cacti and cacti are homotopy equivalent to their
normalized versions as quasi-operads by showing that both types of cacti are
semi-direct products of the quasi-operad of their normalized versions with a
re-scaling operad based on R>0. Furthermore, we introduce the notion of
bi-crossed products of quasi-operads and show that the cacti proper are a
bi-crossed product of the operad of cacti without spines and the operad based
on the monoid given by the circle group S^1. We also prove that this particular
bi-crossed operad product is homotopy equivalent to the semi-direct product of
the spineless cacti with the group S^1. This implies that cacti are equivalent
to the framed little discs operad. These results lead to new CW models for the
little discs and the framed little discs operad.Comment: Published by Algebraic and Geometric Topology at
http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-13.abs.htm
- …