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

1234 · Feb 202019922001200920172026
48 results for Farey tessellation

Study jigsaw constructions of hyperbolic lattices and answer questions on arithmeticity and pseudomodularity.

problem Constructing and analyzing non-commensurable, non-uniform, non-arithmetic lattices in hyperbolic geometry.
method Hyperbolic jigsaw construction and recursive formulas for tessellations.
result Demonstration of recursive formula for tessellation of hyperbolic plane, generalizing Farey addition.

Classifies 3-braids from choreographic motions on Lissajous curves, linking them to mapping classes and geodesics.

problem Classifying 3-braids from choreographic motions on Lissajous curves.
method Parametrization in terms of levels and slopes, using dilatation and geodesic cutting sequences.
result Dilatation of pseudo-Anosov mapping classes increases with level or slope.

Study of circle homeomorphisms with square summable diamond shears.

problem Characterizing circle homeomorphisms with specific summability properties.
method Analysis of homeomorphisms in modular coordinates and comparison to Weil-Petersson class.
result Sharp results comparing new class to Weil-Petersson class and Hölder classes.

This paper gives the first explicit, two-sided estimates on the cusp area of once-punctured torus bundles, 4-punctured sphere bundles, and 2-bridge link complements. The input for these estimates is purely combinatorial data coming from the Farey tesselation of the hyperbolic plane. The bounds on cusp area lead to expl…

2008-08-20abs ↗pdf ↗

For every half-translation surface with marked points (M,Σ)(M,Σ), we construct an associated tessellation Π(M,Σ)Π(M,Σ) of the Poincaré upper half plane whose tiles have finitely many sides and area at most ππ. The tessellation Π(M,Σ)Π(M,Σ) is equivariant with respect to the action of PSL(2,R)\mathrm{PSL}(2,\mathbb{R}), and invariant w…

2018-08-28abs ↗pdf ↗

We present a complete classification of elements in the mapping class group of the torus which have a representative that can be written as a product of two orientation reversing involutions. Our interest in such decompositions is motivated by features of the monodromy maps of real fibrations. We employ the property th…

2010-06-03abs ↗pdf ↗

Study finds polynomial convergence rate for Farey sequences linked to Riemann hypothesis.

problem Understanding convergence rates of maximum mean discrepancies for Farey sequences.
method Identifying positive-semidefinite kernels and their polynomial convergence rates.
result Polynomial convergence rate of maximum mean discrepancies of Farey sequences is equivalent to the Riemann hypothesis.

Every infinitely edge-connected graph has a minor of Farey graph or T0tT_{\aleph_0}\ast t.

problem Characterizing edge-connected graphs with specific minor properties.
method Analyzing the minor structure of infinitely edge-connected graphs.
result Infinitely edge-connected graphs contain Farey graph or T0tT_{\aleph_0}\ast t as a minor.

Study of qq-rationals and their geometric properties, including deformed Farey triangulation and Springborn operations.

problem Geometry of qq-rationals and their properties.
method Construction and analysis of deformed Farey triangulation and deformed modular surface; definition and study of Springborn operations.
result Derivation of a formula for the qq-deformed midpoint and new qq-deformation of Markov numbers.

The Farey tree helps embed rational balls and lens spaces into complex projective space.

problem Embedding rational homology balls and lens spaces into complex projective space.
method Recursive Kirby calculus argument using the Farey tree.
result Explicit constructions of embeddings of triples of rational homology balls into homotopy CP2\mathbb{CP}^2.

Optimal Farey sequence for Γ0(2n)Γ_0(2^n) with upper bound 2n12^{n-1}.

problem Finding an optimal Farey sequence for the congruence subgroup Γ0(2n)Γ_0(2^n).
method Proving the existence of a Farey sequence with specific properties and uniqueness.
result The upper bound of the Farey sequence is optimal and equals 2n12^{n-1}.

Study quasisymmetric maps on hyperbolic plane boundaries.

problem Identify quasisymmetric maps corresponding to specific lambda lengths and flip distances.
method Analyze maps on Farey triangulation, relate to shearing coordinates and flip distance.
result Identify quasisymmetric maps corresponding to pinched lambda lengths and flip distances.

Up to isomorphism there are six fixed-point free crystallographic groups in Euclidean Space generated by twists (screw motions). In each case, an orientable 3-manifold is obtained as the quotient of E3 by such a group. The cubic tessellation of E3 induces tessellations on each such manifold. These tessellations of the …

2015-05-01abs ↗pdf ↗

By regular tessellation, we mean any hyperbolic 3-manifold tessellated by ideal Platonic solids such that the symmetry group acts transitively on oriented flags. A regular tessellation has an invariant we call the cusp modulus. For small cusp modulus, we classify all regular tessellations. For large cusp modulus, we pr…

2014-06-11abs ↗pdf ↗

We present an explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F(n) embedded in CP3 defined by the equation z0^n + z1^n + z2^n + z3^n = 0 in the standard homogeneous coordinates [z0, z1, z2, z3], where n is any positive integer. Note that F(4) in particular is a K3 surface. Our tessellation…

2008-04-20abs ↗pdf ↗

The study of Farey polynomials connects geometry, topology, and combinatorics.

problem Understanding the combinatorics of Farey polynomials and their applications.
method Recursive definition of Farey polynomials, combinatorial analysis, and geometric/topological connections.
result New properties and recursive definition of Farey polynomials, providing practical solutions to classification problems.

The article describes how decorations on hyperbolic surfaces lead to unique tessellations and decompositions.

problem Understanding the geometric structure of decorated hyperbolic surfaces.
method Developing a characterisation of canonical tessellations and dual decompositions using hyperbolic geometry.
result Decorations on hyperbolic surfaces induce unique canonical tessellations and dual decompositions.

Develops a new non-adversarial framework for better generative models.

problem Inaccurate approximation of target distribution in latent space.
method Tessellated Wasserstein Auto-Encoders (TWAE) using centroidal Voronoi tessellation (CVT) to tessellate latent space.
result Significantly enhances generative performance in terms of FID compared to existing models.

The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and versions (necessarily modified from the Euclidean setting) of the empty circumsp…

2013-08-22abs ↗pdf ↗

We show that for a surface S, the subgraph of the pants graph determined by fixing a collection of curves that cut S into pairs of pants, once-punctured tori, and four-times-punctured spheres is totally geodesic. The main theorem resolves a special case of a conjecture made by Aramayona, Parlier, and Shackleton and has…

2013-07-27abs ↗pdf ↗

Bayesian model captures mean and variance of response variables.

problem Complex, predictor-dependent relationships and heteroscedastic patterns in data.
method Sum-of-tessellations for mean, product-of-tessellations for variance.
result Model captures nuanced variance structures and provides reliable predictive uncertainty.

With an eye towards studying curve systems on low-complexity surfaces, we introduce and analyze the kk-Farey graphs Fk\mathcal{F}_k and Fk\mathcal{F}_{\leqslant k}, two natural variants of the Farey graph in which we relax the edge condition to indicate intersection number =k=k or k\le k, respectively. The former, $\…

2018-10-21abs ↗pdf ↗

New algorithm optimizes tessellated kernels for larger datasets and improved performance.

problem Limited accuracy and complexity in machine learning algorithms based on kernel optimization.
method 2-step algorithm for optimizing tessellated kernels, scaling to 10,000 data points and extending to regression.
result Significant improvement in performance over Neural Nets and SimpleMKL with similar computation time.

There are certain families of words and word sequences (words in the generators of a two-generator group) that arise frequently in the Teichm{ü}ller theory of hyperbolic three-manifolds and Kleinian and Fuchsian groups and in the discreteness problem for two generator matrix groups. We survey some of the families of su…

2007-01-20abs ↗pdf ↗