Related papers: Cutsets in ${\mathcal P}(X)$

We generalized the characterization of H-closedness for linearly ordered pospaces as follows: A pospace $X$ without an infinite antichain is an H-closed pospace if and only if $X$ is a directed complete and down-complete poset such that sup…

Let $C\subset \mathbb{P}^n$ be a rational normal curve and let $\ell_O:\mathbb{P}^{n+1}\dashrightarrow \mathbb{P}^n$ be any tangential projection form a point $O\in T_AC$ where $A\in C$. Hence $X:= \ell_O(C)\subset \mathbb{P}^n$ is a…

The additivity spectrum ADD(I) of an ideal I is the set of all regular cardinals kappa such that there is an increasing chain {A_alpha:alpha<kappa\} in the ideal I such that the union of the chain is not in I. We investigate which set A of…

For I a proper, countably complete ideal on P(X) for some set X, can the quotient Boolean algebra P(X)/I be complete? This question was raised by Sikorski in 1949. By a simple projection argument as for measurable cardinals, it can be…

The paper is concerned with families of plane algebraic curves that contain a given and quite special finite set X of points in the projective plane. We focus on the case in which the set X is formed by transversally intersecting pairs of…

Fix k>0, and let G be a graph, with vertex set partitioned into k subsets (`blocks') of approximately equal size. An induced subgraph of G is transversal (with respect to this partition) if it has exactly one vertex in each block (and…

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

We call a nonempty subset $A$ of a topological space $X$ finitely non-Urysohn if for every nonempty finite subset $F$ of $A$ and every family $\{U_x:x\in F\}$ of open neighborhoods $U_x$ of $x\in F$, $\cap\{\mathrm{cl}(U_x):x\in…

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…

For every infinite cardinal $\kappa$ with $\kappa^+=2^\kappa$ we construct a group $G$ of cardinality $|G|=\kappa^+$ such that (i) $G$ is $36$-Shelah, which means that $A^{36}=G$ for any subset $A\subseteq G$ of cardinality $|A|=|G|$; (ii)…

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the…

One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…

We say that a topological group $G$ is partially box $\kappa$-resolvable if there exist a dense subset $B$ of $G$ and a subset $A $ of $G$, $|A|=\kappa$ such that the subsets $\{ aB: a\in A\}$ are pairwise disjoint. If $G=AB$ then $G$ is…

Let $G$ be an infinite compact group. We prove that for every cardinal $\kappa$ between the density and the weight of $G$, there exists a dense subgroup of $G$ of density $\kappa$.

We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…