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

2356 · Sep 202019922001200920172026
48 results for right-angled hexagons

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 ↗

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.

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 ↗

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 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.

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.

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.

New discrete conformal structures on surfaces with boundary, proving global rigidity and constructing hyperbolic metrics.

problem Creating new discrete conformal structures on surfaces with boundary.
method Introducing new discrete conformal structures, proving global rigidity using variational principles, and introducing combinatorial curvature flows.
result Global rigidity of new discrete conformal structures and effective algorithms for constructing hyperbolic metrics.

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.

Surveying connections between graph combinatorics and algebraic right-angled Artin groups.

problem Understanding the relationship between graph structures and algebraic properties of right-angled Artin groups.
method Analyzing the defining and extension graphs of right-angled Artin groups.
result Discovers connections to geometric group theory and complexity theory.

In this paper we study the right-angled Coxeter groups that acts geometrically on the Salvetti complex of a certain right-angled Artin group, which we refer to as Croke-Kleiner spaces. We prove that any right-angled Coxeter group that acts geometrically on the Croke-Kleiner spaces acts with π/2π/2 angles between reflect…

2019-10-29abs ↗pdf ↗

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 ↗

We survey the role of right-angled Artin groups in the theory of diffeomorphism groups of low dimensional manifolds. We first describe some of the subgroup structure of right-angled Artin groups. We then discuss the interplay between algebraic structure, compactness, and regularity for group actions on one--dimensional…

2017-07-19abs ↗pdf ↗

We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of right-angled Coxeter groups. We use this characterization to describe a process for c…

2014-10-16abs ↗pdf ↗

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

problem Embedding twisted right-angled Artin groups in knot groups.
method Defined and characterized twisted right-angled Artin groups through mixed graphs and Klein bottle relations.
result Completely determined which twisted right-angled Artin groups can be embedded in knot groups.

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 ↗

Right-angled Artin groups are classified based on measure equivalence.

problem Classifying right-angled Artin groups using measure equivalence.
method Proved measure equivalence implies isomorphic extension graphs, and used quasi-isometry results.
result No right-angled Artin group is superrigid for measure equivalence.

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 ↗

We provide geometric conditions on a pair of hyperplanes of a CAT(0) cube complex that imply divergence bounds for the cube complex. As an application, we classify all right-angled Coxeter groups with quadratic divergence and show right-angled Coxeter groups cannot exhibit a divergence function between quadratic and cu…

2016-11-14abs ↗pdf ↗

We investigate the planarity of the boundaries of right-angled Coxeter groups. We show that non-planarity of the defining graph does not necessarily imply non-planarity of every boundary of the associated right-angled Coxeter group, although it does in many cases. Our techniques yield a characterization of the triangle…

2019-02-04abs ↗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.