Related papers: The Edge Geometry of Regular Polygons -- Part 1
In 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of…
For spacelike stationary (i.e. zero mean curvature) surfaces in 4-dimensional Lorentz space one can naturally introduce two Gauss maps and Weierstrass representation. In this paper we investigate their global geometry systematically. The…
We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d…
A parametric manifold can be viewed as the manifold of orbits of a (regular) foliation of a manifold by means of a family of curves. If the foliation is hypersurface orthogonal, the parametric manifold is equivalent to the 1-parameter…
We give a review of the systematic construction of hierarchies of soliton flows and integrable elliptic equations associated to a complex semi-simple Lie algebra and finite order automorphisms. For example, the non-linear Schr\"odinger…
The edge-reconstruction number of graph $G$, denoted $ern(G)$,is the size of the smallest multiset of edge-deleted, unlabeled subgraphs of $G$, from which the structure of $G$ can be uniquely determined. That there was some connection…
Given a set $A$ of $n$ points (vertices) in general position in the plane, the \emph{complete geometric graph} $K_n[A]$ consists of all $\binom{n}{2}$ segments (edges) between the elements of $A$. It is known that the edge set of every…
We investigate the geometry of the matrix model associated with an N=1 super Yang-Mills theory with three adjoint fields, which is a massive deformation of N=4. We study in particular the Riemann surface underlying solutions with arbitrary…
A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…
For a large class of 3-manifolds with taut foliations, we construct an action of $\pi_1(M)$ on $\mathbb{R}$ by orientation preserving homeomorphisms which captures the transverse geometry of the leaves. This action is complementary to…
A regular graph $G = (V,E)$ is an $(\varepsilon,\gamma)$ small-set expander if for any set of vertices of fractional size at most $\varepsilon$, at least $\gamma$ of the edges that are adjacent to it go outside. In this paper, we give a…
Little is known about the global structure of the basins of attraction of Newton's method in two or more complex variables. We make the first steps by focusing on the specific Newton mapping to solve for the common roots of $P(x,y) =…
We define higher quantum Airy structures as generalizations of the Kontsevich-Soibelman quantum Airy structures by allowing differential operators of arbitrary order (instead of only quadratic). We construct many classes of examples of…
The present paper describes the $W$--geometry of the Abelian finite non-periodic (conformal) Toda systems associated with the $B,C$ and $D$ series of the simple Lie algebras endowed with the canonical gradation. The principal tool here is a…
We propose new parameters to describe the geometry of a warped disc when viewed edge-on, a global warp parameter $w$, and a family of three parameters $A$, $B$ and $C$ that describe, independently, the shape of the warp. These parameters…
The notion of the Yau sequence was introduced by Tomaru, as an attempt to extend Yau's elliptic sequence for (weakly) elliptic singularities to normal surface singularities of higher fundamental genera. In this paper, we obtain the…
We develop an invariant local theory of Lorentz surfaces in pseudo-Euclidean 4-space by use of a linear map of Weingarten type. We find a geometrically determined moving frame field at each point of the surface and obtain a system of…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…
We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving constant bounded distortions. The model builds networks with both number of vertices and size…