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,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for finite order generators

A positive integer mm will be called a {\it finitistic order} for an element γγ of a group ΓΓ if there exist a finite group GG and a homomorphism h:ΓGh:Γ\to G such that h(γ)h(γ) has order mm in GG. It is shown that up to conjugacy, all but finitely many elements of a given finitely generated, torsion-free Kleinian gr…

2011-04-03abs ↗pdf ↗

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.

We show that for any po sitive integer mm, there exist order nn Stein corks. The boundaries are cyclic branched covers of slice knots embedded in the boundary of corks. By applying these corks to generalized forms, we give a method producing examples of many finite order corks, which are possibly not Stein cork.

2016-01-27abs ↗pdf ↗

We classify the groups quasi-isometric to a group generated by finite-order elements within the class of one-ended hyperbolic groups which are not Fuchsian and whose JSJ decomposition over two-ended subgroups does not contain rigid vertex groups. To do this, we characterize which JSJ trees of a group in this class admi…

2017-10-16abs ↗pdf ↗

Unified bounds for iterative algorithms with Gaussian data matrices.

problem Establishing non-asymptotic bounds for iterative algorithms with Gaussian data.
method Explicit coupling between iterates and Gaussian process with deterministic covariance.
result Tight, dimension-free bounds for generalized first-order methods.

It is a classical result in reduced homology of finite groups that the order of a group annihilates its homology. Similarly, we have proved that the torsion subgroup of rack and quandle homology of a finite quasigroup quandle is annihilated by its order. However, it does not hold for connected quandles in general. In t…

2015-10-12abs ↗pdf ↗

Motivated by well known results in low-dimensional topology, we introduce and study a topology on the set CO(G) of all left-invariant circular orders on a fixed countable and discrete group G. CO(G) contains as a closed subspace LO(G), the space of all left-invariant linear orders of G, as first topologized by Sikora. …

2015-08-11abs ↗pdf ↗

Efficiently approximates higher-order derivatives for generative models.

problem Expensive computation of higher-order derivatives in generative models.
method Rewrite SM objective in terms of directional derivatives and use finite difference for efficient approximation.
result Comparable results to gradient-based methods but significantly more computationally efficient.

Finite-sum optimization problems are ubiquitous in machine learning, and are commonly solved using first-order methods which rely on gradient computations. Recently, there has been growing interest in \emph{second-order} methods, which rely on both gradients and Hessians. In principle, second-order methods can require …

2016-11-15abs ↗pdf ↗

The C-spectral sequence was introduced by Vinogradov in the late Seventies as a fundamental tool for the study of algebro-geometric properties of jet spaces and differential equations. A spectral sequence arise from the contact filtration of the modules of forms on jet spaces of a fibring (or on a differential equation…

2001-11-13abs ↗pdf ↗

We introduce a notion of natural orderings of elements of finite connected quandles of order nn. When the elements of such a quandle QQ are already ordered naturally, any automophism on QQ is a natural ordering. Although there are many natural orderings, the operation tables for such orderings coincide when the perm…

2011-10-09abs ↗pdf ↗

We discuss intrinsic aspects of Krupka's approach to finite-order variational sequences. We give intrinsic isomorphisms of the quotient subsheaves of the short finite-order variational sequence with sheaves of forms on jet spaces of suitable order, obtaining a new finite-order (short exact) variational sequence which i…

2000-01-05abs ↗pdf ↗

Generalizes pseudo-product structures with abnormal extremals.

problem Finiteness of symmetry algebras for non-degenerate pseudo-product structures.
method Modified universal prolongation of graded nilpotent Lie algebras and generalized finiteness criterion.
result Distributions with singularly transitive properties have finite-dimensional symmetries.

We show that up to commensurability there are only finitely many cocompact arithmetic Kleinian groups generated by rotations. This implies, in particular, that there exist only finitely many conjugacy classes of cocompact two generated arithmetic Kleinian groups. The proof of the main result is based on a generalized G…

2016-10-19abs ↗pdf ↗

A new method for pricing options with stochastic volatility and jumps.

problem Pricing options under stochastic volatility and jumps.
method Fourth-order compact finite-difference scheme with implicit-explicit Crank-Nicolson framework.
result The method achieves near-fourth-order spatial accuracy and up to two orders of magnitude lower runtime than quadratic finite elements.

New method predicts state evolution for non-first-order algorithms on nonconvex problems.

problem Analyzing nonconvex optimization problems with random data.
method Developed a state evolution for a broader class of algorithms including first-order and saddle point updates.
result Established rigorous state evolution predictions and finite-sample guarantees for non-first-order methods.

We define new higher-order Alexander modules An(C)\mathcal{A}_n(C) and higher-order degrees δn(C)δ_n(C) which are invariants of the algebraic planar curve CC. These come from analyzing the module structure of the homology of certain solvable covers of the complement of the curve CC. These invariants are in the spirit of th…

2005-09-21abs ↗pdf ↗

We prove that if Q is a finite quasigroup quandle, then |Q| annihilates the torsion of its homology. It is a classical result in reduced homology of finite groups that the order of a group annihilates its homology. From the very beginning of the rack homology (between 1990 and 1995) the analogous result was suspected. …

2014-11-06abs ↗pdf ↗

New unoriented versions of Schur and Bogomolov multipliers for finite groups.

problem Defining and analyzing unoriented versions of Schur and Bogomolov multipliers.
method Using cohomology groups and quotient groups to define unoriented multipliers.
result Triviality of unoriented Bogomolov multiplier for certain groups, nontriviality for others.

Lower bounds for higher-order methods in non-convex optimization.

problem Proving lower bounds for higher-order methods in smooth non-convex finite-sum optimization.
method Analyzing deterministic and randomized algorithms, proposing a new smoothness assumption.
result Proves optimal lower bounds for simulating pth-order regularized methods on the whole function.

We discuss questions of isospectrality for hyperbolic orbisurfaces, examining the relationship between the geometry of an orbisurface and its Laplace spectrum. We show that certain hyperbolic orbisurfaces cannot be isospectral, where the obstructions involve the number of singular points and genera of our orbisurfaces.…

2004-11-12abs ↗pdf ↗

The paper proves that Gaussian field critical points have finite moments.

problem Proving the finiteness of moments for Gaussian field critical points.
method General approach not specific to critical points, using Taylor polynomial non-degeneracy.
result The finiteness of moments of the number of critical points of Gaussian fields.

New method estimates mixture model components efficiently.

problem Estimating the number of components in finite mixture models.
method Group-Sort-Fuse (GSF) procedure for simultaneous estimation of order and mixing measure.
result GSF achieves consistent estimation of true mixture order and n1/2n^{-1/2} convergence rate.

The paper introduces a new filtration for knot invariants and proves the existence of nontrivial knots.

problem The existence of nontrivial knots with specific invariant properties.
method Definition of F-order and n-triviality via virtualization and forbidden moves.
result Existence of infinitely many nontrivial classical knots and a nontrivial virtual knot with specific invariant properties.

We define AkA_k-moves for embeddings of a finite graph into the 3-sphere for each natural number kk. Let AkA_k-equivalence denote an equivalence relation generated by AkA_k-moves and ambient isotopy. AkA_k-equivalence implies Ak1A_{k-1}-equivalence. Let F{\cal F} be an Ak1A_{k-1}-equivalence class of the embeddings of …

2001-06-20abs ↗pdf ↗

We show that for any kk at least 66 and gg sufficiently large, the mapping class group of a surface of genus gg can be generated by three elements of order kk. We also show that this can be done with four elements of order 55. We additionally prove similar results for some permutation groups, linear groups, and a…

2017-10-12abs ↗pdf ↗