arXiv research

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

We construct a function of the edge-lengths of a triangulated surface whose variation under a rescaling of all the edges that meet at a vertex is the defect angle at that vertex. We interpret this function as a gravitational effective action on the triangulation, and the variation as a trace anomaly.

The paper studies graph products of groups and recovers graph and vertex groups under certain conditions.

Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.

This paper characterizes a specific type of twisted Artin groups embedded in knot groups.

Study shows RAAG automorphisms and outer automorphisms are not relatively hyperbolic.

The existence of a balanced vertex is proven for geodesic nets with three boundary vertices.

Fixed angles of convex polygons lead to combinatorially rich polytopes.

Sharp inequalities for curved surfaces and cones.

We study the 3-dimensional combinatorial Yamabe flow in hyperbolic background geometry. For a triangulation of a 3-manifold, we prove that if the number of tetrahedra incident to each vertex is at least 23, then there exist real or virtual ball packings with vanishing (extended) combinatorial scalar curvature, i.e. the…

We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with …

We generalise work of Young-Eun Choi to the setting of ideal triangulations with vertex links of arbitrary genus, showing that the set of all (possibly incomplete) hyperbolic cone-manifold structures realised by positively oriented hyperbolic ideal tetrahedra on a given topological ideal triangulation and with prescrib…

A single-vertex origami is a piece of paper with straight-line rays called creases emanating from a fold vertex placed in its interior or on its boundary. The Single-Vertex Origami Flattening problem asks whether it is always possible to reconfigure the creased paper from any configuration compatible with the metric, t…

Study rigidity and volume optimization of hyperbolic polyhedra.

We propose an approach to find constant curvature metrics on triangulated closed 3-manifolds using a finite dimensional variational method whose energy function is the volume. The concept of an angle structure on a tetrahedron and on a triangulated closed 3-manifold is introduced following the work of Casson, Murakami …

Study laws of cosines and sines for hyperbolic shapes with ideal vertices.

Let $P$ be a simple polytope of dimension $n$ with $m$ facets and $P_{v}$ be a polytope obtained from $P$ by cutting off one vertex $v$. Let $Z=Z(P)$ and $Z_{v}=Z(P_{v})$ be the corresponding moment-angle manifolds. In \cite{[GL]} S.Gitler and S.López conjectured that: $Z_{v}$ is diffeomorphic to $\partial[(Z-int(D^{n+…

Study proves minimality of certain hyperplane intersections in wide cones.

A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of orthoschemes is known in hyperbolic geometry. Roughly speaking, complete orthosche…

Associated to any finite flag complex L there is a right-angled Coxeter group W_L and a contractible cubical complex Sigma_L (the Davis complex) on which W_L acts properly and cocompactly, and such that the link of each vertex is L. It follows that if L is a generalized homology sphere, then Sigma_L is a contractible h…

Geodesic loops on tetrahedra are studied in spherical and hyperbolic spaces.

We introduce a smooth quadratic conformal functional and its weighted version $W_2=\sum_e β^2(e)\quad W_{2,w}=\sum_e (n_i+n_j)β^2(e),$ where $β(e)$ is the extrinsic intersection angle of the circumcircles of the triangles of the mesh sharing the edge $e=(ij)$ and $n_i$ is the valence of vertex $i$. Besides minimizing…

The space of shapes of a polyhedron with given total angles less than 2πat each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take place a finite distance from a nonsingular point. The metric completion is a comple…

Given a triangulation of a closed surface, we consider a cross ratio system that assigns a complex number to every edge satisfying certain polynomial equations per vertex. Every cross ratio system induces a complex projective structure together with a circle pattern on the closed surface. In particular, there is an ass…

An embedded cubic graph consisting of segments of geodesics such that the angles at any vertex are equal to $2π/3$ is a closed local minimal net. This net is regular if all segments of geodesics are equal. The problem of classification of closed local minimal nets on surfaces of constant negative curvature has been for…

Uniform drift estimates found for random walks on graph products.

Vertex distortion detects if a knot is unknot.

Associated to any finite flag complex L there is a right-angled Coxeter group W_L and a cubical complex Σ_L on which W_L acts properly and cocompactly. Its two most salient features are that (1) the link of each vertex of Σ_L is L and (2) Σ_L is contractible. It follows that if L is a triangulation of S^{n-1}, then Σ_L…

The study finds the bounds of vertex orbits in maps derived from specific lattices.

The level set of an elliptic function is a doubly periodic point set in C. To obtain a wider spectrum of point sets, we consider, more generally, a Riemann surface S immersed in C^2 and its sections (``cuts'') by C. We give S a crystallographic isometry in C^2 by defining a fundamental surface element as a conformal ma…

Given a vertex of interest in a network $G_1$, the vertex nomination problem seeks to find the corresponding vertex of interest (if it exists) in a second network $G_2$. A vertex nomination scheme produces a list of the vertices in $G_2$, ranked according to how likely they are judged to be the corresponding vertex of …

Let I(p,v) be Bourdon's building, the unique simply-connected 2-complex such that all 2-cells are regular right-angled hyperbolic p-gons and the link at each vertex is the complete bipartite graph K(v,v). We investigate and mostly determine the set of triples (p,v,g) for which there exists a uniform lattice Γ in Aut(I(…

634 vertex-transitive and over 10^103 non-vertex-transitive 27-vertex triangulations of octonionic projective plane.

The paper proves a theorem for discretizing Gaussian curvature on surfaces.

This paper shows semi-equivelar toroidal maps are vertex-transitive covers.

Defines formal vertex laws related to Lie conformal algebras.

Quasi-vertex-transitive maps are the homogeneous maps on the plane with finitely many vertex orbits under the action of their automorphism groups. We show that there exist quasi-vertex-transitive maps of types $[p^3, 3]$ for $p \equiv 1$ (mod $6$), but there doesn't exist vertex-transitive map of such types. In particu…

The study examines vertices in curves with singular points in the Euclidean plane.

The topology of the intersection of two real homogeneous coaxial quadrics was studied by the second author who showed that its intersection with the unit sphere is in most cases diffeomorphic to a connected sum of sphere products. Combining that approach with a recent one (due to Antony Bahri, Martin Bendersky, Fred Co…

Vertex distortion measures how far lattice knots deviate from straight lines.

For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension. In this paper, w…

We prove that there exists a geodesic trajectory on the dodecahedron from a vertex to itself that does not pass through any other vertex.

New proof for global rigidity of vertex scaling on polyhedral surfaces.

Proves a generalized Whitehead cut vertex lemma for tree groups.

Study finds geodesic networks for surfaces with convex boundary.

Solves Skopenkov's problem on graph embedding criteria.

A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons surrounding the vertex. We determine combinatorial criteria for the existence, …

In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of…