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

121242362483 · Jun 202019922001200920172026
48 results for translation number

The natural automorphism group of a translation surface is its group of translations. For finite translation surfaces of genus g > 1 the order of this group is naturally bounded in terms of g due to a Riemann-Hurwitz formula argument. In analogy with classical Hurwitz surfaces, we call surfaces which achieve the maxima…

2013-11-28abs ↗pdf ↗

The paper proves Morse estimates for translated points on unit tangent bundles.

problem Estimating the minimal number of translated points in unit tangent bundles.
method Analyzing contactomorphisms of SMSM that lift diffeomorphisms of MM homotopic to identity.
result Proves the existence of sequences (pn,tn)(p_n,t_n) with tno+t_n o+\infty for a large class of manifolds.

There are only a few invariants one classically associates with precompact translation surfaces, among them certain numberfields, i.e. fields which are finite extensions of the field Q of rational numbers. These fields are closely related to each other; they are often even equal. We prove by constructing explicit examp…

2011-02-04abs ↗pdf ↗

The paper classifies translation surfaces in a specific hyperelliptic component and finds the maximum number of disjoint geodesics.

problem Classifying and understanding translation surfaces in a specific hyperelliptic component.
method Analyzing geodesics and Euclidean structures on hyperelliptic surfaces.
result A classification theorem for translation surfaces in Hhyp(4)\mathcal{H}^{\mathrm{hyp}}(4) and the maximum number of disjoint geodesics.

Translation surfaces with poles correspond to meromorphic differentials on compact Riemann surfaces. They appear in compactifications of strata of the moduli space of Abelian differentials and in the study of stability conditions. Such structures have different geometrical and dynamical properties than usual translatio…

2016-03-22abs ↗pdf ↗

The paper proves the exact number of singular points in the intersection of convex shapes.

problem Determining the exact number of singular points in the intersection of convex shapes.
method Analyzing the intersections of n translates of a strictly convex, smooth, convex body in the Euclidean plane.
result The intersection of n translates of a convex body has exactly n points of singularity along its boundary.

We show that an Anosov map has a geodesic axis on the curve graph of a torus. The direct corollary of our result is the stable translation length of an Anosov map on the curve graph is always a positive integer. As the proof is constructive, we also provide an algorithm to calculate the exact translation length for any…

2019-08-01abs ↗pdf ↗

The paper proves impossibilities and positive results for universal machine translation.

problem Learning shared sentence representations across multiple language pairs.
method Formal proofs and analysis of natural generative processes.
result Lower bound on translation error and positive results under natural structure.

This paper explores how pairs of multicurves can be realized as cylinders on translation surfaces.

problem Understanding when pairs of multicurves can be realized as cylinders on translation surfaces.
method Surface topology and flat grafting deformation.
result Pairs of multicurves can be realized as cylinders on some translation surface.

We show that when the genus and punctures of a surface are directly proportional by some rational number the minimal asymptotic translation length in the curve complex has behavior inverse to the square of the Euler characteristic. We also show that when the genus is fixed and the number of punctures varies the behavio…

2013-04-24abs ↗pdf ↗

Finite groups can be automorphism groups of translation surfaces with poles.

problem Existence of finite automorphism groups on translation surfaces with poles.
method Analyzing translation surfaces with poles and extending results to branched projective structures.
result Finite groups can be automorphism groups of translation surfaces with poles.

Abelian differentials on Riemann surfaces can be seen as translation surfaces, which are flat surfaces with cone-type singularities. Closed geodesics for the associated flat metrics form cylinders whose number under a given maximal length generically has quadratic asymptotics in this length, with a common coefficient c…

2005-03-30abs ↗pdf ↗

A translation structure on a surface is an atlas of charts to the plane so that the transition functions are translations. We allow our surfaces to be non-compact and infinite genus. We endow the space of all pointed surfaces equipped with a translation structure with a topology, which we call the immersive topology be…

2013-10-19abs ↗pdf ↗

Study shows mapping class groups are one-ended for surfaces with at least one end.

problem Analyzing the number of ends in mapping class groups of surfaces.
method Proving the associated translatable curve graph is one-ended, quasi-isometric to the mapping class group.
result Mapping class groups are one-ended for surfaces with at least one end of discrete type.

In this paper, we identify an interesting kind of error in the output of Unsupervised Neural Machine Translation (UNMT) systems like \textit{Undreamt}(footnote). We refer to this error type as \textit{Scrambled Translation problem}. We observe that UNMT models which use \textit{word shuffle} noise (as in case of Undrea…

2019-10-30abs ↗pdf ↗

The study shows how to measure translation surfaces with short saddle connections.

problem Measuring the probability of surfaces with short saddle connections.
method Using the multi-scale compactification of strata and algebraicity results.
result Proves strong regularity for invariant measures on translation surfaces.

Proposes a method to generate diverse translations by conditioning on target domain.

problem NMT models lack diversity in translations, even with search algorithms.
method Condition the decoder on a latent variable representing target domain, generated by a target encoder.
result Generated diverse translations without affecting performance or training time.

Formula estimates pseudo-Anosov maps' fixed points, linking to surface properties.

problem Estimating fixed points of pseudo-Anosov maps.
method Formula using Teichmüller translation length for fixed points of strong irreducible maps.
result Log of fixed points coarsely equals Teichmüller translation length for strong irreducible maps.

We study Veech groups of covering surfaces of primitive translation surfaces. Therefore we define congruence subgroups in Veech groups of primitive translation surfaces using their action on the homology with entries in Z/aZ\mathbb{Z}/a\mathbb{Z}. We introduce a congruence level definition and a property of a primitive t…

2014-03-19abs ↗pdf ↗

For a translation surface, we define the systole to be the length of the shortest saddle connection. We give a characterization of the maxima of the systole function on a stratum, and give a family of examples providing local but nonglobal maxima on each stratum of genus at least three. We further study the relation be…

2017-07-17abs ↗pdf ↗

A Clifford-Wolf translation of a connected Finsler space is an isometry which moves each point the sam distance. A Finsler space (M,F)(M, F) is called Clifford-Wolf homogeneous if for any two point x1,x2Mx_1, x_2\in M there is a Clifford-Wolf translation ρρ such that ρ(x1)=x2ρ(x_1)=x_2. In this paper, we study Clifford-Wolf transl…

2012-04-23abs ↗pdf ↗

New methods improve translation-equivariant neural processes for modeling unknown functions.

problem Modeling unknown latent functions from irregularly sampled measurements.
method Volterra series and set Fourier convolutions to address translation-equivariance and efficiency.
result Improved translation-equivariant neural processes with analytical transparency and linear scalability.

Study calculates slope gaps on polygon surfaces, finding non-unimodal distributions.

problem Understanding the distribution of slope gaps on polygon surfaces.
method Explicit computation of slope gap distributions for 2n-gons, providing bounds on non-differentiability points.
result Slope gap distributions are not always unimodal, answering a question by Athreya.

We give a relatively simple proof that a translation surface in Euclidean space that satisfies a relation of type aH+bK=caH+bK=c, for some real numbers a,b,ca,b,c, where HH and KK are the mean curvature and the Gauss curvature of the surface, respectively, must have a=0a=0 or b=0b=0, and thus, KK is constant or HH is constan…

2014-10-09abs ↗pdf ↗

The paper classifies vertices in planar polygons formed by convex domains.

problem Classifying vertices in planar polygons formed by convex domains.
method Analyzing polygons formed by homothets and translates of a convex domain.
result The number of singular boundary points in a CC-polygon is between nn and 2(n1)+m2(n-1)+m for a strictly convex domain with mm singular boundary points.

We compute the asymptotics, as R tends to infinity, of the number of closed geodesics in Moduli space of length at most R, or equivalently the number of pseudo-Anosov elements of the mapping class group of translation length at most R.

2008-11-14abs ↗pdf ↗

Uniqueness of circle packings on certain translation surfaces is proven.

problem Proving the uniqueness of circle packings on specific translation surfaces.
method Using splitting bigons to characterize variations of circle packings.
result For certain circle packings on H(1,1)H(1, 1) translation surfaces, there are only a finite number of ways the packing can vary without changing the contacts graph.

We obtain a quantitative estimate on the generalised index of translators for the mean curvature flow with bounded norm of the second fundamental form. The estimate involves the dimension of the space of weighted square integrable f-harmonic 1-forms. By the adaptation to the weighted setting of Li-Tam theory developed …

2018-04-20abs ↗pdf ↗

Characterizes braid group actions on R and mapping class group actions on S1.

problem Understanding the rigidity of braid group actions on R and mapping class group actions on S1.
method Using the space of left orderings of B_n, isolated points, and conjugacy action of B_n.
result Characterizes actions of B_n on R that produce translation numbers agreeing with the standard action.

The paper classifies shapes of translating solitons from isoparametric graphs.

problem Understanding shapes of translating solitons from isoparametric graphs.
method Analyzing ordinary differential equations and isoparametric functions.
result Classification of shapes of translating solitons.

Study flat metrics from right prisms, finding non-lattice surfaces with translation coverings.

problem Analyzing flat metrics from right regular prisms.
method Viewing prisms as n-differentials and analyzing unfoldings, proving translation coverings to hyperelliptic surfaces.
result Non-lattice surfaces admit translation coverings to hyperelliptic surfaces, allowing explicit computation of orbit closures and counting problems.

Construct pseudo-Anosovs from expanding interval maps, reconciling Thurston's construction.

problem Constructing pseudo-Anosov homeomorphisms from expanding interval maps.
method Classifying circumstances for constructing pseudo-Anosovs from a specific subclass of generalized pseudo-Anosovs.
result Produces pseudo-Anosovs on surfaces of genus gg with algebraically primitive translation structures and Salem dilatations.

Deep Reinforcement Learning (DRL) has shown impressive performance on domains with visual inputs, in particular various games. However, the agent is usually trained on a fixed environment, e.g. a fixed number of levels. A growing mass of evidence suggests that these trained models fail to generalize to even slight vari…

2020-01-27abs ↗pdf ↗

Most machine translation systems generate text autoregressively from left to right. We, instead, use a masked language modeling objective to train a model to predict any subset of the target words, conditioned on both the input text and a partially masked target translation. This approach allows for efficient iterative…

2019-04-19abs ↗pdf ↗