Related papers: A bound on partitioning clusters
We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…
Motivated by applications in DNA-based data storage, constrained codes have attracted a considerable amount of attention from both academia and industry. We study the maximum cardinality of constrained codes for which the constraints can be…
Most stars - especially young stars - are observed to be in multiple systems. Dynamical evolution is unable to pair stars efficiently, which leads to the conclusion that star-forming cores must usually fragment into \geq 2 stars. However,…
We study constrained clustering, where constraints guide the clustering process. In existing works, two categories of constraints have been widely explored, namely pairwise and cardinality constraints. Pairwise constraints enforce the…
We study the problem of partitioning a set of $n$ objects in a metric space into $k$ clusters $V_1,\dots,V_k$. The quality of the clustering is measured by considering the vector of cluster costs and then minimizing some monotone symmetric…
We present a novel approach to the riddle of star cluster multiple populations. Stars form from molecular cores. But not all cores form stars. Following their initial compression, such 'failed' cores re-expand, rather than collapsing. We…
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…
Genetic and comparative genomic studies indicate that extant genomes are more properly considered to be a fusion product of random mutations over generations and genomic material transfers between individuals of different lineages. This has…
We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…
Influence of surrounding matter on the properties of clusters is considered by an approach combining the methods of statistical and quantum mechanics. A cluster is treated as a bound N-particle system and surrounding matter as thermostat.…
We introduce several axioms which may or may not hold for any given subgraph of the directed graph of all organisms (past, present and future) where edges represent biological parenthood, with the simplifying background assumption that life…
In this paper, we study numbers $n$ that can be factored in four different ways as $n = A B = (A + a_1) (B - b_1) = (A + a_2) (B - b_2) = (A + a_3) (B - b_3)$ with $B \le A$, $1 \le a_1 < a_2 < a_3 \le C$ and $1 \le b_1 < b_2 < b_3 \le C$.…
For a given set of points in a metric space and an integer $k$, we seek to partition the given points into $k$ clusters. For each computed cluster, one typically defines one point as the center of the cluster. A natural objective is to…
We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…
We study the problem of explainability-first clustering where explainability becomes a first-class citizen for clustering. Previous clustering approaches use decision trees for explanation, but only after the clustering is completed. In…
In \cite{CK2005} and \cite{Hubery2005}, the authors proved the cluster multiplication theorems for finite type and affine type. We generalize their results and prove the cluster multiplication theorem for arbitrary type by using the…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
We consider the clustering aggregation problem in which we are given a set of clusterings and want to find an aggregated clustering which minimizes the sum of mismatches to the input clusterings. In the binary case (each clustering is a…
We investigate the formation of clusters of galaxies in an expanding universe using a new code that regrids at a region of high density. In particular we investigate two models for the initial conditions, both with the standard CDM power…
Obtaining robust galaxy number counts is crucial for understanding galaxy evolution, and submillimetre counts in particular have proven valuable for revising subgrid physics models in cosmological simulations. In confusion-limited surveys,…