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.

169,341 papers · 148 categories

Trend · papers per month

3847671,1511,534 · Jun 202019922001200920182026
48 results for finite generating set

The paper constructs finite generating sets for complex algebraic structures.

problem Finite generation of specific algebraic structures.
method Explicit construction of finite generating sets for γ2IAnγ_2 IA_n and γ2Inbγ_2\mathcal I_n^b.
result Explicit finite generating sets for γ2IAnγ_2 IA_n and almost explicit for γ2Inbγ_2\mathcal I_n^b.

Finite generating sets exist and are generic for certain homeomorphism groups.

problem Existence and genericity of finite topological generating sets for homeomorphism groups.
method Analyzing specific groups like Diff+1(I)Diff_{+}^{1}(I) and Diff+1(S1)Diff_{+}^{1}(\mathbb{S}^1), and using Baire category theory.
result Genericity of finite topological generating sets in certain homeomorphism groups.

Develops algorithm for finite generating set of liftable mapping class groups of regular abelian covers.

problem Finding finite generating sets for liftable mapping class groups of regular abelian covers.
method Algorithm based on a result providing generating sets for groups acting on graphs with finite quotients.
result Provides finite generating sets for LModp(Sg)\mathrm{LMod}_p(S_g) for various regular abelian covers.

We found a finite set of maps to generate a subgroup of mapping class groups for non-orientable surfaces.

problem Generating a finite set of maps for the level 2 twist subgroup of mapping class groups of non-orientable surfaces.
method Used crosscap pushing maps and Dehn twists along non-separating loops and curves.
result Found a finite generating set for the level 2 twist subgroup of mapping class groups of non-orientable surfaces.

Study rectifiability of finite perimeter sets in RCD(K,N) spaces.

problem Understanding sets of finite perimeter in RCD(K,N) spaces.
method Developed a Gauss-Green integration by parts formula and proved rectifiability of the reduced boundary.
result Rectifiability of the reduced boundary for sets of finite perimeter over RCD(K,N) spaces.

Researchers address the generation of differential invariants for geometric structures.

problem Finite generation of differential algebra of relative differential invariants.
method Investigation of algebraic and differential properties, localization, weight analysis.
result Localization on a finite set of relative invariants makes the differential algebra finitely generated.

Set Flow models sets of data, learns dependencies, and achieves state-of-the-art likelihoods.

problem Modeling and sampling from finite, potentially high-dimensional, non-i.i.d. sets of data.
method Extends RealNVPs to handle finite sets, maintaining invertibility and exact log-likelihood evaluation.
result Achieves state-of-the-art likelihoods on 3D point clouds.

In this paper we provide a criteria for geometric finiteness of Kleinian groups in general dimension. We formulate the concept of conformal finiteness for Kleinian groups in space of dimension higher than two, which generalizes the notion of analytic finiteness in dimension two. Then we extend the argument in the paper…

2003-05-06abs ↗pdf ↗

In this paper, we prove a limit set intersection theorem in relatively hyperbolic groups. Our approach is based on a study of dynamical quasiconvexity of relatively quasiconvex subgroups. Using dynamical quasiconvexity, many well-known results on limit sets of geometrically finite Kleinian groups are derived in general…

2010-09-08abs ↗pdf ↗

The paper extends lossy coding to nonlinear latent representations.

problem Learning finite-dimensional coding schemes with nonlinear reconstruction maps.
method Generalizes Maurer--Pontil framework to nonlinear maps, connects to generative modeling, and provides generalization bounds.
result Established a connection to approximate generative modeling and presented generalization bounds.

We obtain an index of the complexity of a random sequence by allowing the role of the measure in classical probability theory to be played by a function we call the generating mechanism. Typically, this generating mechanism will be a finite automata. We generate a set of biased sequences by applying a finite state auto…

2008-12-10abs ↗pdf ↗

Study on self-similar sets on Riemannian manifolds with new separation conditions.

problem Analyzing self-similar sets on Riemannian manifolds with new separation conditions.
method Formulated weak separation and finite type conditions for conformal iterated function systems on Riemannian manifolds.
result Obtained formulas for Hausdorff dimensions of self-similar and graph self-similar sets.

Generic level sets in mean curvature flow are BV solutions.

problem Understanding the behavior of level sets in mean curvature flow.
method Using the framework of sets of finite perimeter and distributional solutions, the paper extends Evans and Spruck's work.
result Generic level sets are distributional solutions with optimal energy dissipation rate.

This work analyzes batch MARL with networked agents, providing finite-sample bounds.

problem Understanding the theoretical foundation of decentralized batch MARL with networked agents.
method Developed batch MARL algorithms for two settings: collaborative and competitive networks, without a central controller.
result Quantified finite-sample errors of estimated action-value functions for both settings.

This paper derives finite generating sets for liftable mapping class groups of certain branched covers of tori.

problem Tackles the structure of liftable mapping class groups of specific branched covers of tori.
method Uses Reidemeister-Schreier rewriting process and Birman-Hilden theory to derive finite generating sets.
result Derives finite generating sets for LModpk(S1,2)\mathrm{LMod}_{p_k}(S_{1,2}) for all k2k \geq 2.

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we discuss the possibility of finding an explicit set of defining equations (i.e. of exp…

2009-02-12abs ↗pdf ↗

In this paper, we obtain several results on the commensurability of two Kleinian groups and their limit sets. We prove that two finitely generated subgroups G1G_1 and G2G_2 of an infinite co-volume Kleinian group $G \subset \Isom(\mathbf{H}^3)$ having Λ(G1)=Λ(G2)Λ(G_1) = Λ(G_2) are commensurable. In particular, it is proved tha…

2010-04-10abs ↗pdf ↗

The paper develops algorithms to detect stability and Morse properties in various groups.

problem Detecting stability and Morse properties in finitely generated groups.
method Various detection and decidability algorithms for stability and Morse properties in specific types of groups.
result The algorithms provide a way to determine if a subgroup is stable or Morse in specific group types.

The paper studies properties of mapping class groups for surfaces with infinite fundamental groups.

problem Characterizing the algebraic and topological properties of mapping class groups for surfaces with infinite fundamental groups.
method Analyzes the isomorphism and automorphism properties of pure mapping class groups for surfaces with finite genus, and shows their algebraic and topological structure.
result The pure mapping class group detects the homeomorphism type of the surface and is residually finite if and only if the surface has finite genus.

Extended mapping class groups can be generated by two elements for low genus cases.

problem Generating finite order elements to represent extended mapping class groups.
method Proving finite order generating sets for specific genus cases.
result Extended mapping class groups can be generated by two elements for genus 3 and 4, but not for genus 1.

Study irrational pencils on complex manifolds, finding non-finitely generated homology.

problem Understanding the homology of the kernel induced by irrational pencils on complex manifolds.
method Analyzing critical points and homology of fundamental groups of complex manifolds.
result Homology of the kernel of the morphism induced by the pencil on fundamental groups is not finitely generated.

The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable surface. Then, either G is virtually abelian or it has infinite girth; moreover, if we …

2011-05-26abs ↗pdf ↗

A generalized Baumslag-Solitar (GBS) group is a finitely generated group acting on a tree with infinite cyclic edge and vertex stabilizers. We show how to determine effectively the rank (minimal cardinality of a generating set) of a GBS group; as a consequence, one can compute the rank of the mapping torus of a finite …

2013-04-29abs ↗pdf ↗

Suppose G is a non-free finitely generated Kleinian group without parabolics which is not a lattice and let C(G) denote the commensurator in PSL(2,C). We prove that if the limit set of G is not a round circle, then C(G) is discrete. Furthermore, G has finite index in C(G) unless G is a fiber group in which case C(G) is…

2009-08-17abs ↗pdf ↗