arXiv research

The paper studies embeddings of surfaces in 3-sphere, defining new invariants to distinguish knots and surfaces.

We study a problem of geometric graph theory: We determine the triply periodic graph in Euclidean 3-space which minimizes length among all graphs spanning a fundamental domain of 3-space with the same volume. The minimizer is the so-called srs network with quotient the complete graph on four vertices $K_4$. The network…

In view of the result of Kontsevich, now often called ``the fundamental theorem of Vassiliev theory'', identifying the graded dual of the associated graded vector space to the space of Vassiliev invariants filtered by degree with the linear span of chord diagrams modulo the ``4T-relation'' (and in the unframed case, th…

This paper develops a model of liquidity provision in financial markets by adapting the Madhavan, Richardson, and Roomans (1997) price formation model to realistic order books with quote discretization and liquidity rebates. We postulate that liquidity providers observe a fundamental price which is continuous, efficien…

We formulate and prove that there are "abundant" in nilpotent orbits in real semisimple Lie algebras, in the following sense. If S denotes the collection of hyperbolic elements corresponding the weighted Dynkin diagrams coming from nilpotent orbits, then S span the maximally expected space, namely, the (-1)-eigenspace …

We analyze the martingale selection problem of Rokhlin (2006) in a pointwise (robust) setting. We derive conditions for solvability of this problem and show how it is related to the classical no-arbitrage deliberations. We obtain versions of the Fundamental Theorem of Asset Pricing in examples spanning frictionless mar…

Let $Y$ be a sublattice of a vector lattice $X$. We consider the problem of identifying the smallest order closed sublattice of $X$ containing $Y$. It is known that the analogy with topological closure fails. Let $\overline{Y}^o$ be the order closure of $Y$ consisting of all order limits of nets of elements from $Y$. T…

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

For embedded 2-spheres in a 4-manifold sharing the same embedded transverse sphere homotopy implies isotopy, provided the ambient 4-manifold has no $\BZ_2$-torsion in the fundamental group. This gives a generalization of the classical light bulb trick to 4-dimensions, the uniqueness of spanning discs for a simple close…

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

Develops tests for Markowitz stochastic dominance spanning using saddle points.

Sharp bounds for spanning tree entropy in planar lattices.

Totally geodesic surfaces found in knots and links.

Research on probabilistic models of networks now spans a wide variety of fields, including physics, sociology, biology, statistics, and machine learning. These efforts have produced a diverse ecology of models and methods. Despite this diversity, many of these models share a common underlying structure: pairwise intera…

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 …

Study curvature of orthogonal distributions on manifolds.

A new classification method based on Minimum Spanning Trees

Canonical correlation analysis (CCA) is a fundamental statistical tool for exploring the correlation structure between two sets of random variables. In this paper, motivated by recent success of applying CCA to learn low dimensional representations of high dimensional objects, we propose to quantify the estimation loss…

Spanning attack improves black-box attacks with unlabeled data.

Refines knot defect measurement in 3D and 4D.

Ancient curves span halfplanes via flow.

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

Alexander polynomial equals spanning tree count at t=1.

We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show that the span of a knot is one if and only if it is non-trivial and alternating, an…

This paper improves speech recognition by using raw waveform signals in multi-span CNN acoustic models.

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

Enhances fairness in predictions without sacrificing accuracy.

New algorithms find optimal policies without knowing MDP span.

Study asymptotic expansion of graph Laplacian on discretized surfaces, relating spanning trees and cycle-rooted forests.

Non-spanning identification of scheduled event risk in option pricing.

New invariants measure how far spanning surfaces are from being compressible.

Study Murasugi sum in 4D for knotted surfaces, defining arborescent surfaces.

Nonorientable spanning surfaces of periodic knots can have arbitrarily high first Betti number.

For a spanning tree T of a connected graph G and for a labelling φ: E(T) \rightarrow {+, -}, φis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e \in E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph ha…

We investigate the time series of the degree of minimum spanning trees obtained by using a correlation based clustering procedure which is starting from (i) asset return and (ii) volatility time series. The minimum spanning tree is obtained at different times by computing correlation among time series over a time windo…

New methods evaluate stock market anomalies for prospect investors.

Plateau's problem is to find a surface with minimal area spanning a given boundary. In 1960, Reifenberg and Adams developed a definition for "span" using Čech homology, and variants of this definition have been used ever sense. However, limitations of Čech homology resulted in the lack of a natural definition for a bou…

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.

Differentiable clustering method using perturbed spanning forests.

Extracts credit-relevant information from earnings calls.

This paper shows neural networks can solve complex graph problems efficiently.

In this paper we provide the first examples of non-flat soap films proven to span tetrahedra. These are members of a continuous two parameter family of soap films with tetrahedral boundaries. Of particular interest is a two parameter subfamily where each spanning soap film has the property that two minimal surfaces mee…

We use a spanning tree model to prove a result of E. S. Lee on the support of Khovanov homology of alternating knots.

We analyze linear factor models for asset pricing panels.

A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus, orientability, and aggregate slope that a surface spanning that link can have. To thi…

Gradient span algorithms show consistent progress in high dimensions.

On the slit tangent manifold $TM^0$ of a Finsler space $(M,F)$ there are given some natural foliations as vertical foliation and some other fundamental foliations produced by the vertical and horizontal Liouville vector fields, see [A. Bejancu, H. R. Farran, Finsler Geometry and Natural Foliations on the Tangent Bundle…

Proposes a nonparametric approach for inferring spike train filters.