Related papers: Energy and length in a topological planar quadrila…
We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…
We establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is…
We show upper and lower bounds for angles in iterations of trisections of certain triangulations.
We prove a new lower bound for the number of pinned distances over finite fields: if $A$ is a sufficiently small subset of $\mathbb{F}_q^2$, then there is an element in $A$ that determines $\gg |A|^{2/3}$ distinct distances to other…
The existence of the weak limit as n --> infinity of the uniform measure on rooted triangulations of the sphere with n vertices is proved. Some properties of the limit are studied. In particular, the limit is a probability measure on random…
Using group theoretic and topological concepts, together with tunneling phenomena, we geometrically design interfacial wave networks that contain splitters which partition energy in 2, 3, 4 or 5 directions. This enriches the valleytronics…
We consider planar networks of three curves that meet at two junctions with prescribed equal angles, minimizing a combination of the elastic energy and the length functional. We prove existence and regularity of minimizers, and we show some…
We establish a lower bound for the energy of a complex unit gain graph in terms of the matching number of its underlying graph, and characterize all the complex unit gain graphs whose energy reaches this bound.
We provide universal formulae for the limiting stretching and bending energies of triangulated membrane networks endowed with nearest neighbor bond potentials and cosine-type dihedral angle potentials. The given formulae account for finite…
This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface…
(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of $n$ points in the plane is $O(1.7864^n)$. This improves an earlier upper bound of $O(1.8393^n)$; the current best lower bound is $\Omega(1.7003^n)$.…
Motivated by recent physics papers describing the formation of biological transport networks we study a discrete model proposed by Hu and Cai consisting of an energy consumption function constrained by a linear system on a graph. For the…
We propose a method of characterizing radial networks based on a partition function associated with the structural triangulation of the network. The internal energy, Helmholtz free energy, and entropy derived from the partition function are…
We consider a second order gradient flow of the p-elastic energy for a planar theta-network of three curves with fixed lengths. We construct a weak solution of the flow by means of an implicit variational scheme. We show long-time existence…
If there is a shortest length in nature, for example at the Planck scale of 10^-35m, then the cosmic expansion should continually create new comoving modes. A priori, each of the new modes comes with its own vacuum energy, which could…
Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and…
We show that if a closed $C^1$-smooth surface in a Riemannian manifold has bounded Kolasinski--Menger energy, then it can be triangulated with triangles whose number is bounded by the energy and the area. Each of the triangles is an image…
Among the several topological properties of complex networks, the shortest path represents a particularly important characteristic because of its potential impact not only on other topological properties, but mainly for its influence on…