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,657 papers · 148 categories

Trend · papers per month

10203040 · May 202619922001200920172026
48 results for triangle counting

New surgery exact triangles in Heegaard Floer homology for rational slopes.

problem Constructing new surgery exact triangles in Heegaard Floer homology.
method Combining combinatorial triangle and quadrilateral counting in genus 1 Heegaard diagrams.
result Solving the combinatorial problem for rational slopes, including tricky cases.

Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two possible 4-node graphlets. The number of each graphlet, called graphlet count, i…

2018-10-07abs ↗pdf ↗

We consider the problem of the combinatorial computation of the first Chern class of a circle bundle. N.Mnev found such a formula in terms of canonical shellings. It represents certain invariant of a triangulation computed by analyzing cyclic word in 3-character alphabet associated to the bundle. This curvature is a ki…

2017-12-08abs ↗pdf ↗

We construct a spectral sequence from the reduced odd Khovanov homology of a link converging to the framed instanton homology of the double cover branched over the link, with orientation reversed. Framed instanton homology counts certain instantons on the cylinder of a 3-manifold connect-summed with a 3-torus. En route…

2014-01-09abs ↗pdf ↗

This is an expository paper designed to introduce undergraduates to the Atiyah-Singer index theorem 50 years after its announcement. It includes motivation, a statement of the theorem, an outline of the easy part of the heat equation proof. It includes counting lattice points and knot concordance as applications.

2013-01-02abs ↗pdf ↗

We show that the bordered-sutured Floer invariant of the complement of a tangle in an arbitrary 3-manifold YY, with minimal conditions on the bordered-sutured structure, satisfies an unoriented skein exact triangle. This generalizes a theorem by Manolescu for links in S3S^3. We give a theoretical proof of this result …

2018-10-31abs ↗pdf ↗

To capture the inherent geometric features of many community detection problems, we propose to use a new random graph model of communities that we call a Geometric Block Model. The geometric block model generalizes the random geometric graphs in the same way that the well-studied stochastic block model generalizes the …

2017-09-16abs ↗pdf ↗

Exploratory analysis over network data is often limited by the ability to efficiently calculate graph statistics, which can provide a model-free understanding of the macroscopic properties of a network. We introduce a framework for estimating the graphlet count---the number of occurrences of a small subgraph motif (e.g…

2018-02-23abs ↗pdf ↗

This is the first in a series of papers exploring the relationship between the Rohlin invariant and gauge theory. We discuss the Casson-type invariant of a 3-manifold with the integral homology of a torus, given by counting projectively flat connections. We show that its mod 2 evaluation is given by the triple cup prod…

2003-02-11abs ↗pdf ↗

odeN efficiently approximates multiple temporal motifs in large networks.

problem Efficiently counting multiple temporal motifs in large temporal networks.
method odeN is a sampling-based algorithm that provides accurate probabilistic approximations of motif counts.
result odeN provides accurate approximations of motif counts in a fraction of the time needed by state-of-the-art methods.

We show a connection between a surgery exact sequence in knot Floer homology and the sequence derived in [18]. As a consequence of this relationship we see that the exact sequence in [18] also works with coherent orientations and admits refinements with respect to spinc-structures. As an application of this discussion,…

2010-02-22abs ↗pdf ↗

Stochastic Kronecker graphs supply a parsimonious model for large sparse real world graphs. They can specify the distribution of a large random graph using only three or four parameters. Those parameters have however proved difficult to choose in specific applications. This article looks at method of moments estimators…

2011-06-08abs ↗pdf ↗

Lipshitz, Ozsváth and Thurston defined a bordered Heegaard Floer invariant CFDA for 3-manifolds with two boundary components, including mapping cylinders for surface diffeomorphisms. We define a related invariant for certain 4-dimensional cobordisms with corners, by associating a morphism F from CFDA(f) to CFDA(g) to e…

2013-10-13abs ↗pdf ↗

New bounds on inscribed triangles in arbitrary planar domains.

problem Finding inscribed triangles in arbitrary planar domains with specific angle constraints.
method Proving the existence of uniformly fat triangles and not-too-fat triangles in bounded open sets.
result Existence of a maximal number Θ (between 0 and 60) for inscribed triangles with angles ≥ Θ degrees.

Paper calculates eigenvalues of a specific triangle on a sphere.

problem Computing eigenvalues of a specific triangle on a sphere.
method Computed first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2) on the sphere.
result Computed the first two Dirichlet eigenvalues and eigenfunctions of the equilateral Schwarz triangle (3/2 3/2 3/2).

Study on Laplacian determinant in isosceles triangles, finding equilateral triangle minimizes determinant.

problem Finding the minimum of the spectral determinant on isosceles triangles.
method Analyzing the determinant of the Laplacian on Euclidean isosceles triangle envelopes of fixed area.
result Equilateral triangle envelope minimizes the determinant of the Laplacian.

CSNE embeds signed networks by separating structural and fine-grained information.

problem Improving sign prediction in signed networks using inaccurate or incomplete balance theories.
method Conditional Signed Network Embedding (CSNE) models structural and fine-grained information separately, integrating them rigorously.
result CSNE outperforms state-of-the-art on sign prediction tasks, and MaxEnt priors are competitive in resource-constrained settings.

Complex hyperbolic triangle groups were first considered by Mostow in building the first nonarithmetic lattices in PU(2, 1). They are a natural generalization of the classical triangle groups acting on the hyperbolic plane. A well-known theorem of Takeuchi is that there are only finitely many Fuchsian triangle groups t…

2011-09-12abs ↗pdf ↗

The study counts triangulations of a projective plane with specific vertex valencies.

problem Counting triangulations of a projective plane with unique vertex valencies.
method Analyzes the growth of triangulations with no more than n triangles, using complex mathematical functions and series.
result The number of triangulations grows as C·n^2 + O(n^3/2) with C ≈ 0.2087432125056015.

Study calculates eigenvalues and eigenfunctions for spherical triangles and finds fundamental gap behavior.

problem Understanding eigenvalues and gaps in spherical triangles.
method Explicit computation of Dirichlet eigenvalues and eigenfunctions for spherical lunes and triangles.
result Fundamental gap of spherical triangles increases as the angle of the lune decreases.

We show that the triangle with angles Pi/12, Pi/3 and 7*Pi/12 has the lattice property and compute this triangle's Veech group.

2011-07-25abs ↗pdf ↗

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the side-lengths of a triangle in X. We construct an example of a complete path metr…

2006-11-06abs ↗pdf ↗

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

2019-08-11abs ↗pdf ↗

New method proves mateability of triangle groups with Blaschke products.

problem Proving mateability of triangle groups with Blaschke products.
method Associating two piecewise analytic circle maps to the triangle group, mating these with Blaschke products, and constructing a common lift.
result Proves mateability of all cusped triangle groups with suitable Blaschke products.

In this paper we study the area of ideals triangles in a convex domain with its Hilbert geometry. We obtain a characterization of the hyperbolic geometry among all the Hilbert geometry in terms of area of ideals triangles. We also obtain a sharp lower bound on the hilbert area of ideal triangles, independant of the con…

2003-12-08abs ↗pdf ↗

In Lorentzian geometry, limited definition of angles restricts the use of angle bisectors in study of triangles. This paper redefines angle bisectors so that they can be used to study attributes of triangles. Using the new definition, this paper investigates the existence of the incenter and the isogonal conjugate of a…

2014-04-24abs ↗pdf ↗

Study stabilizers of complex hyperbolic triangle groups, finding generators and signatures.

problem Understanding the stabilizers of complex hyperbolic triangle groups.
method Explicit generators and signatures of stabilizers computed for each group orbit of mirrors.
result Explicit generators and signatures of stabilizers for some triangle groups.

Criterion for stopping conjugacy class enumeration in triangle groups.

problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.

The paper finds extremum values for mixed Laplacian eigenvalues on triangles and trapezoids.

problem Finding extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.
method Characterizations obtained under suitable geometric constraints.
result Characterizations of extremum values for mixed eigenvalues of the Laplacian on triangles and trapezoids.

Study of subgroups in complex hyperbolic lattice triangle groups.

problem Characterizing subgroups of finite index in complex hyperbolic lattice triangle groups.
method Explicit construction and analysis of subgroups, examination of their properties.
result Identification of neat subgroups, subgroups with positive first Betti number, and homomorphisms onto non-Abelian free groups.

Study orbits in right triangles, deducing periodic billiard paths and classifying orbit closures.

problem Understanding periodic billiard paths in right triangles and orbit closures in strata of Abelian and quadratic differentials.
method Classifying orbit closures of rank at least two in hyperelliptic components of strata of Abelian and quadratic differentials.
result Computed orbit closures and deduced asymptotic number of periodic billiard trajectories in right triangles.