Related papers: Identifiability through special linear measurement…

Finite mixture models are statistical models which appear in many problems in statistics and machine learning. In such models it is assumed that data are drawn from random probability measures, called mixture components, which are…

Mutual-visibility sets were motivated by visibility in distributed systems and social networks, and intertwine with several classical mathematical areas. Monotone properties of the variety of mutual-visibility sets, and restrictions of such…

The inability to linearly classify XOR has motivated much of deep learning. We revisit this age-old problem and show that linear classification of XOR is indeed possible. Instead of separating data between halfspaces, we propose a slightly…

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

We address the following question of partial desingularization preserving normal crossings. Given an algebraic (or analytic) variety X in characteristic zero, can we find a finite sequence of blowings-up preserving the normal-crossings…

A point $p\in\mathbb{P}^N$ of a projective space is $h$-identifiable, with respect to a variety $X\subset\mathbb{P}^N$, if it can be written as linear combination of $h$ elements of $X$ in a unique way. Identifiability is implied by…

We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…

We propose a combinatorial method of proving non-specialty of a linear system of curves with multiple points in general positions. As an application we obtain a classification of special linear systems on P1xP1 for which the multiplicities…

Gathering data through measurements is at the basis of every experimental science. Ideally, measurements should be repeatable and, when extracting only coarse-grained data, they should allow the experimenter to retrieve the finer details at…

For a nonlinear ordinary differential equation solved with respect to the highest order derivative and rational in the other derivatives and in the independent variable, we devise two algorithms to check if the equation can be reduced to a…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

We study identities of finite dimensional algebras over a field of characteristic zero, graded by an arbitrary groupoid $\Gamma$. First we prove that its graded colength has a polynomially bounded growth. For any graded simple algebra $A$…

We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…

For a metrizable space $X$, we denote by $\mathrm{Met}(X)$ the space of all metric that generate the same topology of $X$. The space $\mathrm{Met}(X)$ is equipped with the supremum distance. In this paper, for every strongly…

We prove that, if X is a variety over an uncountable algebraically closed field k of characteristic zero, then any irreducible exceptional divisor E on a resolution of singularities of X which is not uniruled, belongs to the image of the…

Linearizability is a standard correctness criterion for concurrent algorithms, typically proved by establishing the algorithms' linearization points (LP). However, LPs often hinder abstraction, and for some algorithms such as the…

The problem of identifiability of finite mixtures of finite product measures is studied. A mixture model with $K$ mixture components and $L$ observed variables is considered, where each variable takes its value in a finite set with…

Let X be a complex Fano-manifolds with second Betti-number 1 which carries a contact structure. It follows from previous work that such a manifold can always be covered by lines. Thus, it seems natural to consider the geometry of lines in…

The linearizability of differential equations was first considered by Lie for scalar second order semi-linear ordinary differential equations. Since then there has been considerable work done on the algebraic classification of linearizable…

After generalizing the concept of clusters to incorporate clusters that are linked to other clusters through some relatively narrow bridges, an approach for detecting patches of separation between these clusters is developed based on an…