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.
Novel theory combines combinatorial and topological elements.
Combinatorial method computes Legendrian knot invariant.
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 …
Sarkar and Wang have given a combinatorial algorithm for computing Heegaard Floer homology and Plamenevskaya has improved their method to compute Ozsvath-Szabo invariant. In this paper, applying the combinatorial method to stabilizations of an open book, we prove basic properties of Ozsvath-Szabo invariant.
Surveying machine learning for solving graph optimization problems.
It is shown that for any piecewise-linear closed orientable manifold of odd dimension there exists an invariantly defined metric on the determinant line of cohomology with coefficients in an arbitrary flat bundle E over the manifold (E is not required to be unimodular). The construction of this metric (called Poincare …
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…
Polynomial-time method solves complex combinatorial semi-bandits.
ML4CO uses machine learning to improve combinatorial optimization solvers.
The paper computes special values of combinatorial zeta functions to reveal topological properties of manifolds.
We define a new combinatorial complex computing the hat version of link Floer homology over Z/2Z, which turns out to be significantly smaller than the Manolescu-Ozsvath-Sarkar one.
Via a computer search, Altshuler and Steinberg found that there are 1296 +1 combinatorial 3-manifolds on nine vertices, of which only one is non-sphere. This exceptional 3-manifold triangulates the twisted -bundle over . It was first constructed by Walkup. In this paper, we present a computer-…
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,ξ_std), we associate a corresponding multi-pointed nice Heegaard diagram. We then describe an explicit algorithm for computing the associ…
Transformers capture combinatorial tasks with bounded error and logarithmic sample dependence.
Derives Khovanov homology for 2-strand braids using combinatorial relations.
In this paper, we shall give an explicit Gauss diagram formula for the Kontsevich integral of links up to degree four. This practical formula enables us to actually compute the Kontsevich integral in a combinatorial way.
Study co-Higgs sheaves on toric varieties, finding explicit examples.
We show that every 3--manifold admits a Heegaard diagram in which a truncated version of Heegaard Floer homology (when the holomorpic disks pass through the basepoints at most once) can be computed combinatorially.
Using the combinatorial approach to Heegaard Floer homology we obtain a relatively easy formula for computation of hat Heegaard Floer homology for the three-manifold obtained by rational surgery on a knot K inside a homology sphere Y.
Graph neural networks improve combinatorial optimization by leveraging inductive bias.
Efficient algorithms for planning in cooperative multi-agent reinforcement learning with combinatorial action spaces.
Unified framework for geometric computation of minimum-area homotopy.
We describe an elementary combinatorial move on the set of quadratic differentials with a horizontal one cylinder decom-position. Computer experiment suggests that the corresponding equivalent classes are in one-to-one correspondence with the con-nected component of the strata.
Combinatorial approach to compute satellite knot invariants using graph theory.
Generalizes cohomology ring result for combinatorial line arrangements.
The paper extends log-Sobolev inequalities to matrix-valued settings using combinatorial methods.
This paper tackles combinatorial optimization under uncertainty with limited feedback.
A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is equivalent to computing the discrete homotopy group of the 1-skeleton of the permutahedr…
This paper is a short introduction to the combinatorial version of tangle Floer homology defined in "Combinatorial tangle Floer homology". There are two equivalent definitions---one in terms of strand diagrams, and one in terms of bordered grid diagrams. We present both, discuss the correspondence, and carry out some e…
Survey of methods for computing volumes of moduli spaces.
Researchers compute spin structures on hyperelliptic curves using braid groups.
In this paper we provide a new Bennequin-type inequality for the Rasmussen- Beliakova-Wehrli invariant, featuring the numerical transverse braid invariants (the c-invariants) introduced by the author. From the Bennequin type-inequality, and a combinatorial bound on the value of the c-invariants, we deduce a new computa…
Paper uses RL to solve constrained combinatorial optimization problems.
We develop the intersection theory at relative chain-cochain level, and apply it along with the use of Seifert disks for an oriented link to give a combinatorial algorithm to compute Massey's higher order linking numbers. It is subtle to compute higher-order linking numbers, and it has been a folklore to use the inters…
Simplified computation of SFT invariants for Legendrian links.
We define Discrete Quasi-Einstein metrics (DQE-metrics) as the critical points of discrete total curvature functional on triangulated 3-manifolds. We study DQE-metrics by introducing some combinatorial curvature flows. We prove that these flows produce solutions which converge to discrete quasi-Einstein metrics when th…
Developed a real sutured Heegaard Floer theory.
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…
CMOSS algorithm reduces regret in combinatorial semi-bandits with efficient computation.
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In addition, in the appendix by K. Sackel the F(q)-rational points of its graded a…
We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the interactions between algorithms and data, we establish a general lower bound tha…
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…
The embedded contact homology (ECH) of a 3-manifold with a contact form is a variant of Eliashberg-Givental-Hofer's symplectic field theory, which counts certain embedded J-holomorphic curves in the symplectization. We show that the ECH of T^3 is computed by a combinatorial chain complex which is generated by labeled c…
This paper investigates stochastic and adversarial combinatorial multi-armed bandit problems. In the stochastic setting under semi-bandit feedback, we derive a problem-specific regret lower bound, and discuss its scaling with the dimension of the decision space. We propose ESCB, an algorithm that efficiently exploits t…
Deep learning uncovers patterns between knot types.
This paper introduces the combinatorial Boolean model (CBM), which is defined as the class of linear combinations of conjunctions of Boolean attributes. This paper addresses the issue of learning CBM from labeled data. CBM is of high knowledge interpretability but naïve learning of it requires exponentially large compu…
The paper calculates the motive of a specific knot's character variety.
New method improves combinatorial optimization by overcoming inefficient sampling.