Related papers: Characterizations of Ideal Cluster Points
If a discrete subset S of a topological group G with the identity 1 generates a dense subgroup of G and S \cup {1} is closed in G, then S is called a suitable set for G. We apply Michael's selection theorem to offer a direct,…
A topology $\tau$ on a set $X$ is called maximal connected if it is connected, but no strictly finer topology $\tau^* > \tau$ is connected. We consider a construction of so-called tree sums of topological spaces, and we show how this…
We show that, under suitably general formulations, covering properties, accumulation properties and filter convergence are all equivalent notions. This general correspondence is exemplified in the study of products. Let $X$ be a product of…
The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…
The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies of floating-point arithmetics. While…
Conditions on a topological space $X$ under which the space $C(X,\mathbb{R})$ of continuous real-valued maps with the Isbell topology $\kappa $ is a topological group (topological vector space) are investigated. It is proved that the…
For a separable locally compact but not compact metrizable space $X$, let $\alpha X = X \cup \{x_\infty\}$ be the one-point compactification with the point at infinity $x_\infty$. We denote by $EM(X)$ the space consisting of admissible…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope…
Given a set of vectors $\F=\{f_1,\dots,f_m\}$ in a Hilbert space $\HH$, and given a family $\CC$ of closed subspaces of $\HH$, the {\it subspace clustering problem} consists in finding a union of subspaces in $\CC$ that best approximates…
An intersection of sets $A = \bigcap_{i \in I}B_i$ is irredundant if no $B_i$ can be omitted from this intersection. We develop a topological approach to irredundance by introducing a notion of a spectral representation, a spectral space…
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…
Clustering aims to form groups of similar data points in an unsupervised regime. Yet, clustering complex datasets containing critically intertwined shapes poses significant challenges. The prevailing clustering algorithms widely depend on…
A precompact group topology $\tau$ on an abelian group $G$ is called {\em single sequence characterized} (for short, {\em ss-characterized}) if there is a sequence $\mathbf{u}= (u_n)$ in $G$ such that $\tau$ is the finest precompact group…
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness functions that measure the quality of a cluster within the graph.…
Topologies $\tau, \sigma$ on a set $X$ are called $\pi$-compatible if $\tau$ is a $\pi$-network for $\sigma$, and vice versa. If topologies $\tau, \sigma$ on a set $X$ are $\pi$-compatible then the families of nowhere dense sets (resp.…
We describe the Poisson ideals and attached symplectic geometry of a cluster algebra with compatible Poisson structure. We apply these results to determine the spectrum of a quantum cluster algebra. As an application, we describe the…
In this paper, we prove that if $I\subset S:=K[x_1,...,x_n]$ is a monomial ideal then $I$ and $S/I$ satisfy the Stanley conjecture when $I$ has a small number of generators, with respect to $\depth(S/I)$ and $\max\{|P|:\;P\in\Ass(S/I)\}$.…
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…
Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research. However, in a variety of situations we may have additional requirements or knowledge, distinct…