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

68137205273 · Jun 202019922001200920172026
48 results for combinatorial relations

Graph neural networks improve combinatorial optimization by leveraging inductive bias.

problem Combinatorial optimization problems often arise from related data distributions.
method Using graph neural networks to enhance or solve combinatorial tasks.
result Graph neural networks effectively encode combinatorial and relational input.

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.

Derives Khovanov homology for 2-strand braids using combinatorial relations.

problem Computational difficulties in Khovanov-Rozansky homology computations.
method Combining state-sum descriptions and combinatorial relations to simplify computations.
result Computation of Khovanov-Rozansky invariant for 2-strand braid links confirmed.

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links. We then introduce a combinatorial notion of adjacency for bipartite graph links…

2011-11-16abs ↗pdf ↗

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.

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 ↗

Study adapts combinatorial semi-bandit for piecewise stationary, causally related rewards.

problem Nonstationary environment with changing base arms' distributions and causal relationships.
method Upper Confidence Bound (UCB) algorithm with change-point detector and group restart strategy.
result Regret upper bound reflecting effects of structural and distribution changes.

Equivalence relations can be defined on Gauss phrases using combinatorial moves. In this paper we consider two closely related equivalence relations on Gauss phrases, homotopy and open homotopy. In particular, in each case, we define a new invariant and determine the values that it can attain.

2008-10-24abs ↗pdf ↗

We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More s…

2012-11-17abs ↗pdf ↗

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.

The study explores globally defined eigenfamilies on closed manifolds, providing existence and orthogonality results.

problem Existence and properties of globally defined eigenfamilies on closed Riemannian manifolds.
method Analyzes topological properties, provides non-/existence results, and uses combinatorial identities.
result Highly rigid orthogonality relations for eigenfunction powers in L2(M)L^2(M).

Despite their impressive performance in many tasks, deep neural networks often struggle at relational reasoning. This has recently been remedied with the introduction of a plug-in relational module that considers relations between pairs of objects. Unfortunately, this is combinatorially expensive. In this extended abst…

2018-11-01abs ↗pdf ↗

The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial proof of Sperner's Lemma can be considered as a cochain-level version, written in…

2009-06-29abs ↗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 ↗

This is a survey article about knot Floer homology. We present three constructions of this invariant: the original one using holomorphic disks, a combinatorial description using grid diagrams, and a combinatorial description in terms of the cube of resolutions. We discuss the geometric information carried by knot Floer…

2014-01-28abs ↗pdf ↗

Traditional sequential multi-object attention models rely on a recurrent mechanism to infer object relations. We propose a relational extension (R-SQAIR) of one such attention model (SQAIR) by endowing it with a module with strong relational inductive bias that computes in parallel pairwise interactions between inferre…

2019-10-11abs ↗pdf ↗

For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the polynomial, defined by M.Las Vergnas in a combinatorial way using matroids as a spec…

2010-12-22abs ↗pdf ↗

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather than out of crossings. We describe an equivalence relation on clasp diagrams which…

2019-11-07abs ↗pdf ↗

In this paper we extend the classical theory of combinatorial manifolds to the non-homogeneous setting. NH-manifolds are polyhedra which are locally like Euclidean spaces of varying dimensions. We show that many of the properties of classical manifolds remain valid in this wider context. NH-manifolds appear naturally w…

2011-08-24abs ↗pdf ↗

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 ↗

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.

We give a combinatorial treatment of transverse homology, a new invariant of transverse knots that is an extension of knot contact homology. The theory comes in several flavors, including one that is an invariant of topological knots and produces a three-variable knot polynomial related to the A-polynomial. We provide …

2010-10-03abs ↗pdf ↗

A classical result by Pachner states that two dd-dimensional combinatorial manifolds with boundary are PL homeomorphic if and only they can be connected by a sequence of shellings and inverse shellings. We prove that for balanced, i.e., properly (d+1)(d + 1)-colored, manifolds such a sequence can be chosen such that bala…

2018-04-17abs ↗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 determine an explicit presentation by generators and relations of the cohomology algebra H(P2C,C)H^*(\mathbb P^2\setminus C,\mathbb C) of the complement to an algebraic curve CC in the complex projective plane P2\mathbb P^2, via the study of log-resolution logarithmic forms on P2\mathbb P^2. As a first consequence, we de…

2007-11-13abs ↗pdf ↗

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.

Recently Guillemin gave an explicit combinatorial way of constructing "toric" Kahler metrics on (symplectic) toric varieties, using only data on the moment polytope. In this paper, differential geometric properties of these metrics are investigated using Guillemin's construction. In particular, a nice combinatorial for…

1997-11-19abs ↗pdf ↗

Here are versions of the proofs of two classic theorems of combinatorial topology. The first is the result that piecewise linearly homeomorphic simplicial complexes are related by stellar moves. This is used in the proof, modelled on that of Pachner, of the second theorem. This states that moves from only a finite coll…

1999-11-20abs ↗pdf ↗

Combinatorial approach to compute satellite knot invariants using graph theory.

problem Computing knot invariants for satellite knots using bordered Heegaard Floer homology.
method Construct weighted AA_\infty-modules using decorated planar graphs and prove their isomorphism.
result Combinatorial proof of AA_\infty structure relations for the constructed modules.

We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series. We construct combinatorial models whose structure is encoded in the form of such difference equations, and whose generating fun…

2016-08-23abs ↗pdf ↗

We show that the refined analytic torsion is a holomorphic section of the determinant line bundle over the space of complex representations of the fundamental group of a closed oriented odd dimensional manifold. Further, we calculate the ratio of the refined analytic torsion and the Farber-Turaev combinatorial torsion.…

2006-03-28abs ↗pdf ↗