Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

3468101135 · Jun 202019922001200920172026
48 results for edge length

The paper provides conditions for realizing graphs and polytopes with specified edge lengths.

problem Proving the existence of planar embeddings or polyhedra with specified edge lengths.
method Practical sufficient conditions and software verification for non-self-intersecting perturbations of initial realizations.
result Existence of planar embeddings and polyhedra with specified edge lengths.

Researchers found the Wigner derivative and its inverse are equal for spherical tetrahedra.

problem Computing the relationship between dihedral angles and edge lengths in tetrahedra.
method Computed the Wigner derivative and its inverse for spherical tetrahedra.
result The Wigner derivative and its inverse are equal for spherical tetrahedra.

This note demonstrates how both the concept of distance and the concept of holonomy can be constructed from a suitable network with directed edges (and no lengths). The number of different edge types depends on the signature of the metric and the dimension of the holonomy group. If the holonomy group is of dimension on…

2009-02-13abs ↗pdf ↗

We show that if X is a minimal length carrier graph in a hyperbolic 3-manifold, M, then if X contains a sufficiently short edge, it must contain a short circuit, as well. The meaning of "short" depends only on the rank of the fundamental group of M. We also expand the class of manifolds which are known to have minimal …

2011-05-23abs ↗pdf ↗

Given a clover link, we construct a bottom tangle by using a disk/band surface of the clover link. Since the Milnor number is already defined for a bottom tangle, we define the Milnor number for the clover link to be the Milnor number for the bottom tangle and show that for a clover link, if Milnor numbers of length k …

2015-06-12abs ↗pdf ↗

Hyperideal tetrahedra are the fundamental building blocks of hyperbolic 3-manifolds with geodesic boundary. The study of their geometric properties (in particular, of their volume) has applications also in other areas of low-dimensional topology, like the computation of quantum invariants of 3-manifolds and the use of …

2018-01-16abs ↗pdf ↗

Polyhedra's structure is uniquely defined by edge lengths and dihedral angles, even nonconvex.

problem Determining the structure of polyhedra based on edge lengths and dihedral angles.
method Proved rigidity under specific conditions in Euclidean, hyperbolic, and spherical geometries.
result Polyhedra's structure is uniquely defined by edge lengths and dihedral angles, even nonconvex.

A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the configuration space of all planar realizations of a linkage (following work of K…

1998-07-04abs ↗pdf ↗

Characterizes metrics on triangulated surfaces using glued Euclidean triangles.

problem Describing metrics on triangulated surfaces constructed from glued Euclidean triangles.
method Carefully constructing polyhedral metrics and proving their uniqueness.
result Polyhedral metrics are the only intrinsic metrics preserving Euclidean triangle lengths.

Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an …

2000-08-03abs ↗pdf ↗

We show that any two geometric triangulations of a closed hyperbolic, spherical or Euclidean manifold are related by a sequence of Pachner moves and barycentric subdivisions of bounded length. This bound is in terms of the dimension of the manifold, the number of top dimensional simplexes and bound on the lengths of ed…

2019-02-06abs ↗pdf ↗

Kernel networks' stability edge linked to Fisher Information singularity.

problem Understanding the stability edge in high-capacity kernel Hopfield networks.
method Statistical manifold analysis and Riemannian geometry.
result The Ridge of Optimization corresponds to the Edge of Stability, revealing a dual equilibrium.

Critical nets in Rk\mathbb{R}^k (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices (leaves) have a fixed position. In contrast to what happens on generic manifolds, w…

2019-10-20abs ↗pdf ↗

In his PhD thesis, Abrams proved that, for a natural number n and a graph G with at least n vertices, the n-strand configuration space of G deformation retracts to a compact subspace, the discretized n-strand configuration space, provided G satisfies two conditions: each path between distinct essential vertices (vertic…

2009-09-30abs ↗pdf ↗

Fixed angles of convex polygons lead to combinatorially rich polytopes.

problem Understanding the structure of convex polygons with fixed vertex angles.
method Combining combinatorial and geometric approaches, including dual polytopes and Schwarz-Christoffel maps.
result Fixed-angles polytopes are dual to cyclic polytopes under certain conditions.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

problem Determining the stick number and edge length of knots in a hexagonal lattice.
method Introducing a linear transformation between lattices to prove strict inequalities and classifying knots.
result Only trefoil and figure-eight knots are 11-stick knots in the hexagonal lattice.

The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this paper, we classify the simplest case, which is the edge-to-edge tilings of the 2-d…

2010-09-13abs ↗pdf ↗

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.

2005-12-22abs ↗pdf ↗

We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued quadratic invariant bb on the space of those isometric deformations which, for conv…

2004-10-04abs ↗pdf ↗

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

problem Formulating trigonometric laws for shapes with ideal vertices in hyperbolic geometry.
method Using hyperboloid model and Lorentzian geometry, establishing laws for quadrilaterals, pentagons, and partially truncated tetrahedra.
result Transversal lengths of partially truncated tetrahedra depend only on internal edge lengths at ideal vertices.

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

We give a unified description of tetrahedra with lightlike faces in 3d anti-de Sitter, de Sitter and Minkowski spaces and of their duals in 3d anti-de Sitter, hyperbolic and half-pipe spaces. We show that both types of tetrahedra are determined by a generalized cross-ratio with values in a commutative 2d real algebra t…

2019-09-03abs ↗pdf ↗

Edge subdivision affects the Perron eigenvalue of tree Ricci matrices.

problem Understanding how edge subdivision impacts the Perron eigenvalue of tree Ricci matrices.
method Compressing branches into scalar feedback functions via Schur complement, reducing the spectral problem to a one-dimensional Chebyshev equation.
result Edge subdivision can decrease, preserve, or increase the Perron eigenvalue of tree Ricci matrices.

J.P. Levine introduced a clover link to investigate the indeterminacy of the Milnor invariants of a link. It is shown that for a clover link, the Milnor numbers of length at most 2k+12k+1 are well-defined if those of length at most kk vanish, and that the Milnor numbers of length at least 2k+22k+2 are not well-defined if …

2015-07-06abs ↗pdf ↗

The paper proves stability and convergence of minimal networks under curvature motion.

problem Stability and convergence of minimal networks under curvature motion.
method Proved Lojasiewicz-Simon gradient inequalities for minimal networks.
result Motion by curvature starting from networks close to minimal ones exists for all times and smoothly converges.

Paper studies weighted Fermat-Frechet problem for simplex edge lengths.

problem Finding optimal edge lengths for simplex deformations.
method Isometric embedding techniques for KK-Space.
result New variational method to solve weighted Fermat-Frechet problem.

This study explores how feature graphs enhance GNNs' performance in modeling interactions.

problem Improving GNNs' ability to model feature interactions effectively.
method Investigates feature graphs and their importance in GNNs, using experiments and theoretical support.
result Edges between interacting features are crucial for GNNs, while non-interaction edges can degrade performance.

Let XX be a compact, geodesically complete, locally CAT(0) space such that the universal cover admits a rank one axis. Assume XX is not homothetic to a metric graph with integer edge lengths. Let PtP_t be the number of parallel classes of oriented closed geodesics of length t\le t; then $\lim\limits_{t \to \infty} P…

2019-03-18abs ↗pdf ↗

First-passage percolation affects graph properties like curvature and geodesics.

problem Effect of first-passage percolation on graph curvature and geodesics.
method Randomly perturbs the metric of a graph by assigning random edge lengths.
result Non-positive curvature and geodesic properties are not preserved by first-passage percolation.

Let G be a group acting on a tree with cyclic edge and vertex stabilizers. Then stable commutator length (scl) is rational in G. Furthermore, scl varies predictably and converges to rational limits in so-called "surgery" families. This is a homological analog of the phenomenon of geometric convergence in hyperbolic Deh…

2019-04-17abs ↗pdf ↗

The topology of a power grid affects its dynamic operation and settlement in the electricity market. Real-time topology identification can enable faster control action following an emergency scenario like failure of a line. This article discusses a graphical model framework for topology estimation in bulk power grids (…

2017-07-05abs ↗pdf ↗

The complex of curves C(Sg)\mathcal{C}(S_g) of a closed orientable surface of genus g2g \geq 2 is the simplicial complex having its vertices, C0(Sg)\mathcal{C}^0(S_g), are isotopy classes of essential curves in SgS_g. Two vertices co-bound an edge of the 11-skeleton, C1(Sg)\mathcal{C}^1(S_g), if there are disjoint representative…

2014-08-18abs ↗pdf ↗

The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here we give a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic geom…

2019-03-12abs ↗pdf ↗