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

21426384 · Jun 202019922001200920172026
48 results for combinatorial configurations

Optimizes bounds for multiple T-singularities on surfaces.

problem Bounding T-singularities on non-rational projective surfaces with many singularities.
method Analyzes combinatorial configurations and classifies them to find optimal bounds.
result Classifies all combinatorial configurations leading to high bounds, proving their non-existence gives optimal bounds.

The paper classifies equivariant test configurations for spherical varieties.

problem Classifying equivariant test configurations for spherical varieties.
method Combinatorial data classification of equivariant normal R-test configurations.
result Finiteness theorem of central fibers of G-equivariant special R-test configurations.

The paper classifies test configurations and derives a criterion for uniform K-stability of certain algebraic varieties.

problem Uniform K-stability of GG-varieties of complexity 1.
method Classification of GG-equivariant normal test configurations via combinatorial data and derivation of a criterion for uniform K-stability.
result Derivation of a criterion for uniform K-stability in terms of combinatorial data.

We investigate several topological and combinatorial properties of line arrangements. We associate to a line arrangement a link obtained by intersecting the arrangement with some sphere. Several topics are discussed: (a) some link configurations can be realized by complex line arrangements but not by real line arrangem…

2012-07-03abs ↗pdf ↗

The invariant ΘΘ is an invariant of rational homology 3-spheres MM equipped with a combing XX over the complement of a point. It is related to the Casson-Walker invariant λλ by the formula Θ(M,X)=6λ(M)+p1(X)/4Θ(M,X)=6λ(M)+p_1(X)/4, where p1p_1 is an invariant of combings that is simply related to a Gompf invariant. In [arXiv:1209.32…

2014-02-10abs ↗pdf ↗

The paper classifies and computes limits of equivariant compactifications of groups.

problem Classifying and computing limits of equivariant compactifications of groups.
method Equivariant normal R-test configurations and semistable limits.
result Semistable limits of K-unstable Fano group compactifications are computed.

ML4CO uses machine learning to improve combinatorial optimization solvers.

problem Solving combinatorial problems in practice often involves related data distributions.
method Replacing heuristic components with machine learning approaches.
result Improved state-of-the-art combinatorial optimization solvers.

We study the Vassiliev knot invariant v_2 of degree 2. We present it via the degrees of maps of various configuration spaces related to a knot to products of spheres. This gives rise to numerous geometrical and combinatorial formulas for this invariant.

1999-03-28abs ↗pdf ↗

We show that the discretized configuration space of kk points in the nn-simplex is homotopy equivalent to a wedge of spheres of dimension nk+1n-k+1. This space is homeomorphic to the order complex of the poset of ordered partial partitions of {1,...,n+1}\{1,...,n+1\} with exactly kk parts. We compute the exponential generating…

2010-09-15abs ↗pdf ↗

We consider moduli spaces of cyclic configurations of NN lines in a 2n2n-dimensional symplectic vector space, such that every set of nn consecutive lines generates a Lagrangian subspace. We study geometric and combinatorial problems related to these moduli spaces, and prove that they are isomorphic to quotients of sp…

2018-12-11abs ↗pdf ↗

The paper calculates the Hilbert polynomials for configuration spaces over graphs with a short circumference.

problem Calculating the Betti numbers of configuration spaces over graphs with a short circumference.
method Using a combinatorial approach based on the canonical 1-bridge decomposition of the graph.
result An expression for the Hilbert polynomial of a graph in terms of its canonical 1-bridge decomposition.

Paper addresses hidden faces in configuration space integrals for embeddings.

problem Understanding hidden faces in configuration space integrals for long embeddings.
method Modified configuration space integrals incorporating acyclic bar complex of a dg algebra.
result Cochain map from new graph complex to de Rham complex of embeddings modulo immersions.

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements whose intersection points are doubles or triples. This result is obtained by consi…

2013-06-25abs ↗pdf ↗

New method improves combinatorial optimization by capturing dependencies among solution variables.

problem Performance limitations in solving combinatorial optimization problems using independent solution variables.
method Subgraph tokenization and variational annealing to capture dependencies and improve learning efficiency.
result Empirical evidence shows superior performance of autoregressive methods with tokenization and annealed entropy regularization.

Study on constraints for topological and smooth realizations of line arrangements and configurations.

problem Investigating constraints on topological and smooth realizations of combinatorial line arrangements and (nk)(n_k)-configurations.
method Exploring constraints via locally-flatly or smoothly embedded 2-spheres, using Furuta's 10/8-Theorem, and G-signature theorem.
result Established a new lower bound for (nk)(n_k)-configurations, showing nk25n \geq k^2-5 for topological realizations.

This paper focuses on Bayesian Optimization (BO) for objectives on combinatorial search spaces, including ordinal and categorical variables. Despite the abundance of potential applications of Combinatorial BO, including chipset configuration search and neural architecture search, only a handful of methods have been pro…

2019-02-01abs ↗pdf ↗

The performance of many algorithms in the fields of hard combinatorial problem solving, machine learning or AI in general depends on tuned hyperparameter configurations. Automated methods have been proposed to alleviate users from the tedious and error-prone task of manually searching for performance-optimized configur…

2019-06-18abs ↗pdf ↗

We study the problem of identifying the policy space of a learning agent, having access to a set of demonstrations generated by its optimal policy. We introduce an approach based on statistical testing to identify the set of policy parameters the agent can control, within a larger parametric policy space. After present…

2019-09-09abs ↗pdf ↗

Adaptive RL optimizes testing resource allocation for dynamic software environments.

problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.

We tackle the problem of constructive preference elicitation, that is the problem of learning user preferences over very large decision problems, involving a combinatorial space of possible outcomes. In this setting, the suggested configuration is synthesized on-the-fly by solving a constrained optimization problem, wh…

2017-11-22abs ↗pdf ↗

Many real-world problems can be reduced to combinatorial optimization on a graph, where the subset or ordering of vertices that maximize some objective function must be found. With such tasks often NP-hard and analytically intractable, reinforcement learning (RL) has shown promise as a framework with which efficient he…

2019-09-09abs ↗pdf ↗

Starting by a simple game QQ as a combinatorial data, we build up a cell complex M(Q)M(Q), whose construction resembles combinatorics of the permutohedron. The cell complex proves to be a combinatorial manifold; we call it the \textit{ simple game induced manifold.} By some motivations coming from polygonal linkages, w…

2013-11-27abs ↗pdf ↗

Role mining tackles the problem of finding a role-based access control (RBAC) configuration, given an access-control matrix assigning users to access permissions as input. Most role mining approaches work by constructing a large set of candidate roles and use a greedy selection strategy to iteratively pick a small subs…

2012-12-19abs ↗pdf ↗

We prove several combinatorial results on path algebras over discrete structures related to directed graphs. These results are motivated by Morse theory on a manifold with boundary and, more generally, by Floer theory on a configuration space with boundary. Their purpose is to organize cobordism relationships among mod…

2012-12-28abs ↗pdf ↗

Proves Yau-Tian-Donaldson conjecture for cohomogeneity one manifolds.

problem Proves Yau-Tian-Donaldson conjecture for a specific class of manifolds.
method Uses holomorphic actions of compact Lie groups and combinatorial conditions.
result Equivalence of K-uniform stability and K-stability for spherical varieties.

A brief review on the progress made in the study of Chern-Simons gauge theory since its relation to knot theory was discovered ten years ago is presented. Emphasis is made on the analysis of the perturbative study of the theory and its connection to the theory of Vassiliev invariants. It is described how the study of t…

1999-05-08abs ↗pdf ↗

We consider hyperbolic 3-manifolds with either non-empty compact geodesic boundary, or some toric cusps, or both. For any such M we analyze what portion of the volume of M can be recovered by inserting in M boundary collars and cusp neighbourhoods with disjoint embedded interiors. Our main result is that this portion c…

2012-06-07abs ↗pdf ↗

A central question in the study of line arrangements in the complex projective plane CP2\mathbb{CP}^2 is: when does the combinatorial data of the arrangement determine its topological properties? In the present work, we introduce a topological invariant of complexified real line arrangements, the chamber weight. This in…

2017-02-03abs ↗pdf ↗

We prove a criterion for K-stability of a Q\mathbb{Q}-Fano spherical variety with respect to equivariant special test configurations, in terms of its moment polytope and some combinatorial data associated to the open orbit. Combined with the equivariant version of the Yau-Tian-Donaldson conjecture for Fano manifolds p…

2016-08-05abs ↗pdf ↗

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

problem Finding ideal convex polyhedra with maximal volume in hyperbolic 3-space.
method Rivin's variational characterization and combinatorial optimization algorithms.
result Maximal volume ideal polyhedra have dihedral angles that are rational multiples of π.

Taubes established fundamental properties of JJ-holomorphic subvarieties in dimension 4 in \cite{T1}. In this paper, we further investigate properties of reducible JJ-holomorphic subvarieties. We offer an upper bound of the total genus of a subvariety when the class of the subvariety is JJ-nef. For a spherical class…

2012-10-11abs ↗pdf ↗

We prove the existence of self-similar expanding solutions of the curvature flow on planar networks where the initial configuration is any number of half-lines meeting at the origin. This generalizes recent work by Schnürer and Schulze which treats the case of three half-lines. There are multiple solutions, and these a…

2007-04-24abs ↗pdf ↗

Paper studies degenerated circle packings in hyperbolic geometry and finds conditions for their existence.

problem Whether a prescribed total geodesic curvature can be realized by a degenerated circle packing.
method Introduced combinatorial Ricci flow to find the desired degenerated circle packed surface, analogous to Chow-Luo and Takatsu methods.
result Fully characterized sufficient and necessary conditions for the existence of degenerated circle packings and showed their uniqueness.