arXiv research

This work extends SVM error bounds to weighted SVM and introduces hyperparameter selection methods.

Sharp bounds for spanning tree entropy in planar lattices.

Proves bounds on spanning two-forests and random cut sizes.

We use the methods of Hedden, Juhasz, and Sarkar to exhibit a set of arborescent knots that bound large numbers of non-isotopic minimal genus spanning surfaces. In particular, we describe a sequence of prime knots K_{n} which will bound at least 2^{2n-1} non-isotopic minimal spanning surfaces of genus n.

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an embedded tubular neighborhood) of the curve. For fixed length, the expression giv…

We use the spanning tree model for Khovanov homology to study Legendrian links. This leads to an alternative proof for Ng's Khovanov bound for the Thurston-Bennequin number and to both a necessary and a sufficient condition for this bound to be sharp.

Refines knot defect measurement in 3D and 4D.

New algorithms reduce reinforcement learning regret in factored MDPs.

The paper develops strong lower bounds for projective Stiefel manifolds, resolving special cases with the Browder-Dupont invariant.

New method uses rational Witt span to bound concordance crosscap number of knots.

We derive bounds on the length of the meridian and the cusp volume of hyperbolic knots in terms of the topology of essential surfaces spanned by the knot. We provide an algorithmically checkable criterion that guarantees that the meridian length of a hyperbolic knot is below a given bound. As applications we find knot …

New spanning tree model connects knot homology, s-invariant, and exotic discs.

In this paper we investigate the life-span of classical solutions to the hyperbolic geometric flow in two space variables with slow decay initial data. By establishing some new estimates on the solutions of linear wave equations in two space variables, we give a lower bound of the life-span of classical solutions to th…

Let $M$ be an $n$-dimensional complete simply connected Riemannian manifold with sectional curvature bounded above by a nonpositive constant $-κ^2$. Using the cone total curvature $TC(Γ)$ of a graph $Γ$ which was introduced by Gulliver and Yamada Math. Z. 2006, we prove that the density at any point of a soap film-like…

New complexity measure helps in agnostic reinforcement learning with or without access to MDP dynamics.

New algorithms find optimal policies without knowing MDP span.

We introduce a new class of lower bounds on the log partition function of a Markov random field which makes use of a reversed Jensen's inequality. In particular, our method approximates the intractable distribution using a linear combination of spanning trees with negative weights. This technique is a lower-bound count…

We introduce SCAL, an algorithm designed to perform efficient exploration-exploitation in any unknown weakly-communicating Markov decision process (MDP) for which an upper bound $c$ on the span of the optimal bias function is known. For an MDP with $S$ states, $A$ actions and $Γ\leq S$ possible next states, we prove a …

New knot polynomials yield simple results modulo primes.

We introduce several geometric notions, including the width of a homology class, to the theory of persistent homology. These ideas provide geometric interpretations of persistence diagrams. Indeed, we give quantitative and geometric descriptions of the "life span" or "persistence" of a homology class. As a case study, …

In mathematics, the classical Plateau problem consists of finding the surface of least area that spans a given rigid boundary curve. A physical realization of the problem is obtained by dipping a stiff wire frame of some given shape in soapy water and then removing it; the shape of the spanning soap film is a solution …

For a knot $K$, Kakimizu introduced a simplicial complex whose vertices are all the isotopy classes of minimal genus spanning surfaces for $K$. The first purpose of this paper is to prove the 1-skeleton of this complex has diameter bounded by a function quadratic in knot genus, whenever $K$ is atoroidal. The second pur…

Let D be a link diagram with n crossings, s_A and s_B its extreme states and |s_AD| (resp. |s_BD|) the number of simple closed curves that appear when smoothing D according to s_A (resp. s_B). We give a general formula for the sum |s_AD|+|s_BD| for a k-almost alternating diagram D, for any k, characterising this sum as…

Improved linear upper bound for ribbonlength of knots.

Optimizes learning policies in average-reward MDPs with improved sample complexity.

Solves area minimizing surface problem in metric spaces with bounded genus.

Upper bound on Jones polynomials density modulo primes.

We investigate the problem of sequentially predicting the binary labels on the nodes of an arbitrary weighted graph. We show that, under a suitable parametrization of the problem, the optimal number of prediction mistakes can be characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the g…

Novel graph-spanning algorithm detects changes in high-dimensional data.

Researchers study rational and pretzel knots using affine group representations.

The Riemannian hemisphere has a lower bound for its mass.

New bounds on Seifert surfaces for alternating links are found.

Estimates tree-based density from random vectors.

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound on the span of the bracket polynomial of K as 4c_2(K), to the n-crossing number:…

We prove existence and regularity of minimizers for Hölder densities over general surfaces of arbitrary dimension and codimension in \(\R^n \), satisfying a cohomological boundary condition, providing a natural dual to Reifenberg's Plateau problem. We generalize and extend methods of Reifenberg, Besicovitch, and Adams,…

We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show that deciding whether a curve in a metrized PL 3-manifold bounds a surface of area…

New spanning 3-disks found for unlink in 4-sphere.

Relates geodesic integrals to Killing tensors, exploring their dimensions.

MSTs provide a fast and meaningful clustering method in low-dimensional data.

This paper studies the classification of high-dimensional Gaussian signals from low-dimensional noisy, linear measurements. In particular, it provides upper bounds (sufficient conditions) on the number of measurements required to drive the probability of misclassification to zero in the low-noise regime, both for rando…

Develops tests for Markowitz stochastic dominance spanning using saddle points.

For a given knot, we study the minimal number of positive eigenvalues of the double branched cover over spanning surfaces for the knot. The value gives a lower bound for various genera, the dealternating number and the alternation number of knots, and we prove that Batson's bound for the non-orientable 4-genus gives an…

Totally geodesic surfaces found in knots and links.

Study $Θ$-invariants for spherical 3-manifolds via $\mathbb{Z}π$-homology equivalences.

The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …

A new classification method based on Minimum Spanning Trees

Gordon and Litherland showed that all compact, unoriented, possibly non-orientable surfaces in $S^3$ bounded by a link are realted by attaching/deleting tubes and half twisted bands. In this note we give an elementary proof for this result.

Extends Gordon-Litherland pairing to links in thickened surfaces, defining new invariants.