Related papers: Separating dots with circles

A method is proposed for defining an arbitrary number of differential calculi over a given noncommutative associative algebra. As an example the generalized quantum plane is studied. It is found that there is a strong correlation, but not a…

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

Rotating clusters or vortices are formations of agents that rotate around a common center. These patterns may be found in very different contexts: from swirling fish to surveillance drones. Here, we propose a minimal model for…

Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…

Using the orbit method we attempt to reveal geometric and algebraic meaning of separation of variables for the integrable systems on coadjoint orbits in an $\mathfrak{sl}(3)$ loop algebra. We consider two types of generic orbits embedded…

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

Clustering analysis identifies samples as groups based on either their mutual closeness or homogeneity. In order to detect clusters in arbitrary shapes, a novel and generic solution based on boundary erosion is proposed. The clusters are…

Clustering methods group a set of data points into a few coherent groups or clusters of similar data points. As an example, consider clustering pixels in an image (or video) if they belong to the same object. Different clustering methods…

The paper studies a discrete dynamical system, which belongs to the class of contour systems developed by A.P Buslaev. The system contains two closed contours. There are n cells and a group of particles at each contour. This group is called…

In an age of increasingly large data sets, investigators in many different disciplines have turned to clustering as a tool for data analysis and exploration. Existing clustering methods, however, typically depend on several nontrivial…

Given a sequence of oriented links L^1,L^2,L^3,... each of which has a distinguished, unknotted component, there is a decomposition of the 3-sphere naturally associated to it, which is constructed as the components of the intersection of an…

We use a simple fragmentation model to describe the statistical behavior of the Voronoi cell patterns generated by a set of points in 1D and in 2D. In particular, we are interested in the distribution of sizes of these Voronoi cells. Our…

We initiate a systematic study of the deep points of a cluster algebra; that is, the points in the associated variety which are not in any cluster torus. We describe the deep points of cluster algebras of type A, rank 2, Markov, and…

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…

The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…

For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$.

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show…