Related papers: Hyperspace Selections Avoiding Points

Low discrepancy point sets have been widely used as a tool to approximate continuous objects by discrete ones in numerical processes, for example in numerical integration. Following a century of research on the topic, it is still unclear…

For systems which contain both superselection structure and constraints, we study compatibility between constraining and superselection. Specifically, we start with a generalisation of Doplicher-Roberts superselection theory to the case of…

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

Let S be a topological property of sequences (such as, for example, "to contain a convergent subsequence" or "to have an accumulation point"). We introduce the following open-point game OP(X,S) on a topological space X. In the n'th move,…

We explore a multiple-stage variant of the min-max robust selection problem with budgeted uncertainty that includes queries. First, one queries a subset of items and gets the exact values of their uncertain parameters. Given this…

Working over the field of order 2 we consider those complete caps (maximal sets of points with no three collinear) which are disjoint from some codimension 2 subspace of projective space. We derive restrictive conditions which such a cap…

Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this…

In 1951, Ernest Michael wrote a definitive seminal article on hyperspaces raising a general question that became known as the hyperspace selection problem. The present paper contains some aspects of this problem, along with several open…

A topological space $X$ is selectively highly divergent (SHD) if for every sequence of non-empty open subsets $\{U_n: n\in \omega \}$ of $X$, we can pick a point $x_n\in U_n$, for every $n<\omega$, such that the sequence $\{x_n:…

Preferences play an important role in our everyday lives. CP-networks, or CP-nets in short, are graphical models for representing conditional qualitative preferences under ceteris paribus ("all else being equal") assumptions. Despite their…

The aim of this paper is to continue the study of sg-compact spaces, a topological notion much stronger than hereditary compactness. We investigate the relations between sg-compact and $C_2$-spaces and the interrelations to hereditarily…

For multidimensional Euclidean type spaces, we study convex choice: from any choice set, the set of types that make the same choice is convex. We establish that, in a suitable sense, this property characterizes the sufficiency of local…

We study various combinatorial properties, and the implications between them, for filters generated by infinite-dimensional subspaces of a countable vector space. These properties are analogous to selectivity for ultrafilters on the natural…

Understanding the behaviour of heuristic search methods is a challenge. This even holds for simple local search methods such as 2-OPT for the Traveling Salesperson problem. In this paper, we present a general framework that is able to…

In this paper we define some combinatorial principles to characterize spaces $X$ whose hyperspace satisfies some variation of some classical star selection principle. Specifically, the variations characterized are the selective and absolute…

A topological space is called P_2 ( P_3, P_{<omega} ) if and only if it does not contain two (three, finitely many) uncountable open sets with empty intersection. We show that (i) there are 0-dimensional P_{<omega} spaces of size 2^omega,…

We study computational aspects of the General Position Subset Selection problem defined as follows: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset…

Each continuous weak selection for a space $X$ defines a coarser topology on $X$, called a selection topology. Spaces whose topology is determined by a collection of such selection topologies are called continuous weak selection spaces. For…

For a topological space $X$ and a point $x \in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\in\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then…

Subspace clustering refers to the problem of clustering high-dimensional data points into a union of low-dimensional linear subspaces, where the number of subspaces, their dimensions and orientations are all unknown. In this paper, we…