arXiv research

The study provides bounds and necessary conditions for tunnel and cutting numbers of knots and handlebody-knots.

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

The cut number of a manifold M, c(M), is the largest number of disjoint two-sided hypersurfaces in M which do not separate M. Equivalently, it is the largest rank of a free group being an epimorphic image of pi_1(M). We investigate the relations between the cut number and the first Betti number, b_1(M), of 3-manifolds …

The question was raised as to whether the cut number of a 3-manifold X is bounded from below by 1/3 beta_1(X). We show that the answer to this question is `no.' For each m>0, we construct explicit examples of closed 3-manifolds X with beta_1(X)=m and cut number 1. That is, pi_1(X) cannot map onto any non-abelian free g…

We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.

Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.

Refines Hurwitz numbers with a two-parameter theory.

Algorithms based on spectral graph cut objectives such as normalized cuts, ratio cuts and ratio association have become popular in recent years because they are widely applicable and simple to implement via standard eigenvector computations. Despite strong performance for a number of clustering tasks, spectral graph cu…

We use quantum invariants to define a 3-manifold invariant j_p which lies in the non-negative integers. We relate j_p to the Heegard genus, and the cut number. We show that j_$ is an invariant of weak p-congruence.

Improved isolation forest for better outlier detection.

This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective functionals defined on proximity graphs of the given sample. Our f…

New 2-spheres of revolution with simple cut locus structures.

Study on limits and cut-off phenomena in deep neural networks.

By applying the symplectic cutting operation to cotangent bundles, one can construct a large number of interesting symplectic cones. In this paper we show how to attach algebras of pseudodifferential operators to such cones and describe the symbolic properties of the algebras.

Upper bound for lattice stick number of spatial graphs.

A local cut point is by definition a point that disconnectes its sufficiently small neighborhood. We show that there exists an upper bound for the degree of a local cut point in a metric measure space satisfying the generalized Bishop--Gromov inequality. As a corollary, we obtain an upper bound for the number of ends o…

We characterize the differentiable points of the distance function from a closed subset $N$ of an arbitrary dimensional Finsler manifold in terms of the number of $N$-segments. In the case of a 2-dimensional Finsler manifold, we prove the structure theorem of the cut locus of a closed subset $N$, namely that it is a lo…

The paper sets lower bounds on envy-free divisions in cake-cutting problems.

A new kernel for ranked data tackles computational challenges.

Among all torus links, we characterise those arising as links of simple plane curve singularities by the property that their fibre surfaces admit only a finite number of cutting arcs that preserve fibredness. The same property allows a characterisation of Coxeter-Dynkin trees (i.e., $A_n$, $D_n$, $E_6$, $E_7$ and $E_8$…

Spectral clustering is a popular and versatile clustering method based on a relaxation of the normalised graph cut objective. Despite its popularity, however, there is no single agreed upon method for tuning the important scaling parameter, nor for determining automatically the number of clusters to extract. Popular he…

Generalizes neural network verification by adding arbitrary cutting planes.

We investigate Legendrian graphs in $(\R^3, ξ_{std})$. We extend the classical invariants, Thurston-Bennequin number and rotation number to Legendrian graphs. We prove that a graph can be Legendrian realized with all its cycles Legendrian unknots with $tb=-1$ and $rot=0$ if and only if it does not contain $K_4$ as a mi…

Disk pairings with zero signature are related to topological surfaces.

Financial portfolios are often optimized for maximum profit while subject to a constraint formulated in terms of the Conditional Value-at-Risk (CVaR). This amounts to solving a linear problem. However, in its original formulation this linear problem has a very large number of linear constraints, too many to be enforced…

The paper confirms a conjecture and extends arrow polynomial to twisted links.

Binacox detects multiple cut-points in high-dimensional Cox models for genetic cancer data.

Paper generalizes graph Laplacian to hypergraphs for semi-supervised learning.

This paper studies the large sample asymptotics of data analysis procedures based on the optimization of functionals defined on $k$-NN graphs on point clouds. The paper is framed in the context of minimization of balanced cut functionals, but our techniques, ideas and results can be adapted to other functionals of rele…

In the present paper we give a proof of the fact that the sub-Riemannian cut locus of a wide class of nilpotent groups of step two, called $H$-type groups, starting from the origin corresponds to the center of the group. We obtain this result by completely describing the sub-Riemannian geodesics in the group, and using…

New algorithm clusters Gaussian mixtures with unknown covariance efficiently.

I give a formula for computing the number of regular $Γ$-coverings of closed orientable Seifert 3-manifolds, for a given finite group $Γ$. The number is computed using a 3d TQFT with finite gauge group, through a cut-and-glue process.

We determine the set of all genus g bridge numbers of many iterated torus knots, listing these numbers in a sequence called the bridge spectrum. In addition, we prove a structural lemma about the decomposition of a strongly irreducible bridge surface induced by cutting along a collection of essential surfaces.

In this paper we construct explicit examples of both closed and non-compact finite volume hyperbolic manifolds which provide counterexamples to the conjecture that the co-rank of a 3-manifold group (also known as the cut number) is bounded below by one-third the first Betti number.

NeuralCut learns to select cutting planes by looking ahead, outperforming traditional methods.

NeVI-Cut uses neural networks to efficiently propagate uncertainty without feedback.

Paper connects probability density cuts to graph theory eigenfunctions.

Study Riemannian metrics on lens spaces, find cut loci and diameters.

Study Riemannian metrics on lens spaces, find cut loci and diameters.

We consider a left invariant Riemannian metric on SO(3) with two equal eigenvalues. We find the cut locus and the equation for the cut time. We find the diameter of such metric and describe the set of all most distant points from the identity. Also we prove that the cut locus and the cut time converge to the cut locus …

Stability of cut locus under metric perturbations in compact Riemannian manifolds.

Improved reasoning model by sampling from power distribution without additional training.

New equivalence relation for links using cut-diagrams.

Defines new link-homotopy invariants using Milnor's higher order link invariants.

Study on mapping classes of real rational surface automorphisms, focusing on reducible maps and pseudo-Anosov maps.

Tangles improve clustering in various datasets.

We consider the problem of classifying data manifolds where each manifold represents invariances that are parameterized by continuous degrees of freedom. Conventional data augmentation methods rely upon sampling large numbers of training examples from these manifolds; instead, we propose an iterative algorithm called M…

Study shows convergence rates for Cheeger cuts on data clouds.