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

36912 · Nov 202019922001200920172026
48 results for hexagonal triangulation

In the paper, we consider the rigidity problem of the infinite hexagonal triangulation of the plane under the piecewise linear conformal changes introduced by Luo in [5]. Our result shows that if a geometric hexagonal triangulation of the plane is PL conformal to the regular hexagonal triangulation and all inner angles…

2013-06-16abs ↗pdf ↗

Proves rigidity of circle packings in the plane, generalizing previous work.

problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.

Paper proves rigidity of Doyle spirals in hexagonal lattice circle packings.

problem Proving Doyle conjecture for hexagonal lattice circle packings.
method Using Liouville theorem of discrete harmonic functions based on logarithmic radii ratio observation.
result Proves rigidity of Doyle spirals in hexagonal lattice circle packings with bounded radii ratios.

Study combinatorial Yamabe flow on infinite triangulated surfaces.

problem Solve discrete Yamabe problem on noncompact surfaces.
method Introduced and analyzed combinatorial Yamabe flow with short-time and long-time existence proofs.
result Established short-time and long-time existence of the flow, and proved convergence in hexagonal triangulations.

We show existence of centrally symmetric maps on surfaces all of whose faces are quadrangles and pentagons for each orientable genus g0g \geq 0. We also show existence of centrally symmetric maps on surfaces all of whose faces are hexagons for each orientable genus g=2k1g = 2k-1, kNk\in \mathbb{N}. We enumerate centrally …

2014-02-18abs ↗pdf ↗

The SU3SU_3-skein algebra of a surface FF is spanned by isotopy classes of certain framed graphs in F×IF\times I called 33-webs subject to the skein relations encapsulating relations between Uq(sl(3))U_q(sl(3))-representations. These skein algebras are quantizations of the SL(3)SL(3)-character varieties of surfaces. It is expect…

2020-02-17abs ↗pdf ↗

Classifies hexagonal circular 3-webs with cubic polar curves.

problem Classifying hexagonal circular 3-webs with algebraic polar curves of degree three.
method Analyzes hexagonal circular 3-webs on unit sphere with polar points on a twisted cubic.
result Completes the classification of hexagonal circular 3-webs with algebraic polar curves of degree three.

The paper proves convergence of discrete maps to Riemann mappings for polyhedral surfaces.

problem Discrete conformal geometry of polyhedral surfaces.
method Establishing rigidity for hexagonal triangulations and estimating quasiconformal constants.
result Discrete conformal maps converge to Riemann mappings for Jordan domains.

Study hexagonal network evolution under curvature flow.

problem Understanding hexagonal network evolution under curvature flow.
method Proved local existence of classical solutions and classified homothetically shrinking solutions.
result Provided an example of network shrinking to a segment with multiplicity two.

The study examines polyhedra with hexagonal and triangular faces, focusing on their 3-regular planar graphs.

problem Analyzing polyhedra with hexagonal and triangular faces and three faces around each vertex.
method Representing polyhedra as quotients of hexagonal tilings under isometries, using signatures to describe the arrangement of rotations, and establishing a bijection between trihexes and equivalence classes of signatures.
result A bijection between trihexes and equivalence classes of signatures, allowing bounds on the number of trihexes for a given number of vertices.

The theory of geometric structures on a surface with nonempty boundary can be developed by using a decomposition of such a surface into hexagons, in the same way as the theory of geometric structures on a surface without boundary is developed using the decomposition of such a surface into pairs of pants. The basic elem…

2012-09-30abs ↗pdf ↗

For a positive integer n3n\ge 3, the collection of nn-sided polygons embedded in 33-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded nn-sided polygons with unit length edges. Paths in this space determine isotopies of polygons, so path-components …

2018-10-28abs ↗pdf ↗

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.

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

We study the configuration space of equilateral and equiangular spatial hexagons for any bond angle by giving explicit expressions of all the possible shapes. We show that the chair configuration is isolated, whereas the boat configuration allows one-dimensional deformations which form a circle in the configuration spa…

2011-05-25abs ↗pdf ↗

We study the motion of discrete interfaces driven by ferromagnetic interactions on the two-dimensional triangular lattice by coupling the Almgren, Taylor and Wang minimizing movements approach and a discrete-to-continuum analysis, as introduced by Braides, Gelli and Novaga in the pioneering case of the square lattice. …

2018-06-30abs ↗pdf ↗

Hexagonal diagrams link complex curves in CP2\mathbb{CP}^2 to minimal genus surfaces.

problem Understanding the relationship between complex curves and surfaces in CP2\mathbb{CP}^2.
method Hexagonal lattice diagrams and trisection of CP2\mathbb{CP}^2.
result Positive genus surfaces in CP2\mathbb{CP}^2 are isotopic to complex curves if they admit hexagonal lattice diagrams.

There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves analogous to the domino flip move. The triple diagrams that result have connections to …

2004-05-25abs ↗pdf ↗

The paper studies how grid cell patterns emerge in neural networks.

problem Understanding how grid cells in the brain form hexagonal firing patterns.
method Training recurrent neural networks with conformal normalization of velocity inputs.
result Conformal normalization is crucial for the emergence of hexagonal grid patterns in neural networks.

We prove that a surface carries a hexagonal 3-web of geodesics if and only if the geodesic flow on the surface admits a cubic first integral and show that the system of partial differential equations, governing metrics on such surfaces, is integrable by generalized hodograph transform method. We present some new local …

2018-06-08abs ↗pdf ↗

The effectiveness of Convolutional Neural Networks stems in large part from their ability to exploit the translation invariance that is inherent in many learning problems. Recently, it was shown that CNNs can exploit other invariances, such as rotation invariance, by using group convolutions instead of planar convoluti…

2018-03-06abs ↗pdf ↗

It is known that every nontrivial knot has at least two quadrisecants. Given a knot, we mark each intersection point of each of its quadrisecants. Replacing each subarc between two nearby marked points with a straight line segment joining them, we obtain a polygonal closed curve which we will call the quadrisecant appr…

2010-10-14abs ↗pdf ↗

The paper analyzes how grid cells perform path integration and learns hexagon grid patterns.

problem Understanding how grid cells perform path integration calculations.
method Theoretical analysis of a general representation model of path integration by grid cells, identifying group representation and isotropic scaling conditions.
result The learned model of hexagon grid patterns is capable of accurate long distance path integration.

We prove that every spherical football (also known as a spherical soccer ball) is a branched cover, branched only in the vertices, of the standard football made up of 12 pentagons and 20 hexagons. We also give examples showing that the corresponding result is not true for footballs of higher genera. Moreover, we classi…

2006-06-08abs ↗pdf ↗

Drinfeld associator is a key tool in computing the Kontsevich integral of knots. A Drinfeld associator is a series in two non-commuting variables, satisfying highly complicated algebraic equations - hexagon and pentagon. The logarithm of a Drinfeld associator lives in the Lie algbera L generated by the symbols a,b,c mo…

2004-08-29abs ↗pdf ↗

A note on the uniqueness of differential characters and K-theory via homological algebra.

problem Existence and uniqueness of differential characters and differential K-theory.
method Observation and application of Rakesh Pawar's results in homological algebra.
result The hexagon diagram uniquely determines differential K-theory groups up to isomorphism.

Solutions of an implicit ODE form a web. Already for cubic ODEs the 3-web of solutions has a nontrivial local invariant, namely the curvature form. Thus any local classification of implicit ODEs necessarily has functional moduli if no restriction on the class of ODEs is imposed. Here the most symmetric case of hexagona…

2008-08-04abs ↗pdf ↗

We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there exists a sharp density threshold for Kazhdan's Property (T) and it equals 1/3. Ou…

2019-06-12abs ↗pdf ↗

Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.

problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.