3,055 research outputs found
Approximation of conformal mappings by circle patterns
A circle pattern is a configuration of circles in the plane whose
combinatorics is given by a planar graph G such that to each vertex of G
corresponds a circle. If two vertices are connected by an edge in G, the
corresponding circles intersect with an intersection angle in .
Two sequences of circle patterns are employed to approximate a given
conformal map and its first derivative. For the domain of we use
embedded circle patterns where all circles have the same radius decreasing to 0
and which have uniformly bounded intersection angles. The image circle patterns
have the same combinatorics and intersection angles and are determined from
boundary conditions (radii or angles) according to the values of (
or ). For quasicrystallic circle patterns the convergence result is
strengthened to -convergence on compact subsets.Comment: 36 pages, 7 figure
A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
The clustered planarity problem (c-planarity) asks whether a hierarchically
clustered graph admits a planar drawing such that the clusters can be nicely
represented by regions. We introduce the cd-tree data structure and give a new
characterization of c-planarity. It leads to efficient algorithms for
c-planarity testing in the following cases. (i) Every cluster and every
co-cluster (complement of a cluster) has at most two connected components. (ii)
Every cluster has at most five outgoing edges.
Moreover, the cd-tree reveals interesting connections between c-planarity and
planarity with constraints on the order of edges around vertices. On one hand,
this gives rise to a bunch of new open problems related to c-planarity, on the
other hand it provides a new perspective on previous results.Comment: 17 pages, 2 figure
Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups
We prove by explicit construction that graph braid groups and most surface
groups can be embedded in a natural way in right-angled Artin groups, and we
point out some consequences of these embedding results. We also show that every
right-angled Artin group can be embedded in a pure surface braid group. On the
other hand, by generalising to right-angled Artin groups a result of Lyndon for
free groups, we show that the Euler characteristic -1 surface group (given by
the relation x^2y^2=z^2) never embeds in a right-angled Artin group.Comment: Published by Algebraic and Geometric Topology at
http://www.maths.warwick.ac.uk/agt/AGTVol4/agt-4-22.abs.htm
The vertex-transitive TLF-planar graphs
We consider the class of the topologically locally finite (in short TLF)
planar vertex-transitive graphs, a class containing in particular all the
one-ended planar Cayley graphs and the normal transitive tilings. We
characterize these graphs with a finite local representation and a special kind
of finite state automaton named labeling scheme. As a result, we are able to
enumerate and describe all TLF-planar vertex-transitive graphs of any given
degree. Also, we are able decide to whether any TLF-planar transitive graph is
Cayley or not.Comment: Article : 23 pages, 15 figures Appendix : 13 pages, 72 figures
Submitted to Discrete Mathematics The appendix is accessible at
http://www.labri.fr/~renault/research/research.htm
Surface embedding, topology and dualization for spin networks
Spin networks are graphs derived from 3nj symbols of angular momentum. The
surface embedding, the topology and dualization of these networks are
considered. Embeddings into compact surfaces include the orientable sphere S^2
and the torus T, and the not orientable projective space P^2 and Klein's bottle
K. Two families of 3nj graphs admit embeddings of minimal genus into S^2 and
P^2. Their dual 2-skeletons are shown to be triangulations of these surfaces.Comment: LaTeX 17 pages, 6 eps figures (late submission to arxiv.org
- …