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

119239358477 · Jun 202019922001200920172026
48 results for combinatorial complexity

In this paper we present the Ricci curvature on cell-complexes and show the Gauss-Bonnnet type theorem on graphs and 2-complex that decomposes closed surface. The defferential forms on a cell complex is defined as linear maps on chain complex, and Laplacian operates this defferential forms. Then we construct the Bochne…

2017-03-24abs ↗pdf ↗

The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of simplicial and cubical subdivisions of manifolds and, especially, spheres. We describe…

2000-10-07abs ↗pdf ↗

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 ↗

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.

We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However, that approach was unable to explicitly identify the invariant of transverse links …

2017-03-20abs ↗pdf ↗

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.

The Waldhausen construction of Mayer-Vietoris splittings of chain complexes over an injective generalized free product of group rings is extended to a combinatorial construction of Seifert-van Kampen splittings of CW complexes with fundamental group an injective generalized free product.

2003-08-12abs ↗pdf ↗

The free factor complex of rank 4+ fails a combinatorial isoperimetric inequality.

problem Failure of combinatorial isoperimetric inequality in the free factor complex.
method Construction of a coarsely Lipschitz function from the upward link of a free factor to integers.
result A loop in the free factor complex requires linearly growing number of 2-simplices to fill.

In this article we give combinatorial criteria to decide whether a transitive cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes, together with an explicit construction in the case that such a family exists. In addition, we substantially extend the classification of combinatorial…

2011-12-05abs ↗pdf ↗

New combinatorial model for Milnor fibration using oriented matroids.

problem Understanding the homotopy type of Milnor fibers of complexified real arrangements.
method Introducing a poset quasi-fibration based on a subdivision of the Salvetti complex and an oriented matroid.
result Homotopy type of Milnor fiber depends only on the combinatorial structure of the oriented matroid.

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.

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and prove that similar connections exist between the combinatorial expansion of a compl…

2012-07-03abs ↗pdf ↗

The paper shows how sublinearly Morse boundaries can be understood through combinatorial methods.

problem Understanding sublinearly Morse boundaries in cubulated groups and CAT(0) cube complexes.
method Combining geometric and combinatorial approaches to analyze sublinearly Morse boundaries.
result Sublinearly Morse boundaries can be described combinatorially and continuously related to Gromov and Roller boundaries.

The study shows that certain complex geometries are hyperbolic and contractible but fail to be CAT(0).

problem The failure of certain complex geometries to be CAT(0) despite being hyperbolic and contractible.
method The study uses combinatorial methods to demonstrate the failure of these geometries to satisfy a combinatorial isoperimetric inequality.
result The study proves that these geometries, while hyperbolic and contractible, do not satisfy a combinatorial isoperimetric inequality.

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.

Advances combinatorial complexes for better modeling of hierarchical and set-type relations.

problem Lack of effective modeling for complex hierarchical and set-type relations in high-dimensional data.
method Introduces combinatorial complexes as a bridge between cell complexes and hypergraphs, emphasizing their different types of relations.
result Combining set-type and hierarchical relations in a single model can be advantageous in learning tasks.

New combinatorial framework for geometric realizations of subword complexes.

problem Proving or disproving geometric realizations of subword complexes of Coxeter groups.
method Algebraic combinatorics and discrete geometry framework, parameter matrices.
result Existence of parameter matrices equivalent to realizability of subword complexes as chirotopes.

A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly regular combinatorial 2-manifold is degree-regular and a degree-regular combinator…

2005-08-05abs ↗pdf ↗

We present in this article a family of new combinatorial identities via purely differential/complex geometry methods, which include as a speical case a unified and explicit formula for Chern numbers of all complex flag manifolds. Our strategy is to construct concrete circle actions with isolated fixed points on these m…

2017-02-06abs ↗pdf ↗

This is the first installment of a book on combinatorial and geometric group theory from the topological point of view. This is a classical subject. The installment contains Chapters 1, 3 and 4, and there are nine chapters in total: 1. Combinatorial Complexes 2. Topological Invariants 3. Coverings 4. Galois Theory 5. G…

2009-02-23abs ↗pdf ↗

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.

A notion of up and down Grover walks on simplicial complexes are proposed and their properties are investigated. These are abstract Szegedy walks, which is a special kind of unitary operators on a Hilbert space. The operators introduced in the present paper are usual Grover walks on graphs defined by using combinatoria…

2017-06-29abs ↗pdf ↗

We prove that the complement of any affine 2-arrangement in R^d is minimal, that is, it is homotopy equivalent to a cell complex with as many i-cells as its i-th rational Betti number. For the proof, we provide a Lefschetz-type hyperplane theorem for complements of 2-arrangements, and introduce Alexander duality for co…

2012-11-06abs ↗pdf ↗

Link Floer homology is an invariant for links which has recently been described entirely in a combinatorial way. Originally constructed with mod 2 coefficients, it was generalized to integer coefficients thanks to a sign refinement. In this paper, thanks to the spin extension of the permutation group we give an alterna…

2007-06-01abs ↗pdf ↗

Mapping class group subgroups yield quasi-isometric curve complex.

problem Understanding the curve complex through coset intersections.
method Proving quasi-isometry and combinatorial equivalence of curve complex and coset intersection complex.
result Automorphism group of coset intersection complex is the extended mapping class group.

The paper classifies groups containing incommensurable lattices in Baumslag-Solitar complexes.

problem Classifying groups containing incommensurable lattices in Baumslag-Solitar complexes.
method Analyzing combinatorial automorphisms and properties of cell complexes.
result Conditions for the existence of incommensurable torsion-free lattices in Aut(Xm,n)(X_{m,n}).

Generalizes cohomology ring result for combinatorial line arrangements.

problem Cohomology ring of boundary manifold for combinatorial line arrangements.
method Introduced boundary manifold, constructed homology cycles, computed cohomology ring.
result Cohomology ring of boundary manifold is isomorphic to double of Orlik-Solomon algebra.

The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in connection with (discrete) differential geometry, geometric group theory and low-…

2014-03-11abs ↗pdf ↗

Top-k Combinatorial Bandits generalize multi-armed bandits, where at each round any subset of kk out of nn arms may be chosen and the sum of the rewards is gained. We address the full-bandit feedback, in which the agent observes only the sum of rewards, in contrast to the semi-bandit feedback, in which the agent obse…

2019-05-28abs ↗pdf ↗

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.

Paper analyzes FTPL's effectiveness in combinatorial semi-bandit problems.

problem Optimizing FTPL policy in combinatorial semi-bandit problems.
method Geometric resampling (GR) and conditional geometric resampling (CGR) for FTPL in semi-bandit setting.
result FTPL achieves optimal regret bounds in both Fréchet and Pareto distributions.

Study deformed Hermitian-Yang-Mills equation on complex projective space blowup.

problem Solving the deformed Hermitian-Yang-Mills equation on complex projective space blowup.
method Expressed the equation as an ODE and solved it using combinatorial methods under an algebraic stability condition.
result Evidence supporting a conjecture on general compact Kahler manifolds.

Moment-angle manifolds provide a wide class of examples of non-Kaehler compact complex manifolds. A complex moment-angle manifold Z is constructed via certain combinatorial data, called a complete simplicial fan. In the case of rational fans, the manifold Z is the total space of a holomorphic bundle over a toric variet…

2013-08-13abs ↗pdf ↗

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.

We study how the length and the twisting parameter of a curve change along a Teichmuller geodesic. We then use our results to provide a formula for the Teichmuller distance between two hyperbolic metrics on a surface, in terms of the combinatorial complexity of curves of bounded lengths in these two metrics.

2005-09-24abs ↗pdf ↗

This article deals with the generalization performance of margin multi-category classifiers, when minimal learnability hypotheses are made. In that context, the derivation of a guaranteed risk is based on the handling of capacity measures belonging to three main families: Rademacher/Gaussian complexities, metric entrop…

2018-09-19abs ↗pdf ↗

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This enhances the already known results by Frucht, Cori -- Machì, Širáň -- Škoviera, and …

2019-01-17abs ↗pdf ↗

Let MM be an nn-vertex combinatorial triangulation of a $\ZZ_2$-homology dd-sphere. In this paper we prove that if nd+8n \leq d + 8 then MM must be a combinatorial sphere. Further, if n=d+9n = d + 9 and MM is not a combinatorial sphere then MM can not admit any proper bistellar move. Existence of a 12-vertex triangula…

2005-06-27abs ↗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 ↗

Researchers solve 3D cube complex boundary rigidity problem.

problem Determining the combinatorial type of a 3D CAT(0) cube complex from boundary distances.
method Discrete version of boundary rigidity problem, focusing on CAT(0) cube complexes.
result The combinatorial type of a finite CAT(0) cube complex can be reconstructed from its boundary distances.