Related papers: Constructing $7$-clusters
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…
Clustering is an unsupervised machine learning methodology where unlabeled elements/objects are grouped together aiming to the construction of well-established clusters that their elements are classified according to their similarity. The…
We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…
Biclustering has proved to be a powerful data analysis technique due to its wide success in various application domains. However, the existing literature presents efficient solutions only for enumerating maximal biclusters with constant…
Stability and chemistry, both exohedral and endohedral, of fullerenes are critically dependent on the distribution of their obligatory 12 pentagonal faces. It is well known that there are infinitely many IPR-fullerenes and that the…
Given the ubiquity of lattice models in physics, it is imperative for researchers to possess robust methods for quantifying clusters on the lattice --- whether they be Ising spins or clumps of molecules. Inspired by biophysical studies, we…
Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
Superclusters are the most massive structures in the universe. To what degree they are actually bound against an accelerating expansion of the background is of significant cosmological and astrophysical interest. In this study, we introduce…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
An integral lattice which is generated by some vectors of norm $q$ is called $q$-lattice. Classification of 3-lattices of dimension at most four is given by Mimura (On 3-lattice, 2006). As a expansion, we give a classification of 3-lattices…
We prove that each semi-invariant ring of the complete triple flag of length $n$ is an upper cluster algebra associated to an ice hive quiver. We find a rational polyhedral cone ${\sf G}_n$ such that the generic cluster character maps its…
Clusters of galaxies are merging during the formation of large-scale structures in the Universe. Based on optical survey data, we identify a large sample of pre-mergers of galaxy clusters and merging subclusters in rich clusters. We find…
We use a matched filter algorithm to find and study clusters in both N-body simulations artificially populated with galaxies and the 2MASS survey. In addition to numerous checks of the matched filter algorithm, we present results on the…
Clustering is one of the most fundamental problems in data analysis and it has been studied extensively in the literature. Though many clustering algorithms have been proposed, clustering theories that justify the use of these clustering…
Rich clusters of galaxies are the most massive virialized systems known. Even though they contain only a small fraction of all galaxies, rich clusters provide a powerful tool for the study of galaxy formation, dark matter, large-scale…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$ of order $s$ has size at least $t.$ An edge $e$ in a graph $G$ of order $n$ is called pancyclic if for every integer $k$ with $3\le k\le n,$ $e$ lies in a $k$-cycle. We…
The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…
The problem of finding the largest number of points in the unit cross-polytope such that the $l_{1}$-distance between any two distinct points is at least $2r$ is investigated for $r\in\left(1-\frac{1}{n},1\right]$ in dimensions $\geq2$ and…