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

124249373497 · May 202619922001200920172026
48 results for combinatorial structures

The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.

problem Discrete conformal structures on polyhedral surfaces and their rigidity.
method Parameterized combinatorial curvature, combinatorial α-Ricci flow, and flow extension through singularities.
result Existence and convergence of combinatorial α-Ricci flow for solving the Yamabe problem.

New combinatorial structure for hierarchically hyperbolic spaces.

problem Constructing new hierarchically hyperbolic spaces.
method Combinatorial hierarchical hyperbolicity criterion to construct and clarify HHS structures.
result HHSs admit a combinatorial structure, clarifying the application of the combinatorial HHS criterion.

The paper studies deformation of discrete conformal structures on surfaces using combinatorial curvature flows.

problem Finding piecewise constant curvature metrics on surfaces with prescribed combinatorial curvatures.
method Combinatorial curvature flows, including Ricci flow and Calabi flow, are applied to deform Glickenstein's discrete conformal structures.
result The solution of the combinatorial Ricci flow can be uniquely extended and converges exponentially fast for any initial value under certain conditions.

Fractional combinatorial flow improves surface conformal structures.

problem Improving discrete conformal structures on surfaces.
method Introducing a fractional combinatorial Calabi flow for discrete conformal structures on surfaces.
result Longtime existence and global convergence of the fractional combinatorial Calabi flow for various surface types.

New discrete conformal structures on surfaces with boundary, proving global rigidity and constructing hyperbolic metrics.

problem Creating new discrete conformal structures on surfaces with boundary.
method Introducing new discrete conformal structures, proving global rigidity using variational principles, and introducing combinatorial curvature flows.
result Global rigidity of new discrete conformal structures and effective algorithms for constructing hyperbolic metrics.

Study on deforming discrete conformal structures on surfaces with boundaries.

problem Deforming discrete conformal structures on surfaces with boundaries.
method Introduce combinatorial Ricci flow and combinatorial Calabi flow, establish longtime existence and global convergence of solutions.
result Effective algorithms for finding discrete hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.

The optimization of expensive-to-evaluate black-box functions over combinatorial structures is an ubiquitous task in machine learning, engineering and the natural sciences. The combinatorial explosion of the search space and costly evaluations pose challenges for current techniques in discrete optimization and machine …

2018-06-22abs ↗pdf ↗

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global structure of the underlying graph. Examples include testing the graph connectivity…

2016-08-10abs ↗pdf ↗

SRL embeds combinatorial optimization into RL for better decision-making.

problem Challenges of standard RL in complex, structured decision-making problems.
method Structured Reinforcement Learning (SRL) with combinatorial optimization layers in actor neural network.
result SRL outperforms unstructured RL and imitation learning by up to 92% on dynamic problems.

We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker than the existence of the corresponding foliation, is sufficient to guarantee t…

1998-03-24abs ↗pdf ↗

The paper applies combinatorial Ricci flows to prove hyperbolic structures on 3-manifolds.

problem Proving the existence of hyperbolic structures on 3-manifolds with cusps.
method Combinatorial Ricci curvature flow methods to study pseudo 3-manifolds and ideal triangulations.
result The extended Ricci flow converges to a decorated hyperbolic polyhedral metric if and only if there exists a zero Ricci curvature metric.

Polynomial-time method solves complex combinatorial semi-bandits.

problem Optimal strategies for combinatorial semi-bandits with uncorrelated Gaussian rewards.
method Proposes a polynomial-time method to solve the Graves-Lai optimization problem for various combinatorial structures.
result First known approach to implement asymptotically optimal algorithms in polynomial time for combinatorial semi-bandits.

We study the moduli space of euclidean structures with cone points on a surface, and describe a decomposition into cells each of which corresponds to a given combinatorial type of Delaunay tessellation. We use some of the ideas to study hyperbolic structures on three-dimensional manifolds

1999-07-06abs ↗pdf ↗

In this paper we develop several algebraic structures on the simplicial cochains of a triangulated manifold that are analogues of objects in differential geometry. We study a cochain product and prove several statements about its convergence to the wedge product on differential forms. Also, for cochains with an inner p…

2005-05-11abs ↗pdf ↗

The study generalizes origamis to flat surfaces, exploring their combinatorial and geometric properties.

problem Understanding the geometric and combinatorial properties of flat surfaces.
method Developing a system of linear equations to represent flat surfaces and studying their Veech groups.
result Veech groups of certain flat surfaces are included under a specific covering relation.

The paper proves a combinatorial Ricci flow converges to hyperbolic structures on certain 3-manifolds.

problem Proving convergence of combinatorial Ricci flow to hyperbolic structures.
method Combinatorial Ricci flow on closed pseudo 3-manifolds with specific edge valences.
result Existence and uniqueness of a complete hyperbolic metric with totally geodesic boundary.

This paper gives a combinatorial description of spin and spin^c-structures on triangulated PL-manifolds of arbitrary dimension. These formulations of spin and spin^c-structures are established primarily for the purpose of aiding in computations. The novelty of the approach is we rely heavily on the naturality of binary…

2013-06-20abs ↗pdf ↗

New combinatorial structures for Teichmüller spaces with Thurston's metric are explored.

problem Understanding the combinatorial structures of Teichmüller spaces with Thurston's metric.
method Analyzing the unit tangent and cotangent spheres of Teichmüller space, proving formulas for dimensions and codimensions of faces.
result The combinatorial structure of unit spheres in Teichmüller spaces is independent of the underlying point and is isomorphic to the extended mapping class group.

Study inert and ambiguous classes in modular group using combinatorial methods.

problem Counting inert and ambiguous conjugacy classes in modular group.
method Purely combinatorial approach using word length in free product representation.
result Exact counting formulas and asymptotic growth rates for inert and ambiguous classes.

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a number of known results. New results include a combinatorial characterization of c…

2012-08-30abs ↗pdf ↗

Neural framework learns one solution from multiple for combinatorial problems.

problem Finding any one of many possible solutions for combinatorial problems.
method Adapts existing prediction networks to handle solution multiplicity using a selection module trained via RL.
result Framework significantly improves accuracy in solving combinatorial problems.

Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.

problem Determining quasi-isometries of Euclidean spaces.
method Introduces PLδPL_δ-homeomorphisms and combinatorial criterion using vertices and edges of simplicial structures.
result The center of the quasi-isometry group QI(Rn)QI(\mathbb{R}^n) is trivial.

Real moment-angle manifolds of combinatorially equivalent simple polytopes are equivariantly diffeomorphic.

problem Uniqueness of smooth structures on real moment-angle manifolds.
method Arguments from calculus applied to results from complex moment-angle manifolds.
result Real moment-angle manifolds of combinatorially equivalent simple polytopes are equivariantly diffeomorphic.

Computing uniformization maps for surfaces has been a challenging problem and has many practical applications. In this paper, we provide a theoretically rigorous algorithm to compute such maps via combinatorial Calabi flow for vertex scaling of polyhedral metrics on surfaces, which is an analogue of the combinatorial Y…

2018-06-06abs ↗pdf ↗

The paper studies the combinatorial p-th Calabi flow for finite and infinite circle patterns.

problem Establishing convergence and long-time existence of the combinatorial p-th Calabi flow.
method Combinatorial p-th Calabi flow for finite and infinite ideal circle patterns.
result Sharp criterion for convergence in finite case and long-time existence in infinite case for p2p \geq 2.

Bayesian optimization for high-dimensional combinatorial spaces using embeddings.

problem Optimizing expensive functions over large, complex input spaces.
method Dictionary-based ordinal embeddings for high-dimensional combinatorial structures, using Gaussian process models.
result The proposed method outperforms state-of-the-art BO methods on diverse real-world benchmarks.

New algorithm reduces regret in combinatorial causal bandits without graph structure.

problem Minimizing regret in combinatorial causal bandits without graph structure.
method Design of algorithms for binary general causal models and BGLMs without graph skeleton.
result Achieves O(TlnT)O(\sqrt{T}\ln T) expected regret for causal models and O(T23lnT)O(T^{\frac{2}{3}}\ln T) for BGLMs.

The hyperbolic structure of equilateral pentagons is mapped to a tiling of the hyperbolic plane.

problem Mapping the realization space of equilateral pentagons to a hyperbolic plane.
method Combining combinatorial correspondence, Riemann mapping theorem, and normalization procedure.
result A full conformal parameterization of the space of equilateral pentagons.

Surveying machine learning for solving graph optimization problems.

problem Solving combinatorial optimization problems on graphs requires algorithmic engineering.
method Surveying machine learning approaches for graph optimization.
result Machine learning offers new ways to solve graph optimization problems.

Researchers compute spin structures on hyperelliptic curves using braid groups.

problem Understanding spin structures on hyperelliptic curves of genus g.
method Action of the Artin braid group B_{2g+2} on spin structures, combinatorial computation of orbits and isotropy groups.
result Purely combinatorial computation of S_{2g+2}-orbits and isotropy groups of spin structures.

We extend to a scheme-theoretic context the notion of a combinatorial differential form, due to A.Kock in the framework of synthetic differential geometry. We show that group-valued combinatorial forms on a scheme may be identified, under very general hypotheses, with traditional Lie algebra-valued differential forms, …

2000-05-09abs ↗pdf ↗

In this article, we discuss the quasiconformal structure of boundaries of right-angled hyperbolic buildings using combinatorial tools. In particular we exhibit some examples of buildings of dimension 3 and 4 whose boundaries satisfy the combinatorial Loewner property. This property is a weak version of the Loewner prop…

2014-11-13abs ↗pdf ↗

New algorithm finds high-reward combinatorial sets with fewest pulls.

problem Finding high-reward combinatorial sets with unknown individual arm rewards.
method Successive acceptance and elimination based on combinatorial structure.
result Algorithm requires minimal combinatorial oracle calls, making it practical for large problems.

Floer constructs homology from flow lines in generalized dynamical systems and combinatorial vector fields.

problem Computing homology in discrete and smooth dynamical systems.
method Counting flow lines between orbits and critical points.
result Directly recovers Z2\mathbb{Z}_2 homology from flow lines.

A new algorithm tackles delayed combinatorial semi-bandit with causal relations.

problem Optimizing decisions in a non-stationary environment with delayed and causally related rewards.
method Formalized as a non-stationary delayed combinatorial semi-bandit problem, the approach models causal relations with a directed graph in a stationary structural equation model. The agent learns these relations from delayed feedback to optimize decisions.
result Proved a regret bound for the proposed algorithm's performance.

Constructs combinatorial 2D topological field theories from cyclic A-infinity algebras.

problem Developing a combinatorial framework for 2D topological field theories.
method Using triangulations and polygonal decompositions, constructing cochains on a CW complex.
result Existence of combinatorial 2D topological field theories based on cyclic A-infinity algebras.

We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…

2013-12-31abs ↗pdf ↗