11,906 research outputs found
Integrable lattices and their sublattices II. From the B-quadrilateral lattice to the self-adjoint schemes on the triangular and the honeycomb lattices
An integrable self-adjoint 7-point scheme on the triangular lattice and an
integrable self-adjoint scheme on the honeycomb lattice are studied using the
sublattice approach. The star-triangle relation between these systems is
introduced, and the Darboux transformations for both linear problems from the
Moutard transformation of the B-(Moutard) quadrilateral lattice are obtained. A
geometric interpretation of the Laplace transformations of the self-adjoint
7-point scheme is given and the corresponding novel integrable discrete 3D
system is constructed.Comment: 15 pages, 6 figures; references added, some typos correcte
No finite -regular matchstick graph exists
A graph is called a unit-distance graph in the plane if there is an
injective embedding of in the plane such that every pair of adjacent
vertices are at unit distance apart. If additionally the corresponding edges
are non-crossing and all vertices have the same degree we talk of a regular
matchstick graph. Due to Euler's polyhedron formula we have . The
smallest known -regular matchstick graph is the so called Harborth graph
consisting of vertices. In this article we prove that no finite
-regular matchstick graph exists.Comment: 15 pages, 12 figures, 2 table
Transversal structures on triangulations: a combinatorial study and straight-line drawings
This article focuses on a combinatorial structure specific to triangulated
plane graphs with quadrangular outer face and no separating triangle, which are
called irreducible triangulations. The structure has been introduced by Xin He
under the name of regular edge-labelling and consists of two bipolar
orientations that are transversal. For this reason, the terminology used here
is that of transversal structures. The main results obtained in the article are
a bijection between irreducible triangulations and ternary trees, and a
straight-line drawing algorithm for irreducible triangulations. For a random
irreducible triangulation with vertices, the grid size of the drawing is
asymptotically with high probability up to an additive
error of \cO(\sqrt{n}). In contrast, the best previously known algorithm for
these triangulations only guarantees a grid size .Comment: 42 pages, the second version is shorter, focusing on the bijection
(with application to counting) and on the graph drawing algorithm. The title
has been slightly change
The critical Ising model via Kac-Ward matrices
The Kac-Ward formula allows to compute the Ising partition function on any
finite graph G from the determinant of 2^{2g} matrices, where g is the genus of
a surface in which G embeds. We show that in the case of isoradially embedded
graphs with critical weights, these determinants have quite remarkable
properties. First of all, they satisfy some generalized Kramers-Wannier
duality: there is an explicit equality relating the determinants associated to
a graph and to its dual graph. Also, they are proportional to the determinants
of the discrete critical Laplacians on the graph G, exactly when the genus g is
zero or one. Finally, they share several formal properties with the Ray-Singer
\bar\partial-torsions of the Riemann surface in which G embeds.Comment: 30 pages, 10 figures; added section 4.4 in version
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
We study two variants of the well-known orthogonal drawing model: (i) the
smooth orthogonal, and (ii) the octilinear. Both models form an extension of
the orthogonal, by supporting one additional type of edge segments (circular
arcs and diagonal segments, respectively).
For planar graphs of max-degree 4, we analyze relationships between the graph
classes that can be drawn bendless in the two models and we also prove
NP-hardness for a restricted version of the bendless drawing problem for both
models. For planar graphs of higher degree, we present an algorithm that
produces bi-monotone smooth orthogonal drawings with at most two segments per
edge, which also guarantees a linear number of edges with exactly one segment.Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
A Universal Point Set for 2-Outerplanar Graphs
A point set is universal for a class if
every graph of has a planar straight-line embedding on . It is
well-known that the integer grid is a quadratic-size universal point set for
planar graphs, while the existence of a sub-quadratic universal point set for
them is one of the most fascinating open problems in Graph Drawing. Motivated
by the fact that outerplanarity is a key property for the existence of small
universal point sets, we study 2-outerplanar graphs and provide for them a
universal point set of size .Comment: 23 pages, 11 figures, conference version at GD 201
The strong thirteen spheres problem
The thirteen spheres problem is asking if 13 equal size nonoverlapping
spheres in three dimensions can touch another sphere of the same size. This
problem was the subject of the famous discussion between Isaac Newton and David
Gregory in 1694. The problem was solved by Schutte and van der Waerden only in
1953.
A natural extension of this problem is the strong thirteen spheres problem
(or the Tammes problem for 13 points) which asks to find an arrangement and the
maximum radius of 13 equal size nonoverlapping spheres touching the unit
sphere. In the paper we give a solution of this long-standing open problem in
geometry. Our computer-assisted proof is based on a enumeration of the
so-called irreducible graphs.Comment: Modified lemma 2, 16 pages, 12 figures. Uploaded program packag
- âŠ