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

18375573 · Jun 202019922001200920172026
48 results for combinatorial criterion

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.

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 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.

Polyhedral semantics for intermediate logics; Nerve Criterion ensures completeness.

problem Characterize polyhedrally-complete intermediate logics.
method Developed Nerve Criterion to characterize polyhedrally-complete logics combinatorially.
result Nerve Criterion provides a necessary and sufficient condition for polyhedrally-completeness.

New symplectic embedding obstructions found for polydisks into half-integer ellipsoids.

problem Obstructing symplectic embeddings of polydisks into half-integer ellipsoids.
method Combinatorial criterion developed by Hutchings to obstruct symplectic embeddings.
result Optimal inclusion conditions for symplectic embeddings of polydisks into half-integer ellipsoids.

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 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 ↗

Let XX be a compact toric extremal Kähler manifold. Using the work of Székelyhidi, we provide a combinatorial criterion on the fan describing XX to ensure the existence of complex deformations of XX that carry extremal metrics. As an example, we find new CSC metrics on 4-points blow-ups of $\C¶^1\times\C¶^1$.

2012-01-19abs ↗pdf ↗

Transformers capture combinatorial tasks with bounded error and logarithmic sample dependence.

problem Capturing complex combinatorial tasks with bounded error and sample efficiency.
method Formal definition of algorithmic capture, empirical analysis of infinite-width transformers, upper bounds on computational complexity.
result Transformers exhibit an inductive bias favoring simpler algorithmic procedures over higher complexity ones.

The paper provides a combinatorial criterion for realizing tropical pluri-canonical divisors.

problem Determining when a tropical pair corresponds to a smooth algebraic curve with a pluri-canonical divisor.
method Introducing tropical normalized covers and reducing the problem to their realizability.
result Generalizes previous work on tropical canonical divisors and incorporates recent progress on kk-differentials.

The study establishes conditions for positive and quasi-positive links.

problem Characterizing and testing positive and quasi-positive links.
method Proves necessary conditions for link concordance and positivity.
result Characterizes positive links with unlinking number 1 and 2, and tests positive links as closures of positive braids.

The study shows how quotients of mapping class groups are hierarchically hyperbolic.

problem Understanding the hierarchical hyperbolicity of mapping class groups and their quotients.
method A combinatorial criterion for hierarchical hyperbolicity applied to mapping class groups.
result Quotients of mapping class groups by large powers of Dehn twists are hierarchically hyperbolic.

In this paper we show that for a given 3-manifold and a given Heegaard splitting there are finitely many preferred decomposing systems of 3g33g - 3 disjoint essential disks. These are characterized by a combinatorial criterion which is a slight strengthening of Casson-Gordon's rectangle condition. This is in contrast to…

2002-11-18abs ↗pdf ↗

The study examines Morse diagrams and their behavior under Murasugi sums, leading to contact structure classifications.

problem Understanding Morse diagrams and their behavior under Murasugi sums.
method Examination of combinatorial Morse structures, open book decompositions, and contact structures.
result Diagrammatic criterion for detecting overtwisted contact structures and classification of Morse diagrams for one-holed torus pages.

Kähler-Einstein metrics found on special types of symmetric varieties.

problem Finding Kähler-Einstein metrics on smooth Fano symmetric varieties with specific properties.
method Used a combinatorial criterion for K-stability of Fano spherical varieties and computed algebraic moment polytopes and barycenters.
result Proved all smooth Fano symmetric varieties with Picard number one admit Kähler-Einstein metrics.

This paper proves a conjecture of Fomin and Shapiro that their combinatorial model for any Bruhat interval is a regular CW complex which is homeomorphic to a ball. The model consists of a stratified space which may be regarded as the link of an open cell intersected with a larger closed cell, all within the totally non…

2007-11-08abs ↗pdf ↗

For (X,L) a polarized toric variety and G a torus of automorphisms of (X,L), denote by Y the GIT quotient X/G. We define a family of fully faithful functors from the category of torus equivariant reflexive sheaves on Y to the category of torus equivariant reflexive sheaves on X. We show, under a genericity assumption o…

2020-01-06abs ↗pdf ↗

The study finds Kähler-Einstein metrics on certain Fano varieties of type AIII.

problem Finding Kähler-Einstein metrics on specific Fano varieties.
method Using combinatorial criteria for K-polystability and properties of Fano varieties.
result Proves existence of Kähler-Einstein metrics on XmX_m for m4m \geq 4 and on YmY_m for m=4,5m = 4, 5.

From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such that the circle whose diameter is the edge does not contain any point of the point set in its interior. We define a generalization of the Gab…

2004-10-10abs ↗pdf ↗

A new fuzzy clustering method using hyperbolic smoothing for large datasets.

problem Building fuzzy clusters for large data sets efficiently.
method A novel smoothing numerical approach to relax the sum-of-squares criterion, converting the problem into a differentiable optimization problem.
result The method produces better fuzzy partitions compared to traditional fuzzy CC-means.

We consider high-dimensional binary classification by sparse logistic regression. We propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the non-asymptotic bounds for the resulting misclassification excess risk. The bounds can be reduc…

2017-06-26abs ↗pdf ↗

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every cell there corresponds a unique cell with the complementary set of vertices. Then …

2011-03-28abs ↗pdf ↗

Paper proposes a new method to learn EBMs and their partition function.

problem Intractability of exact MLE for EBMs due to partition function computation.
method Jointly learns an energy model and its log-partition function using neural networks.
result First tractable method for optimizing sparsemax loss in large spaces.

In response to a 1997 problem of M. Vidyasagar, we state a criterion for PAC learnability of a concept class C\mathscr C under the family of all non-atomic (diffuse) measures on the domain ΩΩ. The uniform Glivenko--Cantelli property with respect to non-atomic measures is no longer a necessary condition, and consisten…

2011-05-27abs ↗pdf ↗

Paper develops efficient incomplete U-statistics for degenerate cases.

problem High computational cost and non-standard asymptotic behavior in degenerate U-statistics.
method Characterizes dependence structure using hypergraph theory and combinatorial designs, bypassing traditional Hoeffding decomposition.
result Derives a Berry-Esseen bound for incomplete U-statistics of deterministic designs, enabling Gaussian limiting distributions in degenerate cases.

The paper introduces combinatorial Calabi flows to find hyperbolic metrics on surfaces with boundary.

problem Finding hyperbolic metrics on surfaces with totally geodesic boundaries of given lengths.
method Introducing combinatorial Calabi flows and proving their long time existence and global convergence.
result Proves the long time existence and global convergence of combinatorial Calabi flow on surfaces with boundary.

The paper classifies dense conjugacy classes in mapping class groups of locally finite graphs.

problem Identifying which mapping class groups have dense conjugacy classes.
method Developed flux homomorphisms and combinatorial criteria for stability.
result A complete classification for self-similar locally finite graphs and a criterion for stability.

The paper develops algorithms for finding metrics with prescribed combinatorial curvature on polyhedral surfaces.

problem Finding metrics with prescribed combinatorial curvature on polyhedral surfaces.
method Discrete uniformization theorem, combinatorial α-Yamabe flow, combinatorial α-Calabi flow, edge flipping surgery.
result Longtime existence and convergence of combinatorial α-Yamabe flow and combinatorial α-Calabi flow with surgery.