arXiv research

We present a new property, the Disjoint Path Concordances Property, of an ENR homology manifold X which precisely characterizes when X times R has the Disjoint Disks Property. As a consequence, X times R is a manifold if and only if X is resolvable and it possesses this Disjoint Path Concordances Property.

Approximates cycles in planar and bounded-genus graphs.

We study the use of power weighted shortest path distance functions for clustering high dimensional Euclidean data, under the assumption that the data is drawn from a collection of disjoint low dimensional manifolds. We argue, theoretically and experimentally, that this leads to higher clustering accuracy. We also pres…

BWFlow improves graph generation by smoothly interpolating graph components.

Classifies braids with positive Artin presentations and their fundamental groups.

We consider the problem of packing node-disjoint directed paths in a directed graph. We consider a variant of this problem where each path starts within a fixed subset of root nodes, subject to a given bound on the length of paths. This problem is motivated by the so-called kidney exchange problem, but has potential ot…

A Heegaard splitting of a closed, orientable three-manifold satisfies the disjoint curve property if the splitting surface contains an essential simple closed curve and each handlebody contains an essential disk disjoint from this curve [Thompson, 1999]. A splitting is full if it does not have the disjoint curve proper…

We show that all finite-dimensional resolvable generalized manifolds with the piecewise disjoint arc-disk property are codimension one manifold factors. We then show how the piecewise disjoint arc-disk property and other general position properties that detect codimension one manifold factors are related. We also note …

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an undirected graph can be connected by $k$ pairwise edge-disjoint paths if, and only…

A new classification method using disjoint centroids and normalized distance.

We establish causal semantics for SDEs and develop methods to reason about them.

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

Uniform bounds found for Sierpinski carpet hyperbolic components.

In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equil…

Given a link map f into a manifold of the form Q = N \times \Bbb R, when can it be deformed to an unlinked position (in some sense, e.g. where its components map to disjoint \Bbb R-levels) ? Using the language of normal bordism theory as well as the path space approach of Hatcher and Quinn we define obstructions \widet…

A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch which we call non-classical interval exchanges, form a subclass of linear involutions without flips. They are analogs of classical interval exchanges, and are…

We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number of circles meeting in a given cyclic order given 6 disjoint smooth closed curves…

A hyperlink is a finite set of non-intersecting simple closed curves in $\mathbb{R} \times \mathbb{R}^3$. Let $S$ be an orientable surface in $\mathbb{R}^3$. The dynamical variables in General Relativity are the vierbein $e$ and a $\mathfrak{su}(2)\times\mathfrak{su}(2)$-valued connection $ω$. Together with Minkowski m…

The paper introduces MU for NMF with $β$-divergences and disjoint constraints.

We prove that the number s(n) of disjoint minimal graphs supported on domains in R^n is bounded by e(n+1)^2. In the two-dimensional case we show that s(2) is at most three (the conjectured number is two).

We note a simple algebraic proof of Frolkina's result that $\mathbb R^3$ does not contain uncountably many pairwise disjoint copies of the Möbius band, and of a similar result in higher dimensions.

We show that many algebraic actions of higher-rank abelian groups on zero-dimensional groups are mutually disjoint. The proofs exploit differences in the entropy geometry arising from subdynamics and a form of Abramov--Rokhlin formula for half-space entropies.

New theorem on embedding Moebius bands in 3D space.

The study bounds the excess of disjoint nonorientable surfaces in a 4-manifold.

New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.

Variational autoencoders (VAEs) defined over SMILES string and graph-based representations of molecules promise to improve the optimization of molecular properties, thereby revolutionizing the pharmaceuticals and materials industries. However, these VAEs are hindered by the non-unique nature of SMILES strings and the c…

Satellite knots can be trivialized by a single band move.

New embeddings show answer to Baker-Laidacker question can be yes or no.

Embeddings of pairs of disjoint nonparallel primitive simple closed curves in the boundary of a genus two handlebody are classified. Briefly, two disjoint primitives either lie on opposite ends of a product $F \boldsymbol{\times} I$, or they lie on opposite ends of a kind of "twisted" product $F \widetilde{\boldsymbol{…

The topological fundamental group $π_{1}^{top}$ is a topological invariant that assigns to each space a quasi-topological group and is discrete on spaces which are well behaved locally. For a totally path-disconnected, Hausdorff, unbased space $X$, we compute the topological fundamental group of the "hoop earring" spac…

The following problem was proposed in 2010 by S. Lando. Let $M$ and $N$ be two unions of the same number of disjoint circles in a sphere. Do there always exist two spheres in 3-space such that their intersection is transversal and is a union of disjoint circles that is situated as $M$ in one sphere and as $N$ in the ot…

Simple curves enclose two small disks if they're wide and bend moderately.

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

Lin-Lu-Yau introduced an interesting notion of Ricci curvature for graphs and obtained a complete characterization for all Ricci-flat graphs with girth at least five [1]. In this paper, we propose a concrete approach to construct an infinite family of distinct Ricci-flat graphs of girth four with edge-disjoint 4-cycles…

After giving a general introduction to the main known results on the anisotropic Calder{ó}n problem on n-dimensional compact Riemannian manifolds with boundary, we give a motivated review of some recent non-uniqueness results obtained in [5, 6] for the anisotropic Calder{ó}n problem at fixed frequency, in dimension n $…

A biclustering algorithm finds dense disjoint subgraphs in weighted bipartite graphs.

We study the structure of finite quandles in terms of subquandles. Every finite quandle $Q$ decomposes in a natural way as a union of disjoint $Q$-complemented subquandles; this decomposition coincides with the usual orbit decomposition of $Q$. Conversely, the structure of a finite quandle with a given orbit decomposit…

Paper proposes a clustering algorithm for nonnegative data.

Let Y be a compact, oriented 3-manifold with a contact form a. For any Dirac operator D, we study the asymptotic behavior of the spectral flow between D and D+cl(-ira) as r very large. If a is the Thurston-Winkelnkemper contact form whose monodromy is the product of Dehn twists along disjoint circles, we prove that the…

Improved defense against data poisoning attacks by aggregating smaller subsets.

Efficient algorithms for monophonic halfspaces in graphs simplify learning and compression.

We introduce a parameterization method called Neural Bayes which allows computing statistical quantities that are in general difficult to compute and opens avenues for formulating new objectives for unsupervised representation learning. Specifically, given an observed random variable $\mathbf{x}$ and a latent discrete …

Study on planar graph braid groups' second homology.

In this paper we study how to distinguish two embeddings of a finite collection of disjoint circles into the plane up to planar isotopy. We adopt the spirit of the approach by V. Turaev, Operator Invariants of Tangles, Math. USSR-Izv. 35 (1990), 411--444, by considering a category of planar tangles and representing it …

We provide a self-contained treatment of set-theoretic subsolutions to flow by mean curvature, or, more generally, to flow by mean curvature plus an ambient vector field. The ambient space can be any smooth Riemannian manifold. Most importantly, we show that if two such set-theoretic subsolutions are initially disjoint…

Sparse routing networks with co-training prevent catastrophic forgetting in continual learning.

Short proofs for complex Tverberg theorems using prime powers.

In this paper we consider compact, Riemannian manifolds $M_1, M_2$ each equipped with a one-parameter family of metrics $g_1(t), g_2(t)$ satisfying the Ricci flow equation. Motivated by a characterization of the super Ricci flow developed by McCann-Topping, we introduce the notion of a super Ricci flow for a family of …