arXiv research

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

The main result is a direct proof of the implication $(LVKF_{k,3})\Rightarrow( LT_{3k-1,3})$ below. Consider the following statements: ($LVKF_{1,3}$) From any 11 points in $\mathbb{R}^{3}$ one can choose 3 pairwise disjoint triples whose convex hulls have a common point. ($LVKF_{k,3}$) From any $6k + 5$ points in $ \m…

In a recent work, [19] studied the following "fair" variants of classical clustering problems such as $k$-means and $k$-median: given a set of $n$ data points in $\mathbb{R}^d$ and a binary type associated to each data point, the goal is to cluster the points while ensuring that the proportion of each type in each clus…

A lens cluster minimizes perimeter in the plane with given area constraints.

Exact partitioning of high-order planted models achieved through convex optimization.

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…

Paper proposes SaiyanH to learn BNs with full evidence propagation from dependent variables.

Proposes a new Lasso method with performance constraints.

Approximates cycles in planar and bounded-genus graphs.

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 …

Distributed sensors compress and send features to a fusion center for linear regression.

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.

A new classification method using disjoint centroids and normalized distance.

Developing classification algorithms that are fair with respect to sensitive attributes of the data has become an important problem due to the growing deployment of classification algorithms in various social contexts. Several recent works have focused on fairness with respect to a specific metric, modeled the correspo…

Developed Gompf connected sum for orbifolds, constructing symplectic and K-contact manifolds.

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.

This paper uses entropy to derive stock price dynamics and option valuation.

Study Markov staircases in symplectic embeddings of rational homology ellipsoids.

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…

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.

The width $w$ of a curve $γ$ in Euclidean space $R^n$ is the infimum of the distances between all pairs of parallel hyperplanes which bound $γ$, while its inradius $r$ is the supremum of the radii of all spheres which are contained in the convex hull of $γ$ and are disjoint from $γ$. We use a mixture of topological and…

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

Satellite knots can be trivialized by a single band move.

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

We consider the problem of reinforcement learning over episodes of a finite-horizon deterministic system and as a solution propose optimistic constraint propagation (OCP), an algorithm designed to synthesize efficient exploration and value function generalization. We establish that when the true value function lies wit…

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 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.

New framework for fair ranking with noisy protected attributes.

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

Neural Bayes simplifies computing complex stats for unsupervised learning.

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…

The problem of causal inference is to determine if a given probability distribution on observed variables is compatible with some causal structure. The difficult case is when the causal structure includes latent variables. We here introduce the $\textit{inflation technique}$ for tackling this problem. An inflation of a…

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.

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 …

A new neural network model for optimal treatment assignment.