Related papers: Regular maps of high density
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
We search for rational, four-dimensional maps of standard type (x_{n+1} - 2x_n + x_{n-1} = eps f(x,eps)) possessing one or two polynomial integrals. There are no non-trivial maps corresponding to cubic oscillators, but we find a…
We study the normal map for plane projective curves, i.e., the map associating to every regular point of the curve the normal line at the point in the dual space. We first observe that the normal map is always birational and then we use…
Szemer\'edi's Regularity Lemma is an important tool for analyzing the structure of dense graphs. There are versions of the Regularity Lemma for sparse graphs, but these only apply when the graph satisfies some local density condition. In…
An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to $2\pi/3$ is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of…
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
We develop a renormalization theory of non-perturbative dissipative H\'enon-like maps with combinatorics of bounded type. The main novelty of our approach is the incorporation of Pesin theoretic ideas to the renormalization method, which…
The relation between random normal matrices and conformal mappings discovered by Wiegmann and Zabrodin is made rigorous by restricting normal matrices to have spectrum in a bounded set. It is shown that for a suitable class of potentials…
Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
We define and study the regularity of distance maps on geodesically complete spaces with curvature bounded above. We prove that such a regular map is locally a Hurewicz fibration. This regularity can be regarded as a dual concept of…
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straight-line edges and assign each edge to a layer so that no two edges on the same layer cross. The…
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…
Learning maps between data samples is fundamental. Applications range from representation learning, image translation and generative modeling, to the estimation of spatial deformations. Such maps relate feature vectors, or map between…
In this paper, we are concerned with the problem of creating flattening maps of simply-connected open surfaces in $\mathbb{R}^3$. Using a natural principle of density diffusion in physics, we propose an effective algorithm for computing…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.