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

Trend · papers per month

2755508251,100 · Jun 202019922001200920172026
48 results for finite point sets

The paper proves group actions on spheres with odd fixed points.

problem Finite group actions on homology six-spheres with odd Euler characteristics.
method Analyzes smooth actions and fixed point sets of finite groups.
result The group is one of three specific types, and the fixed point set is a single point.

We determine the set of Busemann points of an arbitrary finite-dimensional normed space. These are the points of the horofunction boundary that are the limits of "almost-geodesics". We prove that all points in the horofunction boundary are Busemann points if and only if the set of extreme sets of the dual unit ball is …

2005-10-05abs ↗pdf ↗

A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is uniformly continuous for the hyperbolic metric, it is proved that the set of regula…

2012-03-07abs ↗pdf ↗

For any compact, connected, orientable, finite-type surface with marked points other than the sphere with three marked points, we construct a finite rigid set of its arc complex: a finite simplicial subcomplex of its arc complex such that any locally injective map of this set into the arc complex of another surface wit…

2019-09-19abs ↗pdf ↗

A homological selection theorem for C-spaces, as well as, a finite-dimensional homological selection theorem is established. We apply the finite-dimensional homological selection theorem to obtain fixed-point theorems for usco homologically UV^n set-valued maps.

2016-05-11abs ↗pdf ↗

Study shows limits of volume-constrained sets are finite unions of Wulff shapes.

problem Analyzing the behavior of sets with degenerating ellipticity.
method Proving rigidity of L1L^1-accumulation points of volume-constrained almost-critical sets.
result Limits of volume-constrained sets are finite unions of φφ-Wulff shapes.

Study properties of self-similar continua with finite intersection property.

problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.

Given a compact nn-dimensional immersed Riemannian manifold MnM^n in some Euclidean space we prove that if the Hausdorff dimension of the singular set of the Gauss map is small, then MnM^n is homeomorphic to the sphere SnS^n. Also, we define a concept of finite geometrical type and prove that finite geometrical type h…

2003-07-04abs ↗pdf ↗

Smooth finite-sum optimization has been widely studied in both convex and nonconvex settings. However, existing lower bounds for finite-sum optimization are mostly limited to the setting where each component function is (strongly) convex, while the lower bounds for nonconvex finite-sum optimization remain largely unsol…

2019-01-31abs ↗pdf ↗

Research on refined algebraic domains respecting differential geometry.

problem Understanding shapes and regions of real algebraic curves.
method Investigates points in two curves, singular points, inflection points, and points of double tangent lines, considering differential geometry.
result Proves fundamental properties and investigates examples of refined algebraic domains.

The goal of data clustering is to partition data points into groups to minimize a given objective function. While most existing clustering algorithms treat each data point as vector, in many applications each datum is not a vector but a point pattern or a set of points. Moreover, many existing clustering methods requir…

2017-03-14abs ↗pdf ↗

Finite presentations for mapping class groups of surfaces and surfaces with points/boundaries.

problem Finding finite presentations for balanced superelliptic mapping class groups.
method Construct finite presentations for corresponding liftable mapping class groups in a different generating set.
result Finite presentations for balanced superelliptic mapping class groups of various surfaces.

Unified framework for solving fixed-point equations in deterministic and stochastic settings.

problem Solving fixed-point equations for seminorm-contractive operators in both deterministic and stochastic contexts.
method Fixed-point theorem and stochastic approximation analysis.
result Unified finite-sample bounds for various reinforcement learning algorithms.

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.

We prove that every compact plane billiard, bounded by a smooth curve, is insecure: there exist pairs of points A,BA,B such that no finite set of points can block all billiard trajectories from AA to BB.

2007-05-23abs ↗pdf ↗

The classical kk-means algorithm for partitioning nn points in Rd\mathbb{R}^d into kk clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications. In this paper, we present an…

2013-08-19abs ↗pdf ↗

If (M,g) is a Riemannian manifold and x,y are points in M, then a subset P of M\{x,y} is said to be a blocking set for (x,y) if every geodesic from x to y passes through a point of P. If no pair (x,y) in M X M has a finite blocking set, then (M,g) is said to be totally insecure. We prove that there exist real analytic …

2011-09-07abs ↗pdf ↗

This paper solves nonparametric estimation of continuous DPPs using kernel methods.

problem Estimating continuous Determinantal Point Processes (DPPs) without assuming a parametric form.
method Developed a fixed point algorithm based on a representer theorem for nonnegative functions in RKHS.
result Demonstrated a finite-dimensional problem for nonparametric MLE of continuous DPPs.

Finite groups with a hyperelliptic involution have a 2-rank of at most 4.

problem Finite groups acting on hyperelliptic 3-manifolds and their sectional 2-rank.
method Analyzing sectional 2-rank of finite groups containing hyperelliptic involutions.
result The sectional 2-rank of such groups is at most 4, with 4 being the best possible upper bound.

A neural network model predicts the critical point of the Ising phase transition.

problem Predicting the critical point of the Ising phase transition using supervised learning.
method Proposed a minimal one-free-parameter neural network model to describe the supervised learning problem for the Ising model.
result Just one free parameter is enough to describe the universal finite-size-scaling function in the network output.

We construct finitely generated groups with strong fixed point properties. Let Xac\mathcal{X}_{ac} be the class of Hausdorff spaces of finite covering dimension which are mod-pp acyclic for at least one prime pp. We produce the first examples of infinite finitely generated groups QQ with the property that for any act…

2007-11-27abs ↗pdf ↗

Given a finite set of rr points in a closed surface of genus gg, we consider the torsion elements in the mapping class group of the surface leaving the finite set invariant. We show that the torsion elements generate the mapping class group if and only if (g,r)(2,5k+4)(g, r) \neq (2, 5k+4) for some integer kk.

2000-04-08abs ↗pdf ↗

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 ideal triangulations and disk unfolding for singular flat surfaces.

problem Proving ideal triangulations and disk unfolding for singular flat surfaces.
method Using geodesic triangulation and finite geodesic connections.
result Each singular flat surface has an ideal triangulation and can be unfolded into a flat disk.

We prove that every countable family of countable acylindrically hyperbolic groups has a common finitely generated acylindrically hyperbolic quotient. As an application, we obtain an acylindrically hyperbolic group QQ with strong fixed point properties: QQ has property FLpFL^p for all p[1,+)p\in [1, +\infty), and every ac…

2018-04-23abs ↗pdf ↗

For distinct points pp and qq in a two-dimensional Riemannian manifold, one defines their mediatrix LpqL_{pq} as the set of equidistant points to pp and qq. It is known that mediatrices have a cell decomposition consisting of a finite number of branch points connected by Lipschitz curves. This paper establishes addi…

2014-11-07abs ↗pdf ↗

The main result of this paper is a universal finiteness theorem for the set of all small dilatation pseudo-Anosov homeomorphisms, ranging over all surfaces. More precisely, we consider pseudo-Anosovs F:S to S with |chi(S)| log(lambda(F)) bounded above by some constant, and we prove that, after puncturing the surfaces a…

2009-05-02abs ↗pdf ↗

Surfaces of finite geometric type are complete, immersed into the tree-dimensional Euclidean space with finite total curvature and Gauss map extending to an oriented compact surface as a smooth branched covering map over the unit sphere of the Euclidean three dimensional space. In a recent preprint J. Jorge and F. Merc…

2019-06-21abs ↗pdf ↗

New algorithm finds approximate stationary points faster under differential privacy constraints.

problem Finding approximate stationary points of smooth and Lipschitz functions under differential privacy constraints.
method Developed an efficient algorithm that improves convergence rates to stationary points.
result Achieved faster rates of convergence to stationary points in both finite-sum and stochastic settings.